./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-70.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 13cde4b32ba56cbf3417fbd3d3edc8641f523883922a409d107d73798b0beac0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:06:26,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:06:26,457 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:06:26,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:06:26,465 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:06:26,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:06:26,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:06:26,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:06:26,496 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:06:26,496 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:06:26,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:06:26,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:06:26,499 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:06:26,501 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:06:26,501 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:06:26,502 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:06:26,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:06:26,502 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:06:26,503 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:06:26,503 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:06:26,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:06:26,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:06:26,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:06:26,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:06:26,507 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:06:26,507 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:06:26,508 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:06:26,508 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:06:26,508 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:06:26,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:06:26,508 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:06:26,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:06:26,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:06:26,509 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:06:26,509 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:06:26,509 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:06:26,510 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:06:26,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:06:26,510 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:06:26,510 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:06:26,510 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:06:26,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:06:26,512 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 13cde4b32ba56cbf3417fbd3d3edc8641f523883922a409d107d73798b0beac0 [2024-11-09 00:06:26,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:06:26,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:06:26,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:06:26,787 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:06:26,788 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:06:26,789 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-70.i [2024-11-09 00:06:28,265 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:06:28,477 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:06:28,478 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-70.i [2024-11-09 00:06:28,486 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76f017e59/3c0c76b502fe40059403bcdae81fb7f5/FLAG8479ca59a [2024-11-09 00:06:28,499 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76f017e59/3c0c76b502fe40059403bcdae81fb7f5 [2024-11-09 00:06:28,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:06:28,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:06:28,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:06:28,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:06:28,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:06:28,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:06:28" (1/1) ... [2024-11-09 00:06:28,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38a8d0dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:28, skipping insertion in model container [2024-11-09 00:06:28,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:06:28" (1/1) ... [2024-11-09 00:06:28,538 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:06:28,802 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-70.i[915,928] [2024-11-09 00:06:28,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:06:28,894 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:06:28,906 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-70.i[915,928] [2024-11-09 00:06:28,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:06:28,965 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:06:28,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:28 WrapperNode [2024-11-09 00:06:28,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:06:28,966 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:06:28,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:06:28,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:06:28,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:28" (1/1) ... [2024-11-09 00:06:28,982 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:28" (1/1) ... [2024-11-09 00:06:29,015 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-11-09 00:06:29,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:06:29,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:06:29,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:06:29,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:06:29,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:28" (1/1) ... [2024-11-09 00:06:29,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:28" (1/1) ... [2024-11-09 00:06:29,031 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:28" (1/1) ... [2024-11-09 00:06:29,055 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:06:29,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:28" (1/1) ... [2024-11-09 00:06:29,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:28" (1/1) ... [2024-11-09 00:06:29,070 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:28" (1/1) ... [2024-11-09 00:06:29,073 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:28" (1/1) ... [2024-11-09 00:06:29,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:28" (1/1) ... [2024-11-09 00:06:29,077 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:28" (1/1) ... [2024-11-09 00:06:29,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:06:29,081 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:06:29,081 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:06:29,081 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:06:29,082 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:28" (1/1) ... [2024-11-09 00:06:29,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:06:29,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:06:29,123 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:06:29,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:06:29,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:06:29,175 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:06:29,175 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:06:29,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:06:29,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:06:29,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:06:29,257 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:06:29,259 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:06:29,568 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-09 00:06:29,568 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:06:29,580 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:06:29,581 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:06:29,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:06:29 BoogieIcfgContainer [2024-11-09 00:06:29,581 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:06:29,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:06:29,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:06:29,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:06:29,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:06:28" (1/3) ... [2024-11-09 00:06:29,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21bf149b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:06:29, skipping insertion in model container [2024-11-09 00:06:29,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:28" (2/3) ... [2024-11-09 00:06:29,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21bf149b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:06:29, skipping insertion in model container [2024-11-09 00:06:29,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:06:29" (3/3) ... [2024-11-09 00:06:29,591 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-70.i [2024-11-09 00:06:29,608 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:06:29,609 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:06:29,663 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:06:29,668 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6bef3412, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:06:29,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:06:29,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 00:06:29,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 00:06:29,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:06:29,682 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:06:29,682 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:06:29,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:06:29,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1279566213, now seen corresponding path program 1 times [2024-11-09 00:06:29,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:06:29,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644219689] [2024-11-09 00:06:29,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:06:29,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:06:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:29,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:06:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:30,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:06:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:30,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:06:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:30,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 00:06:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:30,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:06:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:30,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 00:06:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:30,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 00:06:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:30,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 00:06:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:30,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 00:06:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:30,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 00:06:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:30,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 00:06:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:30,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 00:06:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:30,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:06:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:30,122 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-09 00:06:30,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:06:30,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644219689] [2024-11-09 00:06:30,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644219689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:06:30,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:06:30,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:06:30,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508475340] [2024-11-09 00:06:30,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:06:30,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:06:30,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:06:30,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:06:30,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:06:30,206 INFO L87 Difference]: Start difference. First operand has 51 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 00:06:30,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:06:30,231 INFO L93 Difference]: Finished difference Result 99 states and 158 transitions. [2024-11-09 00:06:30,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:06:30,234 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 90 [2024-11-09 00:06:30,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:06:30,243 INFO L225 Difference]: With dead ends: 99 [2024-11-09 00:06:30,243 INFO L226 Difference]: Without dead ends: 47 [2024-11-09 00:06:30,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:06:30,252 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:06:30,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:06:30,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-09 00:06:30,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-09 00:06:30,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 00:06:30,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions. [2024-11-09 00:06:30,291 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 90 [2024-11-09 00:06:30,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:06:30,292 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions. [2024-11-09 00:06:30,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 00:06:30,293 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2024-11-09 00:06:30,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 00:06:30,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:06:30,298 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:06:30,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:06:30,299 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:06:30,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:06:30,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1106177293, now seen corresponding path program 1 times [2024-11-09 00:06:30,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:06:30,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419051802] [2024-11-09 00:06:30,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:06:30,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:06:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:31,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:06:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:31,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:06:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:31,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:06:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:31,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 00:06:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:31,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:06:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:31,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 00:06:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:31,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 00:06:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:31,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 00:06:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:31,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 00:06:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:31,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 00:06:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:31,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 00:06:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:32,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 00:06:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:32,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:06:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-09 00:06:32,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:06:32,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419051802] [2024-11-09 00:06:32,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419051802] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:06:32,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188239841] [2024-11-09 00:06:32,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:06:32,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:06:32,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:06:32,103 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:06:32,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 00:06:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:32,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 00:06:32,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:06:33,321 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-09 00:06:33,321 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:06:33,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188239841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:06:33,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 00:06:33,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 19 [2024-11-09 00:06:33,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899790020] [2024-11-09 00:06:33,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:06:33,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 00:06:33,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:06:33,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 00:06:33,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2024-11-09 00:06:33,330 INFO L87 Difference]: Start difference. First operand 47 states and 66 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 00:06:34,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:06:34,060 INFO L93 Difference]: Finished difference Result 190 states and 264 transitions. [2024-11-09 00:06:34,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 00:06:34,061 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 90 [2024-11-09 00:06:34,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:06:34,064 INFO L225 Difference]: With dead ends: 190 [2024-11-09 00:06:34,064 INFO L226 Difference]: Without dead ends: 146 [2024-11-09 00:06:34,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=224, Invalid=768, Unknown=0, NotChecked=0, Total=992 [2024-11-09 00:06:34,066 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 175 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 00:06:34,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 274 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 00:06:34,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-09 00:06:34,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 96. [2024-11-09 00:06:34,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 65 states have internal predecessors, (81), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 00:06:34,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 133 transitions. [2024-11-09 00:06:34,114 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 133 transitions. Word has length 90 [2024-11-09 00:06:34,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:06:34,115 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 133 transitions. [2024-11-09 00:06:34,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 00:06:34,116 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 133 transitions. [2024-11-09 00:06:34,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 00:06:34,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:06:34,121 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:06:34,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 00:06:34,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:06:34,322 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:06:34,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:06:34,323 INFO L85 PathProgramCache]: Analyzing trace with hash 296830667, now seen corresponding path program 1 times [2024-11-09 00:06:34,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:06:34,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955809771] [2024-11-09 00:06:34,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:06:34,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:06:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:06:34,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1278184064] [2024-11-09 00:06:34,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:06:34,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:06:34,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:06:34,433 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:06:34,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 00:06:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:06:34,528 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:06:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:06:34,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:06:34,614 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:06:34,615 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:06:34,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 00:06:34,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-09 00:06:34,828 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 00:06:34,930 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:06:34,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:06:34 BoogieIcfgContainer [2024-11-09 00:06:34,940 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:06:34,941 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:06:34,941 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:06:34,941 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:06:34,942 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:06:29" (3/4) ... [2024-11-09 00:06:34,946 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:06:34,947 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:06:34,947 INFO L158 Benchmark]: Toolchain (without parser) took 6445.38ms. Allocated memory was 151.0MB in the beginning and 230.7MB in the end (delta: 79.7MB). Free memory was 94.1MB in the beginning and 142.8MB in the end (delta: -48.7MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. [2024-11-09 00:06:34,948 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory is still 51.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:06:34,948 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.52ms. Allocated memory is still 151.0MB. Free memory was 93.7MB in the beginning and 116.1MB in the end (delta: -22.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 00:06:34,948 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.83ms. Allocated memory is still 151.0MB. Free memory was 116.1MB in the beginning and 112.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:06:34,949 INFO L158 Benchmark]: Boogie Preprocessor took 63.39ms. Allocated memory is still 151.0MB. Free memory was 112.7MB in the beginning and 107.7MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 00:06:34,949 INFO L158 Benchmark]: RCFGBuilder took 500.81ms. Allocated memory is still 151.0MB. Free memory was 107.7MB in the beginning and 88.2MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 00:06:34,949 INFO L158 Benchmark]: TraceAbstraction took 5356.20ms. Allocated memory was 151.0MB in the beginning and 230.7MB in the end (delta: 79.7MB). Free memory was 87.6MB in the beginning and 143.8MB in the end (delta: -56.3MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2024-11-09 00:06:34,950 INFO L158 Benchmark]: Witness Printer took 5.80ms. Allocated memory is still 230.7MB. Free memory was 143.8MB in the beginning and 142.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:06:34,951 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory is still 51.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 462.52ms. Allocated memory is still 151.0MB. Free memory was 93.7MB in the beginning and 116.1MB in the end (delta: -22.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.83ms. Allocated memory is still 151.0MB. Free memory was 116.1MB in the beginning and 112.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.39ms. Allocated memory is still 151.0MB. Free memory was 112.7MB in the beginning and 107.7MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 500.81ms. Allocated memory is still 151.0MB. Free memory was 107.7MB in the beginning and 88.2MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5356.20ms. Allocated memory was 151.0MB in the beginning and 230.7MB in the end (delta: 79.7MB). Free memory was 87.6MB in the beginning and 143.8MB in the end (delta: -56.3MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * Witness Printer took 5.80ms. Allocated memory is still 230.7MB. Free memory was 143.8MB in the beginning and 142.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 109. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.05; [L23] double var_1_6 = 0.0; [L24] double var_1_7 = 49.5; [L25] double var_1_8 = 16.75; [L26] unsigned short int var_1_9 = 1; [L27] unsigned long int var_1_11 = 8; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 1; [L30] unsigned char var_1_14 = 32; [L31] unsigned char var_1_15 = 50; [L32] unsigned char var_1_16 = 8; [L33] unsigned char var_1_17 = 32; [L34] unsigned long int var_1_18 = 2; [L35] unsigned long int var_1_19 = 3876014737; [L36] unsigned char var_1_20 = 0; [L37] double last_1_var_1_1 = 5.05; [L38] unsigned short int last_1_var_1_9 = 1; [L39] unsigned long int last_1_var_1_11 = 8; [L40] unsigned char last_1_var_1_14 = 32; [L41] unsigned char last_1_var_1_20 = 0; VAL [isInitial=0, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_6=0, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L113] isInitial = 1 [L114] FCALL initially() [L115] int k_loop; [L116] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_6=0, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L116] COND TRUE k_loop < 1 [L117] CALL updateLastVariables() [L102] last_1_var_1_1 = var_1_1 [L103] last_1_var_1_9 = var_1_9 [L104] last_1_var_1_11 = var_1_11 [L105] last_1_var_1_14 = var_1_14 [L106] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_6=0, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L117] RET updateLastVariables() [L118] CALL updateVariables() [L79] var_1_6 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_6 >= 2305843.009213691390e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L80] RET assume_abort_if_not((var_1_6 >= 2305843.009213691390e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L81] var_1_7 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_8=67/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_8=67/4, var_1_9=1] [L82] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_8=67/4, var_1_9=1] [L83] var_1_8 = __VERIFIER_nondet_double() [L84] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L84] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L85] var_1_13 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L86] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L87] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L87] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L88] var_1_15 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L89] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L90] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L90] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L91] var_1_16 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L92] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L93] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L93] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L94] var_1_17 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L95] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L96] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L96] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L97] var_1_19 = __VERIFIER_nondet_ulong() [L98] CALL assume_abort_if_not(var_1_19 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_9=1] [L98] RET assume_abort_if_not(var_1_19 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_9=1] [L99] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_9=1] [L99] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_9=1] [L118] RET updateVariables() [L119] CALL step() [L45] COND TRUE \read(var_1_13) [L46] var_1_18 = ((var_1_19 - last_1_var_1_9) - last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_9=1] [L50] COND FALSE !(var_1_6 > ((((var_1_8) < (last_1_var_1_1)) ? (var_1_8) : (last_1_var_1_1)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_9=1] [L59] COND TRUE (8 - 64) <= (var_1_9 - var_1_9) [L60] var_1_14 = (((((var_1_15 + var_1_16)) < (var_1_17)) ? ((var_1_15 + var_1_16)) : (var_1_17))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_9=1] [L64] signed long int stepLocal_0 = - ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))); VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, stepLocal_0=-1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_9=1] [L65] COND FALSE !(var_1_18 >= stepLocal_0) [L68] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=0, var_1_7=2, var_1_9=1] [L70] COND TRUE (var_1_14 / var_1_19) <= ((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14))) [L71] var_1_20 = var_1_13 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=1, var_1_7=2, var_1_9=1] [L73] COND TRUE \read(var_1_20) [L74] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=1, var_1_7=2, var_1_9=1] [L76] var_1_11 = (var_1_9 + (((((var_1_18) < (var_1_9)) ? (var_1_18) : (var_1_9))) + 2u)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=1, var_1_7=2, var_1_9=1] [L119] RET step() [L120] CALL, EXPR property() [L109-L110] return (((((((var_1_18 >= (- ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))))) ? (var_1_1 == ((double) (((var_1_6 - var_1_7) - ((((64.75) > (128.725)) ? (64.75) : (128.725)))) + var_1_8))) : (var_1_1 == ((double) var_1_7))) && ((var_1_6 > ((((var_1_8) < (last_1_var_1_1)) ? (var_1_8) : (last_1_var_1_1)))) ? ((! ((last_1_var_1_1 == var_1_7) && (last_1_var_1_20 || last_1_var_1_20))) ? ((! (var_1_6 <= var_1_7)) ? (var_1_9 == ((unsigned short int) ((((last_1_var_1_14) < (last_1_var_1_14)) ? (last_1_var_1_14) : (last_1_var_1_14))))) : 1) : (var_1_9 == ((unsigned short int) last_1_var_1_14))) : 1)) && (var_1_11 == ((unsigned long int) (var_1_9 + (((((var_1_18) < (var_1_9)) ? (var_1_18) : (var_1_9))) + 2u))))) && (var_1_20 ? (var_1_12 == ((unsigned char) var_1_13)) : 1)) && (((8 - 64) <= (var_1_9 - var_1_9)) ? (var_1_14 == ((unsigned char) (((((var_1_15 + var_1_16)) < (var_1_17)) ? ((var_1_15 + var_1_16)) : (var_1_17))))) : (var_1_14 == ((unsigned char) var_1_17)))) && (var_1_13 ? (var_1_18 == ((unsigned long int) ((var_1_19 - last_1_var_1_9) - last_1_var_1_11))) : (var_1_18 == ((unsigned long int) (((((var_1_19 - var_1_17)) > (var_1_15)) ? ((var_1_19 - var_1_17)) : (var_1_15))))))) && (((var_1_14 / var_1_19) <= ((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14)))) ? (var_1_20 == ((unsigned char) var_1_13)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=1, var_1_7=2, var_1_9=1] [L120] RET, EXPR property() [L120] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=1, var_1_7=2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=1, var_1_7=2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 3, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 175 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 175 mSDsluCounter, 344 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 190 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 276 IncrementalHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 154 mSDtfsCounter, 276 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=2, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 50 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 450 NumberOfCodeBlocks, 450 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 267 ConstructedInterpolants, 0 QuantifiedInterpolants, 1850 SizeOfPredicates, 8 NumberOfNonLiveVariables, 234 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 933/936 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 00:06:34,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-70.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 13cde4b32ba56cbf3417fbd3d3edc8641f523883922a409d107d73798b0beac0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:06:37,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:06:37,321 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:06:37,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:06:37,332 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:06:37,366 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:06:37,366 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:06:37,367 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:06:37,367 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:06:37,368 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:06:37,368 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:06:37,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:06:37,370 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:06:37,373 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:06:37,373 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:06:37,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:06:37,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:06:37,374 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:06:37,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:06:37,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:06:37,375 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:06:37,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:06:37,377 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:06:37,377 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:06:37,378 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:06:37,378 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:06:37,379 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:06:37,379 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:06:37,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:06:37,380 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:06:37,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:06:37,381 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:06:37,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:06:37,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:06:37,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:06:37,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:06:37,383 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:06:37,383 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:06:37,383 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:06:37,384 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:06:37,384 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:06:37,384 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:06:37,384 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:06:37,385 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:06:37,385 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 13cde4b32ba56cbf3417fbd3d3edc8641f523883922a409d107d73798b0beac0 [2024-11-09 00:06:37,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:06:37,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:06:37,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:06:37,764 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:06:37,764 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:06:37,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-70.i [2024-11-09 00:06:39,418 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:06:39,664 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:06:39,665 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-70.i [2024-11-09 00:06:39,680 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/803752898/d8f15e42769b45e5adec00aba75c7357/FLAG412564431 [2024-11-09 00:06:40,011 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/803752898/d8f15e42769b45e5adec00aba75c7357 [2024-11-09 00:06:40,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:06:40,015 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:06:40,016 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:06:40,016 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:06:40,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:06:40,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:06:40" (1/1) ... [2024-11-09 00:06:40,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16eac351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:40, skipping insertion in model container [2024-11-09 00:06:40,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:06:40" (1/1) ... [2024-11-09 00:06:40,058 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:06:40,259 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-70.i[915,928] [2024-11-09 00:06:40,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:06:40,361 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:06:40,374 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-70.i[915,928] [2024-11-09 00:06:40,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:06:40,443 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:06:40,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:40 WrapperNode [2024-11-09 00:06:40,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:06:40,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:06:40,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:06:40,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:06:40,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:40" (1/1) ... [2024-11-09 00:06:40,471 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:40" (1/1) ... [2024-11-09 00:06:40,505 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-11-09 00:06:40,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:06:40,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:06:40,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:06:40,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:06:40,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:40" (1/1) ... [2024-11-09 00:06:40,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:40" (1/1) ... [2024-11-09 00:06:40,528 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:40" (1/1) ... [2024-11-09 00:06:40,546 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:06:40,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:40" (1/1) ... [2024-11-09 00:06:40,550 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:40" (1/1) ... [2024-11-09 00:06:40,564 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:40" (1/1) ... [2024-11-09 00:06:40,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:40" (1/1) ... [2024-11-09 00:06:40,574 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:40" (1/1) ... [2024-11-09 00:06:40,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:40" (1/1) ... [2024-11-09 00:06:40,583 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:06:40,588 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:06:40,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:06:40,588 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:06:40,589 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:40" (1/1) ... [2024-11-09 00:06:40,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:06:40,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:06:40,623 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:06:40,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:06:40,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:06:40,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:06:40,700 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:06:40,700 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:06:40,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:06:40,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:06:40,794 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:06:40,796 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:06:47,670 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-09 00:06:47,670 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:06:47,687 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:06:47,687 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:06:47,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:06:47 BoogieIcfgContainer [2024-11-09 00:06:47,687 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:06:47,691 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:06:47,691 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:06:47,694 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:06:47,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:06:40" (1/3) ... [2024-11-09 00:06:47,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd5b407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:06:47, skipping insertion in model container [2024-11-09 00:06:47,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:06:40" (2/3) ... [2024-11-09 00:06:47,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd5b407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:06:47, skipping insertion in model container [2024-11-09 00:06:47,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:06:47" (3/3) ... [2024-11-09 00:06:47,697 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-70.i [2024-11-09 00:06:47,712 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:06:47,712 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:06:47,775 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:06:47,782 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@13132fac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:06:47,782 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:06:47,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 00:06:47,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 00:06:47,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:06:47,799 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:06:47,799 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:06:47,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:06:47,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1279566213, now seen corresponding path program 1 times [2024-11-09 00:06:47,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:06:47,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354067279] [2024-11-09 00:06:47,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:06:47,824 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:06:47,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:06:47,829 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:06:47,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 00:06:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:48,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:06:48,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:06:48,277 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-09 00:06:48,277 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:06:48,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:06:48,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354067279] [2024-11-09 00:06:48,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354067279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:06:48,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:06:48,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:06:48,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737375598] [2024-11-09 00:06:48,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:06:48,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:06:48,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:06:48,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:06:48,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:06:48,315 INFO L87 Difference]: Start difference. First operand has 51 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 00:06:48,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:06:48,339 INFO L93 Difference]: Finished difference Result 99 states and 158 transitions. [2024-11-09 00:06:48,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:06:48,341 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 90 [2024-11-09 00:06:48,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:06:48,347 INFO L225 Difference]: With dead ends: 99 [2024-11-09 00:06:48,347 INFO L226 Difference]: Without dead ends: 47 [2024-11-09 00:06:48,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:06:48,353 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:06:48,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:06:48,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-09 00:06:48,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-09 00:06:48,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 00:06:48,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions. [2024-11-09 00:06:48,390 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 90 [2024-11-09 00:06:48,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:06:48,390 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions. [2024-11-09 00:06:48,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 00:06:48,391 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2024-11-09 00:06:48,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 00:06:48,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:06:48,394 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:06:48,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 00:06:48,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:06:48,596 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:06:48,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:06:48,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1106177293, now seen corresponding path program 1 times [2024-11-09 00:06:48,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:06:48,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1619985054] [2024-11-09 00:06:48,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:06:48,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:06:48,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:06:48,600 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:06:48,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 00:06:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:48,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 00:06:48,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:06:51,364 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 78 proven. 3 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-09 00:06:51,364 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:06:52,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:06:52,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1619985054] [2024-11-09 00:06:52,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1619985054] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:06:52,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [207768315] [2024-11-09 00:06:52,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:06:52,064 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 00:06:52,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 00:06:52,068 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 00:06:52,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-09 00:06:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:52,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 00:06:52,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:06:54,923 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 78 proven. 3 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-09 00:06:54,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:06:55,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [207768315] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:06:55,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 00:06:55,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-09 00:06:55,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954744709] [2024-11-09 00:06:55,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 00:06:55,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 00:06:55,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:06:55,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 00:06:55,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-09 00:06:55,135 INFO L87 Difference]: Start difference. First operand 47 states and 66 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 00:06:58,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:07:00,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:07:02,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:07:02,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:07:02,995 INFO L93 Difference]: Finished difference Result 186 states and 261 transitions. [2024-11-09 00:07:02,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 00:07:02,997 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 90 [2024-11-09 00:07:02,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:07:03,000 INFO L225 Difference]: With dead ends: 186 [2024-11-09 00:07:03,000 INFO L226 Difference]: Without dead ends: 142 [2024-11-09 00:07:03,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2024-11-09 00:07:03,005 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 184 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:07:03,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 280 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-09 00:07:03,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-09 00:07:03,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 92. [2024-11-09 00:07:03,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 62 states have internal predecessors, (78), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 00:07:03,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 130 transitions. [2024-11-09 00:07:03,030 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 130 transitions. Word has length 90 [2024-11-09 00:07:03,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:07:03,031 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 130 transitions. [2024-11-09 00:07:03,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 00:07:03,031 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2024-11-09 00:07:03,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 00:07:03,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:07:03,033 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:07:03,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-09 00:07:03,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 00:07:03,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:07:03,434 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:07:03,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:07:03,435 INFO L85 PathProgramCache]: Analyzing trace with hash 296830667, now seen corresponding path program 1 times [2024-11-09 00:07:03,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:07:03,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785797816] [2024-11-09 00:07:03,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:07:03,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:07:03,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:07:03,442 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:07:03,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 00:07:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:03,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 00:07:03,728 INFO L278 TraceCheckSpWp]: Computing forward predicates...