./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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_25-1loop_file-63.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 d6ad1444b30f33b27530b4799d39001f8d6831760aaefdc97e8e3af94a8d9490 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:11:24,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:11:24,159 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:11:24,164 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:11:24,164 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:11:24,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:11:24,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:11:24,186 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:11:24,186 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:11:24,186 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:11:24,187 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:11:24,187 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:11:24,187 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:11:24,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:11:24,188 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:11:24,188 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:11:24,188 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:11:24,188 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:11:24,188 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:11:24,188 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:11:24,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:11:24,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:11:24,188 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:11:24,188 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:11:24,188 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:11:24,188 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:11:24,188 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:11:24,188 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:11:24,188 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:11:24,188 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:11:24,188 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:11:24,188 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:11:24,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:11:24,188 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:11:24,189 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:11:24,189 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:11:24,189 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:11:24,189 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:11:24,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:11:24,189 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:11:24,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:11:24,189 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:11:24,189 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:11:24,189 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> d6ad1444b30f33b27530b4799d39001f8d6831760aaefdc97e8e3af94a8d9490 [2025-03-03 23:11:24,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:11:24,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:11:24,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:11:24,431 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:11:24,431 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:11:24,432 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-63.i [2025-03-03 23:11:25,547 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39bc79315/37e1de1caaec4504b9a34dff3ab7a5df/FLAG903d3be7b [2025-03-03 23:11:25,782 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:11:25,783 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-63.i [2025-03-03 23:11:25,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39bc79315/37e1de1caaec4504b9a34dff3ab7a5df/FLAG903d3be7b [2025-03-03 23:11:26,106 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39bc79315/37e1de1caaec4504b9a34dff3ab7a5df [2025-03-03 23:11:26,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:11:26,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:11:26,110 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:11:26,110 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:11:26,113 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:11:26,114 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:11:26" (1/1) ... [2025-03-03 23:11:26,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@494ec790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:26, skipping insertion in model container [2025-03-03 23:11:26,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:11:26" (1/1) ... [2025-03-03 23:11:26,125 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:11:26,201 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_25-1loop_file-63.i[915,928] [2025-03-03 23:11:26,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:11:26,235 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:11:26,241 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_25-1loop_file-63.i[915,928] [2025-03-03 23:11:26,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:11:26,271 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:11:26,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:26 WrapperNode [2025-03-03 23:11:26,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:11:26,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:11:26,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:11:26,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:11:26,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:26" (1/1) ... [2025-03-03 23:11:26,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:26" (1/1) ... [2025-03-03 23:11:26,310 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2025-03-03 23:11:26,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:11:26,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:11:26,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:11:26,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:11:26,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:26" (1/1) ... [2025-03-03 23:11:26,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:26" (1/1) ... [2025-03-03 23:11:26,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:26" (1/1) ... [2025-03-03 23:11:26,335 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]. [2025-03-03 23:11:26,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:26" (1/1) ... [2025-03-03 23:11:26,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:26" (1/1) ... [2025-03-03 23:11:26,341 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:26" (1/1) ... [2025-03-03 23:11:26,342 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:26" (1/1) ... [2025-03-03 23:11:26,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:26" (1/1) ... [2025-03-03 23:11:26,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:26" (1/1) ... [2025-03-03 23:11:26,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:11:26,348 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:11:26,352 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:11:26,352 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:11:26,353 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:26" (1/1) ... [2025-03-03 23:11:26,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:11:26,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:11:26,378 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) [2025-03-03 23:11:26,381 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 [2025-03-03 23:11:26,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:11:26,398 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:11:26,398 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:11:26,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:11:26,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:11:26,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:11:26,452 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:11:26,453 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:11:26,655 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-03 23:11:26,655 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:11:26,663 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:11:26,664 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:11:26,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:11:26 BoogieIcfgContainer [2025-03-03 23:11:26,664 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:11:26,666 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:11:26,666 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:11:26,668 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:11:26,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:11:26" (1/3) ... [2025-03-03 23:11:26,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47cd2736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:11:26, skipping insertion in model container [2025-03-03 23:11:26,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:26" (2/3) ... [2025-03-03 23:11:26,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47cd2736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:11:26, skipping insertion in model container [2025-03-03 23:11:26,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:11:26" (3/3) ... [2025-03-03 23:11:26,671 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-63.i [2025-03-03 23:11:26,680 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:11:26,683 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-63.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:11:26,721 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:11:26,728 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;@760706ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:11:26,730 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:11:26,734 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 23:11:26,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 23:11:26,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:11:26,743 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:11:26,743 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:11:26,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:11:26,748 INFO L85 PathProgramCache]: Analyzing trace with hash 869233060, now seen corresponding path program 1 times [2025-03-03 23:11:26,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:11:26,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902897307] [2025-03-03 23:11:26,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:11:26,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:11:26,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 23:11:26,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 23:11:26,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:11:26,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:11:26,986 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 23:11:26,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:11:26,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902897307] [2025-03-03 23:11:26,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902897307] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:11:26,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96419004] [2025-03-03 23:11:26,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:11:26,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:11:26,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:11:26,992 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) [2025-03-03 23:11:26,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 23:11:27,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 23:11:27,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 23:11:27,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:11:27,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:11:27,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:11:27,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:11:27,155 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 23:11:27,156 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:11:27,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96419004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:11:27,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:11:27,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:11:27,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885735553] [2025-03-03 23:11:27,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:11:27,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:11:27,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:11:27,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:11:27,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:11:27,177 INFO L87 Difference]: Start difference. First operand has 54 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 23:11:27,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:11:27,194 INFO L93 Difference]: Finished difference Result 105 states and 177 transitions. [2025-03-03 23:11:27,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:11:27,196 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 123 [2025-03-03 23:11:27,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:11:27,200 INFO L225 Difference]: With dead ends: 105 [2025-03-03 23:11:27,200 INFO L226 Difference]: Without dead ends: 51 [2025-03-03 23:11:27,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:11:27,206 INFO L435 NwaCegarLoop]: 78 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, 78 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 [2025-03-03 23:11:27,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:11:27,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-03 23:11:27,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-03 23:11:27,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 23:11:27,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2025-03-03 23:11:27,246 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 123 [2025-03-03 23:11:27,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:11:27,246 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2025-03-03 23:11:27,246 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 23:11:27,246 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2025-03-03 23:11:27,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 23:11:27,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:11:27,249 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:11:27,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 23:11:27,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 23:11:27,450 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:11:27,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:11:27,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1269192002, now seen corresponding path program 1 times [2025-03-03 23:11:27,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:11:27,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408390720] [2025-03-03 23:11:27,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:11:27,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:11:27,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 23:11:27,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 23:11:27,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:11:27,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:11:27,530 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:11:27,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 23:11:27,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 23:11:27,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:11:27,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:11:27,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:11:27,639 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:11:27,640 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:11:27,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:11:27,644 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-03 23:11:27,696 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:11:27,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:11:27 BoogieIcfgContainer [2025-03-03 23:11:27,698 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:11:27,699 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:11:27,700 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:11:27,700 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:11:27,700 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:11:26" (3/4) ... [2025-03-03 23:11:27,702 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:11:27,703 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:11:27,704 INFO L158 Benchmark]: Toolchain (without parser) took 1593.93ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 86.1MB in the end (delta: 27.4MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2025-03-03 23:11:27,705 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:11:27,705 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.70ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 100.8MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:11:27,707 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.77ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 98.8MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:11:27,707 INFO L158 Benchmark]: Boogie Preprocessor took 37.57ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 97.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:11:27,707 INFO L158 Benchmark]: IcfgBuilder took 315.85ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 80.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:11:27,708 INFO L158 Benchmark]: TraceAbstraction took 1032.66ms. Allocated memory is still 142.6MB. Free memory was 80.2MB in the beginning and 86.9MB in the end (delta: -6.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:11:27,708 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 86.1MB in the end (delta: 771.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:11:27,709 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.21ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 161.70ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 100.8MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.77ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 98.8MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.57ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 97.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 315.85ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 80.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1032.66ms. Allocated memory is still 142.6MB. Free memory was 80.2MB in the beginning and 86.9MB in the end (delta: -6.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 86.1MB in the end (delta: 771.9kB). Peak memory consumption was 8.4MB. 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 someBinaryFLOATComparisonOperation at line 56, overapproximation of someBinaryFLOATComparisonOperation at line 62, overapproximation of someBinaryFLOATComparisonOperation at line 64, overapproximation of someBinaryFLOATComparisonOperation at line 40, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 45. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] float var_1_2 = 8.3; [L24] float var_1_3 = 2.25; [L25] float var_1_4 = 10.3; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] signed long int var_1_7 = 128; [L29] float var_1_8 = 9.8; [L30] signed long int var_1_9 = -256; [L31] unsigned short int var_1_10 = 5; [L32] signed char var_1_11 = 8; [L33] signed long int var_1_12 = 2; [L34] unsigned short int var_1_13 = 32; [L35] unsigned short int var_1_14 = 1; [L36] unsigned short int last_1_var_1_10 = 5; VAL [isInitial=0, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_2=83/10, var_1_3=9/4, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L101] isInitial = 1 [L102] FCALL initially() [L103] int k_loop; [L104] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_2=83/10, var_1_3=9/4, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L104] COND TRUE k_loop < 1 [L105] CALL updateLastVariables() [L94] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_2=83/10, var_1_3=9/4, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_float() [L62] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_3=9/4, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_3=9/4, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L62] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_3=9/4, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L63] var_1_3 = __VERIFIER_nondet_float() [L64] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L64] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L65] var_1_4 = __VERIFIER_nondet_float() [L66] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L66] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L67] var_1_5 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L68] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L69] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L69] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L70] var_1_6 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L71] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L72] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L72] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L73] var_1_8 = __VERIFIER_nondet_float() [L74] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-256] [L74] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-256] [L75] var_1_9 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_9 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L76] RET assume_abort_if_not(var_1_9 >= -2147483647) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L77] CALL assume_abort_if_not(var_1_9 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L77] RET assume_abort_if_not(var_1_9 <= 2147483646) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L78] var_1_11 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_11 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L79] RET assume_abort_if_not(var_1_11 >= -128) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L80] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L80] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L81] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L81] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L82] var_1_12 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_12 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L83] RET assume_abort_if_not(var_1_12 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L84] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L84] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L85] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L85] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L86] var_1_13 = __VERIFIER_nondet_ushort() [L87] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L87] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L88] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L88] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L89] var_1_14 = __VERIFIER_nondet_ushort() [L90] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L90] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L91] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=65534, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=65534, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L91] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=65534, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L106] RET updateVariables() [L107] CALL step() [L40] COND TRUE var_1_4 <= (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) * var_1_8) [L41] var_1_7 = ((((-200) > (last_1_var_1_10)) ? (-200) : (last_1_var_1_10))) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=65534, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=5, var_1_9=-2147483647] [L45] COND FALSE !(var_1_8 > var_1_4) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=65534, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=5, var_1_9=-2147483647] [L56] COND TRUE ((((1.1f) < (var_1_2)) ? (1.1f) : (var_1_2))) > (var_1_3 * var_1_4) [L57] var_1_1 = (var_1_5 && var_1_6) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=65534, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=5, var_1_9=-2147483647] [L107] RET step() [L108] CALL, EXPR property() [L97-L98] return (((((((1.1f) < (var_1_2)) ? (1.1f) : (var_1_2))) > (var_1_3 * var_1_4)) ? (var_1_1 == ((unsigned char) (var_1_5 && var_1_6))) : 1) && ((var_1_4 <= (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) * var_1_8)) ? (var_1_7 == ((signed long int) ((((-200) > (last_1_var_1_10)) ? (-200) : (last_1_var_1_10))))) : (var_1_7 == ((signed long int) last_1_var_1_10)))) && ((var_1_8 > var_1_4) ? ((! var_1_6) ? (((var_1_9 / ((((var_1_11) > (-64)) ? (var_1_11) : (-64)))) < (var_1_7 / var_1_12)) ? (var_1_10 == ((unsigned short int) var_1_13)) : (var_1_10 == ((unsigned short int) var_1_13))) : (var_1_10 == ((unsigned short int) var_1_14))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=65534, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=5, var_1_9=-2147483647] [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=65534, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=5, var_1_9=-2147483647] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=65534, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=5, var_1_9=-2147483647] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 78 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 369 NumberOfCodeBlocks, 369 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 244 ConstructedInterpolants, 0 QuantifiedInterpolants, 244 SizeOfPredicates, 0 NumberOfNonLiveVariables, 275 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1482/1520 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 23:11:27,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/21.0.5-tem/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.6.800.v20240513-1750.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_25-1loop_file-63.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 d6ad1444b30f33b27530b4799d39001f8d6831760aaefdc97e8e3af94a8d9490 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:11:29,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:11:29,581 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:11:29,585 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:11:29,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:11:29,604 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:11:29,606 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:11:29,606 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:11:29,606 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:11:29,607 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:11:29,607 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:11:29,607 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:11:29,608 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:11:29,608 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:11:29,608 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:11:29,608 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:11:29,608 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:11:29,608 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:11:29,608 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:11:29,608 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:11:29,608 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:11:29,608 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:11:29,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:11:29,609 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:11:29,609 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:11:29,609 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:11:29,609 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:11:29,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:11:29,609 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:11:29,609 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:11:29,609 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:11:29,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:11:29,610 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:11:29,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:11:29,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:11:29,610 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:11:29,610 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:11:29,610 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:11:29,611 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:11:29,611 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:11:29,611 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:11:29,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:11:29,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:11:29,611 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:11:29,611 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:11:29,612 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> d6ad1444b30f33b27530b4799d39001f8d6831760aaefdc97e8e3af94a8d9490 [2025-03-03 23:11:29,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:11:29,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:11:29,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:11:29,846 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:11:29,846 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:11:29,847 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-63.i [2025-03-03 23:11:31,004 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/939971cbe/52c6135a88ed4d1ab40b43d87b9c49d0/FLAGc8cff6458 [2025-03-03 23:11:31,194 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:11:31,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-63.i [2025-03-03 23:11:31,202 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/939971cbe/52c6135a88ed4d1ab40b43d87b9c49d0/FLAGc8cff6458 [2025-03-03 23:11:31,557 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/939971cbe/52c6135a88ed4d1ab40b43d87b9c49d0 [2025-03-03 23:11:31,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:11:31,561 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:11:31,563 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:11:31,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:11:31,567 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:11:31,568 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:11:31" (1/1) ... [2025-03-03 23:11:31,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b76bdd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:31, skipping insertion in model container [2025-03-03 23:11:31,568 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:11:31" (1/1) ... [2025-03-03 23:11:31,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:11:31,679 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_25-1loop_file-63.i[915,928] [2025-03-03 23:11:31,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:11:31,716 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:11:31,724 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_25-1loop_file-63.i[915,928] [2025-03-03 23:11:31,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:11:31,759 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:11:31,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:31 WrapperNode [2025-03-03 23:11:31,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:11:31,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:11:31,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:11:31,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:11:31,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:31" (1/1) ... [2025-03-03 23:11:31,774 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:31" (1/1) ... [2025-03-03 23:11:31,799 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2025-03-03 23:11:31,800 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:11:31,801 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:11:31,801 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:11:31,801 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:11:31,807 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:31" (1/1) ... [2025-03-03 23:11:31,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:31" (1/1) ... [2025-03-03 23:11:31,809 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:31" (1/1) ... [2025-03-03 23:11:31,823 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]. [2025-03-03 23:11:31,824 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:31" (1/1) ... [2025-03-03 23:11:31,824 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:31" (1/1) ... [2025-03-03 23:11:31,835 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:31" (1/1) ... [2025-03-03 23:11:31,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:31" (1/1) ... [2025-03-03 23:11:31,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:31" (1/1) ... [2025-03-03 23:11:31,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:31" (1/1) ... [2025-03-03 23:11:31,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:11:31,845 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:11:31,848 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:11:31,848 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:11:31,849 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:31" (1/1) ... [2025-03-03 23:11:31,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:11:31,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:11:31,876 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) [2025-03-03 23:11:31,878 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 [2025-03-03 23:11:31,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:11:31,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:11:31,897 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:11:31,897 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:11:31,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:11:31,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:11:31,960 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:11:31,961 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:11:33,331 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-03 23:11:33,331 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:11:33,337 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:11:33,337 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:11:33,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:11:33 BoogieIcfgContainer [2025-03-03 23:11:33,338 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:11:33,339 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:11:33,339 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:11:33,342 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:11:33,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:11:31" (1/3) ... [2025-03-03 23:11:33,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e563399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:11:33, skipping insertion in model container [2025-03-03 23:11:33,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:31" (2/3) ... [2025-03-03 23:11:33,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e563399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:11:33, skipping insertion in model container [2025-03-03 23:11:33,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:11:33" (3/3) ... [2025-03-03 23:11:33,344 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-63.i [2025-03-03 23:11:33,353 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:11:33,354 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-63.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:11:33,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:11:33,394 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;@70d933a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:11:33,395 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:11:33,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 23:11:33,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 23:11:33,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:11:33,405 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:11:33,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:11:33,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:11:33,408 INFO L85 PathProgramCache]: Analyzing trace with hash 869233060, now seen corresponding path program 1 times [2025-03-03 23:11:33,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:11:33,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214704470] [2025-03-03 23:11:33,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:11:33,416 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 [2025-03-03 23:11:33,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:11:33,418 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) [2025-03-03 23:11:33,420 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 [2025-03-03 23:11:33,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 23:11:33,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 23:11:33,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:11:33,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:11:33,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:11:33,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:11:33,699 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 23:11:33,700 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:11:33,701 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:11:33,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214704470] [2025-03-03 23:11:33,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214704470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:11:33,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:11:33,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:11:33,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450546583] [2025-03-03 23:11:33,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:11:33,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:11:33,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:11:33,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:11:33,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:11:33,733 INFO L87 Difference]: Start difference. First operand has 54 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:11:33,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:11:33,747 INFO L93 Difference]: Finished difference Result 105 states and 177 transitions. [2025-03-03 23:11:33,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:11:33,749 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), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 123 [2025-03-03 23:11:33,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:11:33,752 INFO L225 Difference]: With dead ends: 105 [2025-03-03 23:11:33,753 INFO L226 Difference]: Without dead ends: 51 [2025-03-03 23:11:33,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:11:33,756 INFO L435 NwaCegarLoop]: 78 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, 78 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 [2025-03-03 23:11:33,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:11:33,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-03 23:11:33,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-03 23:11:33,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 23:11:33,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2025-03-03 23:11:33,785 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 123 [2025-03-03 23:11:33,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:11:33,786 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2025-03-03 23:11:33,786 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), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:11:33,786 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2025-03-03 23:11:33,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 23:11:33,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:11:33,788 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:11:33,798 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 [2025-03-03 23:11:33,988 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 [2025-03-03 23:11:33,989 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:11:33,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:11:33,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1269192002, now seen corresponding path program 1 times [2025-03-03 23:11:33,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:11:33,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450755857] [2025-03-03 23:11:33,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:11:33,991 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 [2025-03-03 23:11:33,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:11:33,992 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) [2025-03-03 23:11:33,993 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 [2025-03-03 23:11:34,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 23:11:34,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 23:11:34,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:11:34,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:11:34,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 23:11:34,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:11:45,606 WARN L286 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 23:12:01,313 WARN L286 SmtUtils]: Spent 6.79s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 23:12:24,993 WARN L286 SmtUtils]: Spent 9.13s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)