./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.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_100-1loop_file-48.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 c438e6c9197a881b4d4e2319837b570cca3414de745bf48aba5a7ed68a2e7de0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:46:53,602 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:46:53,658 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:46:53,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:46:53,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:46:53,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:46:53,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:46:53,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:46:53,700 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:46:53,700 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:46:53,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:46:53,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:46:53,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:46:53,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:46:53,702 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:46:53,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:46:53,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:46:53,702 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:46:53,702 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:46:53,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:46:53,702 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:46:53,702 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:46:53,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:46:53,703 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:46:53,703 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:46:53,703 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:46:53,703 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:46:53,703 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:46:53,703 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:46:53,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:46:53,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:46:53,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:46:53,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:46:53,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:46:53,704 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:46:53,704 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:46:53,705 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:46:53,705 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:46:53,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:46:53,705 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:46:53,705 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:46:53,705 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:46:53,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:46:53,706 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 -> c438e6c9197a881b4d4e2319837b570cca3414de745bf48aba5a7ed68a2e7de0 [2025-03-03 22:46:53,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:46:53,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:46:53,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:46:53,945 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:46:53,945 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:46:53,946 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i [2025-03-03 22:46:55,099 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5df4aedd6/d9a10e929f194cae865c6fb09d9d25ca/FLAG43ce4de0a [2025-03-03 22:46:55,350 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:46:55,351 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i [2025-03-03 22:46:55,359 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5df4aedd6/d9a10e929f194cae865c6fb09d9d25ca/FLAG43ce4de0a [2025-03-03 22:46:55,376 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5df4aedd6/d9a10e929f194cae865c6fb09d9d25ca [2025-03-03 22:46:55,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:46:55,382 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:46:55,383 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:46:55,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:46:55,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:46:55,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:46:55" (1/1) ... [2025-03-03 22:46:55,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e47fe4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:55, skipping insertion in model container [2025-03-03 22:46:55,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:46:55" (1/1) ... [2025-03-03 22:46:55,410 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:46:55,524 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_100-1loop_file-48.i[916,929] [2025-03-03 22:46:55,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:46:55,630 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:46:55,640 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_100-1loop_file-48.i[916,929] [2025-03-03 22:46:55,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:46:55,700 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:46:55,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:55 WrapperNode [2025-03-03 22:46:55,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:46:55,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:46:55,703 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:46:55,703 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:46:55,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:55" (1/1) ... [2025-03-03 22:46:55,725 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:55" (1/1) ... [2025-03-03 22:46:55,757 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2025-03-03 22:46:55,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:46:55,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:46:55,758 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:46:55,758 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:46:55,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:55" (1/1) ... [2025-03-03 22:46:55,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:55" (1/1) ... [2025-03-03 22:46:55,772 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:55" (1/1) ... [2025-03-03 22:46:55,797 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 22:46:55,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:55" (1/1) ... [2025-03-03 22:46:55,801 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:55" (1/1) ... [2025-03-03 22:46:55,813 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:55" (1/1) ... [2025-03-03 22:46:55,819 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:55" (1/1) ... [2025-03-03 22:46:55,821 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:55" (1/1) ... [2025-03-03 22:46:55,825 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:55" (1/1) ... [2025-03-03 22:46:55,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:46:55,836 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:46:55,837 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:46:55,837 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:46:55,838 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:55" (1/1) ... [2025-03-03 22:46:55,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:46:55,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:46:55,866 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 22:46:55,870 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 22:46:55,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:46:55,886 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:46:55,886 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:46:55,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:46:55,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:46:55,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:46:55,950 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:46:55,952 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:46:56,368 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-03 22:46:56,368 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:46:56,381 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:46:56,381 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:46:56,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:46:56 BoogieIcfgContainer [2025-03-03 22:46:56,382 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:46:56,384 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:46:56,384 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:46:56,387 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:46:56,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:46:55" (1/3) ... [2025-03-03 22:46:56,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a9d190a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:46:56, skipping insertion in model container [2025-03-03 22:46:56,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:55" (2/3) ... [2025-03-03 22:46:56,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a9d190a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:46:56, skipping insertion in model container [2025-03-03 22:46:56,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:46:56" (3/3) ... [2025-03-03 22:46:56,389 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-48.i [2025-03-03 22:46:56,399 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:46:56,402 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-48.i that has 2 procedures, 82 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:46:56,451 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:46:56,463 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;@1a4196b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:46:56,463 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:46:56,467 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 22:46:56,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 22:46:56,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:46:56,477 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:46:56,477 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:46:56,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:46:56,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1333157944, now seen corresponding path program 1 times [2025-03-03 22:46:56,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:46:56,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457731770] [2025-03-03 22:46:56,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:46:56,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:46:56,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 22:46:56,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 22:46:56,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:46:56,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:46:56,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-03 22:46:56,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:46:56,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457731770] [2025-03-03 22:46:56,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457731770] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:46:56,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836096146] [2025-03-03 22:46:56,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:46:56,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:46:56,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:46:56,794 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 22:46:56,795 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 22:46:56,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 22:46:56,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 22:46:56,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:46:56,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:46:56,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:46:56,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:46:56,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-03 22:46:56,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:46:56,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836096146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:46:56,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:46:56,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:46:56,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463063891] [2025-03-03 22:46:56,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:46:56,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:46:56,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:46:57,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:46:57,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:46:57,013 INFO L87 Difference]: Start difference. First operand has 82 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:46:57,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:46:57,034 INFO L93 Difference]: Finished difference Result 161 states and 274 transitions. [2025-03-03 22:46:57,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:46:57,035 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 165 [2025-03-03 22:46:57,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:46:57,039 INFO L225 Difference]: With dead ends: 161 [2025-03-03 22:46:57,039 INFO L226 Difference]: Without dead ends: 79 [2025-03-03 22:46:57,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 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 22:46:57,043 INFO L435 NwaCegarLoop]: 124 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, 124 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 22:46:57,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:46:57,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-03 22:46:57,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-03 22:46:57,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 22:46:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 121 transitions. [2025-03-03 22:46:57,071 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 121 transitions. Word has length 165 [2025-03-03 22:46:57,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:46:57,071 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 121 transitions. [2025-03-03 22:46:57,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:46:57,072 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 121 transitions. [2025-03-03 22:46:57,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 22:46:57,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:46:57,074 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:46:57,080 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 22:46:57,276 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 22:46:57,276 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:46:57,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:46:57,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1727025283, now seen corresponding path program 1 times [2025-03-03 22:46:57,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:46:57,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573403780] [2025-03-03 22:46:57,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:46:57,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:46:57,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 22:46:57,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 22:46:57,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:46:57,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:46:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 22:46:57,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:46:57,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573403780] [2025-03-03 22:46:57,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573403780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:46:57,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:46:57,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:46:57,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686705566] [2025-03-03 22:46:57,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:46:57,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:46:57,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:46:57,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:46:57,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:46:57,723 INFO L87 Difference]: Start difference. First operand 79 states and 121 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:46:57,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:46:57,942 INFO L93 Difference]: Finished difference Result 232 states and 358 transitions. [2025-03-03 22:46:57,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:46:57,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2025-03-03 22:46:57,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:46:57,946 INFO L225 Difference]: With dead ends: 232 [2025-03-03 22:46:57,948 INFO L226 Difference]: Without dead ends: 156 [2025-03-03 22:46:57,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:46:57,950 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 90 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:46:57,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 455 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:46:57,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-03 22:46:57,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 125. [2025-03-03 22:46:57,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 72 states have internal predecessors, (91), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 22:46:57,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 191 transitions. [2025-03-03 22:46:57,980 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 191 transitions. Word has length 165 [2025-03-03 22:46:57,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:46:57,980 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 191 transitions. [2025-03-03 22:46:57,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:46:57,980 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 191 transitions. [2025-03-03 22:46:57,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 22:46:57,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:46:57,985 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:46:57,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:46:57,985 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:46:57,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:46:57,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1947426291, now seen corresponding path program 1 times [2025-03-03 22:46:57,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:46:57,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978313902] [2025-03-03 22:46:57,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:46:57,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:46:58,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 22:46:58,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 22:46:58,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:46:58,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:46:58,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 24 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 22:46:58,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:46:58,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978313902] [2025-03-03 22:46:58,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978313902] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:46:58,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641757379] [2025-03-03 22:46:58,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:46:58,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:46:58,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:46:58,471 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:46:58,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 22:46:58,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 22:46:58,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 22:46:58,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:46:58,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:46:58,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 22:46:58,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:46:58,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 568 proven. 24 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2025-03-03 22:46:58,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:46:58,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 24 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 22:46:58,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641757379] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:46:58,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:46:58,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 22:46:58,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141880212] [2025-03-03 22:46:58,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:46:58,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:46:58,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:46:58,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:46:58,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:46:58,946 INFO L87 Difference]: Start difference. First operand 125 states and 191 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-03 22:46:59,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:46:59,146 INFO L93 Difference]: Finished difference Result 217 states and 323 transitions. [2025-03-03 22:46:59,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:46:59,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 166 [2025-03-03 22:46:59,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:46:59,149 INFO L225 Difference]: With dead ends: 217 [2025-03-03 22:46:59,149 INFO L226 Difference]: Without dead ends: 141 [2025-03-03 22:46:59,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 329 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:46:59,150 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 74 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:46:59,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 218 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:46:59,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-03 22:46:59,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 133. [2025-03-03 22:46:59,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 78 states have internal predecessors, (96), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 22:46:59,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 196 transitions. [2025-03-03 22:46:59,180 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 196 transitions. Word has length 166 [2025-03-03 22:46:59,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:46:59,181 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 196 transitions. [2025-03-03 22:46:59,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-03 22:46:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 196 transitions. [2025-03-03 22:46:59,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 22:46:59,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:46:59,185 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:46:59,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 22:46:59,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-03 22:46:59,386 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:46:59,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:46:59,387 INFO L85 PathProgramCache]: Analyzing trace with hash 692879196, now seen corresponding path program 1 times [2025-03-03 22:46:59,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:46:59,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472813980] [2025-03-03 22:46:59,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:46:59,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:46:59,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 22:46:59,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 22:46:59,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:46:59,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:46:59,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1790034683] [2025-03-03 22:46:59,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:46:59,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:46:59,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:46:59,591 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:46:59,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 22:46:59,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 22:46:59,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 22:46:59,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:46:59,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:46:59,867 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:46:59,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 22:47:00,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 22:47:00,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:47:00,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:47:00,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:47:00,110 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:47:00,110 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:47:00,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 22:47:00,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:47:00,315 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-03 22:47:00,405 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:47:00,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:47:00 BoogieIcfgContainer [2025-03-03 22:47:00,408 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:47:00,409 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:47:00,409 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:47:00,409 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:47:00,410 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:46:56" (3/4) ... [2025-03-03 22:47:00,411 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:47:00,412 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:47:00,413 INFO L158 Benchmark]: Toolchain (without parser) took 5033.16ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 106.6MB in the beginning and 122.2MB in the end (delta: -15.5MB). Peak memory consumption was 156.1MB. Max. memory is 16.1GB. [2025-03-03 22:47:00,413 INFO L158 Benchmark]: CDTParser took 0.75ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:47:00,413 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.97ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 89.7MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:47:00,413 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.10ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 84.4MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:47:00,414 INFO L158 Benchmark]: Boogie Preprocessor took 76.74ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 73.7MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:47:00,414 INFO L158 Benchmark]: IcfgBuilder took 545.99ms. Allocated memory is still 142.6MB. Free memory was 73.7MB in the beginning and 43.6MB in the end (delta: 30.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 22:47:00,414 INFO L158 Benchmark]: TraceAbstraction took 4024.80ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 42.4MB in the beginning and 123.4MB in the end (delta: -80.9MB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. [2025-03-03 22:47:00,414 INFO L158 Benchmark]: Witness Printer took 3.17ms. Allocated memory is still 310.4MB. Free memory was 122.2MB in the beginning and 122.2MB in the end (delta: 37.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:47:00,415 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.75ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.97ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 89.7MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.10ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 84.4MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.74ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 73.7MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 545.99ms. Allocated memory is still 142.6MB. Free memory was 73.7MB in the beginning and 43.6MB in the end (delta: 30.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4024.80ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 42.4MB in the beginning and 123.4MB in the end (delta: -80.9MB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. * Witness Printer took 3.17ms. Allocated memory is still 310.4MB. Free memory was 122.2MB in the beginning and 122.2MB in the end (delta: 37.0kB). 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 172, overapproximation of someBinaryFLOATComparisonOperation at line 144, overapproximation of someBinaryFLOATComparisonOperation at line 146, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 187, overapproximation of someBinaryFLOATComparisonOperation at line 148, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 187, overapproximation of someBinaryArithmeticFLOAToperation at line 114, overapproximation of someBinaryArithmeticFLOAToperation at line 107, overapproximation of someBinaryArithmeticFLOAToperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -5; [L23] unsigned char var_1_3 = 0; [L24] float var_1_8 = 128.5; [L25] float var_1_9 = 127.75; [L26] float var_1_10 = 31.8; [L27] float var_1_11 = 32.5; [L28] unsigned char var_1_12 = 8; [L29] unsigned char var_1_13 = 100; [L30] unsigned char var_1_14 = 25; [L31] unsigned char var_1_15 = 32; [L32] unsigned char var_1_16 = 16; [L33] double var_1_17 = 64.8; [L34] unsigned char var_1_18 = 1; [L35] unsigned char var_1_19 = 0; [L36] unsigned char var_1_20 = 0; [L37] signed char var_1_21 = -100; [L38] signed long int var_1_22 = -1; [L39] float var_1_23 = 5.6; [L40] float var_1_24 = 50.88; [L41] signed short int var_1_25 = -5; [L42] unsigned char var_1_26 = 1; [L43] unsigned char var_1_27 = 128; [L44] unsigned char var_1_28 = 5; [L45] signed short int var_1_29 = -64; [L46] unsigned long int var_1_32 = 16; [L47] unsigned char last_1_var_1_12 = 8; [L48] unsigned char last_1_var_1_18 = 1; [L49] signed short int last_1_var_1_25 = -5; [L50] unsigned char last_1_var_1_26 = 1; VAL [isInitial=0, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=0, var_1_8=257/2, var_1_9=511/4] [L191] isInitial = 1 [L192] FCALL initially() [L193] int k_loop; [L194] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=0, var_1_8=257/2, var_1_9=511/4] [L194] COND TRUE k_loop < 1 [L195] CALL updateLastVariables() [L181] last_1_var_1_12 = var_1_12 [L182] last_1_var_1_18 = var_1_18 [L183] last_1_var_1_25 = var_1_25 [L184] last_1_var_1_26 = var_1_26 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=0, var_1_8=257/2, var_1_9=511/4] [L195] RET updateLastVariables() [L196] CALL updateVariables() [L140] var_1_3 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_8=257/2, var_1_9=511/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_8=257/2, var_1_9=511/4] [L141] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_8=257/2, var_1_9=511/4] [L142] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2, var_1_9=511/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2, var_1_9=511/4] [L142] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2, var_1_9=511/4] [L143] var_1_9 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L144] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L145] var_1_10 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L146] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L147] var_1_11 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L148] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L149] var_1_13 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_13 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L150] RET assume_abort_if_not(var_1_13 >= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L151] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L151] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L152] var_1_14 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L153] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L154] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L154] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L155] var_1_15 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_15 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L156] RET assume_abort_if_not(var_1_15 >= 31) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L157] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L157] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L158] var_1_16 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L159] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L160] CALL assume_abort_if_not(var_1_16 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L160] RET assume_abort_if_not(var_1_16 <= 31) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L161] var_1_19 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L162] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L163] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L163] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L164] var_1_20 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L165] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L166] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L166] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L167] var_1_22 = __VERIFIER_nondet_long() [L168] CALL assume_abort_if_not(var_1_22 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L168] RET assume_abort_if_not(var_1_22 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L169] CALL assume_abort_if_not(var_1_22 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L169] RET assume_abort_if_not(var_1_22 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L170] CALL assume_abort_if_not(var_1_22 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L170] RET assume_abort_if_not(var_1_22 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L171] var_1_24 = __VERIFIER_nondet_float() [L172] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L172] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L173] var_1_27 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_27 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L174] RET assume_abort_if_not(var_1_27 >= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L175] CALL assume_abort_if_not(var_1_27 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L175] RET assume_abort_if_not(var_1_27 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L176] var_1_28 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L177] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L178] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=-678, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=-678, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L178] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=-678, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L196] RET updateVariables() [L197] CALL step() [L54] unsigned char stepLocal_1 = last_1_var_1_18; [L55] signed long int stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_0=8, stepLocal_1=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=-678, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L56] COND TRUE last_1_var_1_18 || stepLocal_1 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_0=8, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=-678, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L57] COND TRUE stepLocal_0 >= last_1_var_1_26 [L58] var_1_1 = (last_1_var_1_12 + last_1_var_1_12) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=-678, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L65] unsigned long int stepLocal_8 = 10u / var_1_13; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_8=0, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=-678, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L66] COND TRUE ! var_1_20 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_8=0, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=-678, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L67] COND TRUE stepLocal_8 < (var_1_22 + var_1_1) [L68] var_1_26 = ((((var_1_13) < ((var_1_27 - var_1_28))) ? (var_1_13) : ((var_1_27 - var_1_28)))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=37, var_1_27=127, var_1_28=-678, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L73] signed long int stepLocal_4 = ((((var_1_16) < (var_1_13)) ? (var_1_16) : (var_1_13))) / var_1_22; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_4=-2, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=-100, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=37, var_1_27=127, var_1_28=-678, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L74] COND TRUE ((25 + var_1_26) / var_1_15) > stepLocal_4 [L75] var_1_21 = ((((var_1_16) < (var_1_14)) ? (var_1_16) : (var_1_14))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=37, var_1_27=127, var_1_28=-678, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L79] signed short int stepLocal_3 = var_1_1; [L80] signed char stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_2=16, stepLocal_3=16, var_1_12=8, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=37, var_1_27=127, var_1_28=-678, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L81] COND TRUE var_1_1 >= stepLocal_2 [L82] var_1_12 = ((var_1_13 - var_1_14) + (100 - (var_1_15 - var_1_16))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_3=16, var_1_12=147, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=37, var_1_27=127, var_1_28=-678, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L90] var_1_8 = ((var_1_9 - var_1_10) + var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_3=16, var_1_12=147, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=37, var_1_27=127, var_1_28=-678, var_1_29=-64, var_1_32=16, var_1_3=1] [L91] COND TRUE \read(var_1_3) [L92] var_1_18 = (var_1_19 || ((var_1_10 > var_1_8) && var_1_20)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_3=16, var_1_12=147, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=37, var_1_27=127, var_1_28=-678, var_1_29=-64, var_1_32=16, var_1_3=1] [L96] unsigned char stepLocal_10 = var_1_26; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=37, stepLocal_3=16, var_1_12=147, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=37, var_1_27=127, var_1_28=-678, var_1_29=-64, var_1_32=16, var_1_3=1] [L97] COND FALSE !(var_1_8 <= (var_1_24 * ((((var_1_11) < (var_1_10)) ? (var_1_11) : (var_1_10))))) [L104] var_1_32 = var_1_27 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=37, stepLocal_3=16, var_1_12=147, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_17=324/5, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=37, var_1_27=127, var_1_28=-678, var_1_29=-64, var_1_32=127, var_1_3=1] [L106] COND TRUE (((((var_1_13) > (0)) ? (var_1_13) : (0))) - var_1_32) >= var_1_32 [L107] var_1_17 = (var_1_10 + var_1_9) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=37, stepLocal_3=16, var_1_12=147, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=-15, var_1_23=28/5, var_1_25=-5, var_1_26=37, var_1_27=127, var_1_28=-678, var_1_29=-64, var_1_32=127, var_1_3=1] [L113] COND TRUE var_1_32 <= (- var_1_21) [L114] var_1_23 = ((((((var_1_10) < (var_1_9)) ? (var_1_10) : (var_1_9))) - var_1_24) + var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=37, stepLocal_3=16, var_1_12=147, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=-15, var_1_25=-5, var_1_26=37, var_1_27=127, var_1_28=-678, var_1_29=-64, var_1_32=127, var_1_3=1] [L118] signed long int stepLocal_7 = -32; [L119] unsigned long int stepLocal_6 = var_1_32; [L120] unsigned char stepLocal_5 = 10 > 8; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=37, stepLocal_3=16, stepLocal_5=1, stepLocal_6=127, stepLocal_7=-32, var_1_12=147, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=-15, var_1_25=-5, var_1_26=37, var_1_27=127, var_1_28=-678, var_1_29=-64, var_1_32=127, var_1_3=1] [L121] COND FALSE !(stepLocal_7 > (~ last_1_var_1_25)) [L128] var_1_25 = var_1_14 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=37, stepLocal_3=16, stepLocal_5=1, stepLocal_6=127, var_1_12=147, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=-15, var_1_25=16, var_1_26=37, var_1_27=127, var_1_28=-678, var_1_29=-64, var_1_32=127, var_1_3=1] [L130] unsigned char stepLocal_9 = var_1_18; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=37, stepLocal_3=16, stepLocal_5=1, stepLocal_6=127, stepLocal_9=0, var_1_12=147, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=-15, var_1_25=16, var_1_26=37, var_1_27=127, var_1_28=-678, var_1_29=-64, var_1_32=127, var_1_3=1] [L131] COND FALSE !(stepLocal_9 && var_1_18) [L136] var_1_29 = 1000 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=37, stepLocal_3=16, stepLocal_5=1, stepLocal_6=127, var_1_12=147, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=-15, var_1_25=16, var_1_26=37, var_1_27=127, var_1_28=-678, var_1_29=1000, var_1_32=127, var_1_3=1] [L197] RET step() [L198] CALL, EXPR property() [L187-L188] return (((((((((((last_1_var_1_18 || last_1_var_1_18) ? ((last_1_var_1_12 >= last_1_var_1_26) ? (var_1_1 == ((signed short int) (last_1_var_1_12 + last_1_var_1_12))) : (var_1_1 == ((signed short int) last_1_var_1_12))) : (var_1_1 == ((signed short int) last_1_var_1_12))) && (var_1_8 == ((float) ((var_1_9 - var_1_10) + var_1_11)))) && ((var_1_1 >= var_1_21) ? (var_1_12 == ((unsigned char) ((var_1_13 - var_1_14) + (100 - (var_1_15 - var_1_16))))) : ((var_1_1 <= 100) ? (var_1_12 == ((unsigned char) ((((var_1_14) > (var_1_13)) ? (var_1_14) : (var_1_13))))) : (var_1_12 == ((unsigned char) var_1_13))))) && (((((((var_1_13) > (0)) ? (var_1_13) : (0))) - var_1_32) >= var_1_32) ? (var_1_17 == ((double) (var_1_10 + var_1_9))) : (var_1_18 ? (var_1_17 == ((double) var_1_9)) : 1))) && (var_1_3 ? (var_1_18 == ((unsigned char) (var_1_19 || ((var_1_10 > var_1_8) && var_1_20)))) : (var_1_18 == ((unsigned char) ((! (! var_1_19)) || var_1_20))))) && ((((25 + var_1_26) / var_1_15) > (((((var_1_16) < (var_1_13)) ? (var_1_16) : (var_1_13))) / var_1_22)) ? (var_1_21 == ((signed char) ((((var_1_16) < (var_1_14)) ? (var_1_16) : (var_1_14))))) : (var_1_21 == ((signed char) var_1_14)))) && ((var_1_32 <= (- var_1_21)) ? (var_1_23 == ((float) ((((((var_1_10) < (var_1_9)) ? (var_1_10) : (var_1_9))) - var_1_24) + var_1_11))) : (var_1_23 == ((float) ((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24))))))) && ((-32 > (~ last_1_var_1_25)) ? (((var_1_10 <= (- var_1_9)) || (10 > 8)) ? ((last_1_var_1_25 > var_1_32) ? (var_1_25 == ((signed short int) var_1_32)) : 1) : 1) : (var_1_25 == ((signed short int) var_1_14)))) && ((! var_1_20) ? (((10u / var_1_13) < (var_1_22 + var_1_1)) ? (var_1_26 == ((unsigned char) ((((var_1_13) < ((var_1_27 - var_1_28))) ? (var_1_13) : ((var_1_27 - var_1_28)))))) : (var_1_26 == ((unsigned char) (var_1_16 + var_1_15)))) : 1)) && ((var_1_18 && var_1_18) ? (((var_1_10 - (var_1_9 + var_1_24)) == var_1_23) ? (var_1_29 == ((signed short int) ((((var_1_14) < (((((1) < (var_1_21)) ? (1) : (var_1_21))))) ? (var_1_14) : (((((1) < (var_1_21)) ? (1) : (var_1_21)))))))) : 1) : (var_1_29 == ((signed short int) 1000)))) && ((var_1_8 <= (var_1_24 * ((((var_1_11) < (var_1_10)) ? (var_1_11) : (var_1_10))))) ? ((var_1_26 > (- (- var_1_26))) ? (var_1_32 == ((unsigned long int) var_1_26)) : (var_1_32 == ((unsigned long int) var_1_13))) : (var_1_32 == ((unsigned long int) var_1_27))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=147, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=-15, var_1_25=16, var_1_26=37, var_1_27=127, var_1_28=-678, var_1_29=1000, var_1_32=127, var_1_3=1] [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=147, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=-15, var_1_25=16, var_1_26=37, var_1_27=127, var_1_28=-678, var_1_29=1000, var_1_32=127, var_1_3=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=147, var_1_13=831, var_1_14=2320, var_1_15=-225, var_1_16=287, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=-15, var_1_25=16, var_1_26=37, var_1_27=127, var_1_28=-678, var_1_29=1000, var_1_32=127, var_1_3=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 4, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 179 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 164 mSDsluCounter, 797 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 467 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 167 IncrementalHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 330 mSDtfsCounter, 167 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 513 GetRequests, 498 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=3, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 39 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1161 NumberOfCodeBlocks, 1161 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 987 ConstructedInterpolants, 0 QuantifiedInterpolants, 1459 SizeOfPredicates, 1 NumberOfNonLiveVariables, 792 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 7080/7200 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 22:47:00,436 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_100-1loop_file-48.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 c438e6c9197a881b4d4e2319837b570cca3414de745bf48aba5a7ed68a2e7de0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:47:02,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:47:02,346 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:47:02,354 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:47:02,354 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:47:02,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:47:02,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:47:02,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:47:02,379 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:47:02,379 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:47:02,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:47:02,379 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:47:02,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:47:02,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:47:02,379 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:47:02,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:47:02,380 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:47:02,380 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:47:02,381 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:47:02,381 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:47:02,381 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:47:02,381 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:47:02,381 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:47:02,381 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:47:02,381 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:47:02,381 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:47:02,381 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:47:02,381 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:47:02,381 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:47:02,381 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:47:02,382 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:47:02,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:47:02,382 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:47:02,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:47:02,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:47:02,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:47:02,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:47:02,383 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:47:02,383 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:47:02,383 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:47:02,383 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:47:02,383 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:47:02,383 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:47:02,383 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:47:02,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:47:02,384 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 -> c438e6c9197a881b4d4e2319837b570cca3414de745bf48aba5a7ed68a2e7de0 [2025-03-03 22:47:02,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:47:02,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:47:02,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:47:02,631 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:47:02,631 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:47:02,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i [2025-03-03 22:47:03,801 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d41e22f5/d992597fc017492c8c4ea5a4efd4ce01/FLAGfbce2ca42 [2025-03-03 22:47:04,009 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:47:04,011 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i [2025-03-03 22:47:04,019 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d41e22f5/d992597fc017492c8c4ea5a4efd4ce01/FLAGfbce2ca42 [2025-03-03 22:47:04,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d41e22f5/d992597fc017492c8c4ea5a4efd4ce01 [2025-03-03 22:47:04,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:47:04,037 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:47:04,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:47:04,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:47:04,042 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:47:04,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:47:04" (1/1) ... [2025-03-03 22:47:04,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fe47377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:04, skipping insertion in model container [2025-03-03 22:47:04,044 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:47:04" (1/1) ... [2025-03-03 22:47:04,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:47:04,174 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_100-1loop_file-48.i[916,929] [2025-03-03 22:47:04,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:47:04,270 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:47:04,279 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_100-1loop_file-48.i[916,929] [2025-03-03 22:47:04,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:47:04,343 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:47:04,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:04 WrapperNode [2025-03-03 22:47:04,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:47:04,345 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:47:04,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:47:04,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:47:04,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:04" (1/1) ... [2025-03-03 22:47:04,364 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:04" (1/1) ... [2025-03-03 22:47:04,388 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2025-03-03 22:47:04,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:47:04,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:47:04,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:47:04,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:47:04,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:04" (1/1) ... [2025-03-03 22:47:04,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:04" (1/1) ... [2025-03-03 22:47:04,404 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:04" (1/1) ... [2025-03-03 22:47:04,421 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 22:47:04,421 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:04" (1/1) ... [2025-03-03 22:47:04,421 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:04" (1/1) ... [2025-03-03 22:47:04,432 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:04" (1/1) ... [2025-03-03 22:47:04,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:04" (1/1) ... [2025-03-03 22:47:04,435 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:04" (1/1) ... [2025-03-03 22:47:04,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:04" (1/1) ... [2025-03-03 22:47:04,437 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:47:04,438 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:47:04,438 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:47:04,438 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:47:04,439 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:04" (1/1) ... [2025-03-03 22:47:04,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:47:04,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:47:04,468 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 22:47:04,471 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 22:47:04,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:47:04,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:47:04,490 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:47:04,490 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:47:04,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:47:04,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:47:04,549 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:47:04,553 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:47:11,006 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-03 22:47:11,006 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:47:11,016 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:47:11,016 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:47:11,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:47:11 BoogieIcfgContainer [2025-03-03 22:47:11,017 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:47:11,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:47:11,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:47:11,022 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:47:11,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:47:04" (1/3) ... [2025-03-03 22:47:11,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b49fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:47:11, skipping insertion in model container [2025-03-03 22:47:11,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:04" (2/3) ... [2025-03-03 22:47:11,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b49fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:47:11, skipping insertion in model container [2025-03-03 22:47:11,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:47:11" (3/3) ... [2025-03-03 22:47:11,025 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-48.i [2025-03-03 22:47:11,034 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:47:11,035 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-48.i that has 2 procedures, 82 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:47:11,073 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:47:11,081 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;@4161c192, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:47:11,081 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:47:11,086 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 22:47:11,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 22:47:11,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:47:11,094 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:47:11,094 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:47:11,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:47:11,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1333157944, now seen corresponding path program 1 times [2025-03-03 22:47:11,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:47:11,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545522424] [2025-03-03 22:47:11,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:47:11,122 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 22:47:11,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:47:11,124 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 22:47:11,126 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 22:47:11,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 22:47:11,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 22:47:11,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:47:11,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:47:11,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:47:11,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:47:11,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 368 proven. 0 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2025-03-03 22:47:11,573 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:47:11,574 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:47:11,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545522424] [2025-03-03 22:47:11,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545522424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:47:11,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:47:11,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:47:11,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429453489] [2025-03-03 22:47:11,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:47:11,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:47:11,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:47:11,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:47:11,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:47:11,591 INFO L87 Difference]: Start difference. First operand has 82 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:47:11,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:47:11,616 INFO L93 Difference]: Finished difference Result 161 states and 274 transitions. [2025-03-03 22:47:11,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:47:11,619 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 165 [2025-03-03 22:47:11,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:47:11,625 INFO L225 Difference]: With dead ends: 161 [2025-03-03 22:47:11,625 INFO L226 Difference]: Without dead ends: 79 [2025-03-03 22:47:11,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 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 22:47:11,631 INFO L435 NwaCegarLoop]: 124 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, 124 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 22:47:11,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:47:11,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-03 22:47:11,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-03 22:47:11,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 22:47:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 121 transitions. [2025-03-03 22:47:11,667 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 121 transitions. Word has length 165 [2025-03-03 22:47:11,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:47:11,667 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 121 transitions. [2025-03-03 22:47:11,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:47:11,667 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 121 transitions. [2025-03-03 22:47:11,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 22:47:11,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:47:11,670 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:47:11,684 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 22:47:11,870 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 22:47:11,870 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:47:11,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:47:11,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1727025283, now seen corresponding path program 1 times [2025-03-03 22:47:11,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:47:11,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1343124314] [2025-03-03 22:47:11,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:47:11,872 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 22:47:11,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:47:11,874 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 22:47:11,875 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 22:47:11,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 22:47:12,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 22:47:12,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:47:12,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:47:12,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 22:47:12,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:47:13,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 22:47:13,691 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:47:13,691 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:47:13,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1343124314] [2025-03-03 22:47:13,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1343124314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:47:13,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:47:13,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:47:13,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577018275] [2025-03-03 22:47:13,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:47:13,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:47:13,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:47:13,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:47:13,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:47:13,693 INFO L87 Difference]: Start difference. First operand 79 states and 121 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:47:18,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:47:22,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:47:26,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:47:30,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:47:34,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:47:38,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:47:38,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:47:38,313 INFO L93 Difference]: Finished difference Result 232 states and 358 transitions. [2025-03-03 22:47:38,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:47:38,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2025-03-03 22:47:38,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:47:38,359 INFO L225 Difference]: With dead ends: 232 [2025-03-03 22:47:38,362 INFO L226 Difference]: Without dead ends: 156 [2025-03-03 22:47:38,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:47:38,363 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 87 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 51 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.5s IncrementalHoareTripleChecker+Time [2025-03-03 22:47:38,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 456 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 19 Invalid, 6 Unknown, 0 Unchecked, 24.5s Time] [2025-03-03 22:47:38,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-03 22:47:38,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 125. [2025-03-03 22:47:38,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 72 states have internal predecessors, (91), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 22:47:38,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 191 transitions. [2025-03-03 22:47:38,387 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 191 transitions. Word has length 165 [2025-03-03 22:47:38,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:47:38,388 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 191 transitions. [2025-03-03 22:47:38,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:47:38,388 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 191 transitions. [2025-03-03 22:47:38,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 22:47:38,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:47:38,389 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:47:38,406 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 (3)] Ended with exit code 0 [2025-03-03 22:47:38,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:47:38,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:47:38,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:47:38,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1947426291, now seen corresponding path program 1 times [2025-03-03 22:47:38,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:47:38,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [15474678] [2025-03-03 22:47:38,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:47:38,592 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 22:47:38,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:47:38,594 INFO L229 MonitoredProcess]: Starting monitored process 4 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 22:47:38,596 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 (4)] Waiting until timeout for monitored process [2025-03-03 22:47:38,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 22:47:38,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 22:47:38,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:47:38,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:47:39,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 22:47:39,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:47:39,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 568 proven. 24 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2025-03-03 22:47:39,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:47:40,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 24 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 22:47:40,708 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:47:40,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [15474678] [2025-03-03 22:47:40,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [15474678] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:47:40,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 22:47:40,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-03 22:47:40,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346417237] [2025-03-03 22:47:40,708 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 22:47:40,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:47:40,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:47:40,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:47:40,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:47:40,710 INFO L87 Difference]: Start difference. First operand 125 states and 191 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-03 22:47:45,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:47:49,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:47:53,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:47:53,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:47:53,889 INFO L93 Difference]: Finished difference Result 217 states and 323 transitions. [2025-03-03 22:47:53,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:47:53,939 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 166 [2025-03-03 22:47:53,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:47:53,941 INFO L225 Difference]: With dead ends: 217 [2025-03-03 22:47:53,941 INFO L226 Difference]: Without dead ends: 141 [2025-03-03 22:47:53,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 324 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:47:53,942 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 188 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 63 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:47:53,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 217 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 137 Invalid, 3 Unknown, 0 Unchecked, 13.0s Time] [2025-03-03 22:47:53,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-03 22:47:53,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 133. [2025-03-03 22:47:53,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 78 states have internal predecessors, (96), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 22:47:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 196 transitions. [2025-03-03 22:47:53,957 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 196 transitions. Word has length 166 [2025-03-03 22:47:53,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:47:53,957 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 196 transitions. [2025-03-03 22:47:53,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-03 22:47:53,958 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 196 transitions. [2025-03-03 22:47:53,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 22:47:53,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:47:53,963 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:47:53,979 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 (4)] Ended with exit code 0 [2025-03-03 22:47:54,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 22:47:54,164 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:47:54,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:47:54,164 INFO L85 PathProgramCache]: Analyzing trace with hash 692879196, now seen corresponding path program 1 times [2025-03-03 22:47:54,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:47:54,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127387336] [2025-03-03 22:47:54,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:47:54,165 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 22:47:54,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:47:54,167 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:47:54,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 22:47:54,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 22:47:55,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 22:47:55,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:47:55,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:47:55,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-03-03 22:47:55,826 INFO L279 TraceCheckSpWp]: Computing forward predicates...