./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-99.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-99.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 9a4594ea31ffbf6212ff96fe98d0ce3ce9979c812b849295a80843482179f790 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:53:43,364 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:53:43,424 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:53:43,430 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:53:43,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:53:43,448 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:53:43,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:53:43,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:53:43,449 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:53:43,449 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:53:43,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:53:43,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:53:43,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:53:43,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:53:43,449 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:53:43,449 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:53:43,450 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:53:43,450 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:53:43,450 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:53:43,450 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:53:43,450 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:53:43,450 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:53:43,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:53:43,450 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:53:43,450 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:53:43,450 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:53:43,450 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:53:43,451 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:53:43,451 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:53:43,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:53:43,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:53:43,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:53:43,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:53:43,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:53:43,452 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:53:43,452 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:53:43,452 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:53:43,452 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:53:43,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:53:43,453 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:53:43,453 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:53:43,453 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:53:43,453 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:53:43,453 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 -> 9a4594ea31ffbf6212ff96fe98d0ce3ce9979c812b849295a80843482179f790 [2025-03-03 22:53:43,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:53:43,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:53:43,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:53:43,680 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:53:43,680 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:53:43,680 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-99.i [2025-03-03 22:53:44,785 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ed383ce4/c9afda7d96c84b5a9e2a1f176d7d5d91/FLAG25e4a0186 [2025-03-03 22:53:45,028 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:53:45,028 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-99.i [2025-03-03 22:53:45,049 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ed383ce4/c9afda7d96c84b5a9e2a1f176d7d5d91/FLAG25e4a0186 [2025-03-03 22:53:45,342 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ed383ce4/c9afda7d96c84b5a9e2a1f176d7d5d91 [2025-03-03 22:53:45,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:53:45,345 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:53:45,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:53:45,346 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:53:45,349 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:53:45,350 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:53:45" (1/1) ... [2025-03-03 22:53:45,351 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b315ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:45, skipping insertion in model container [2025-03-03 22:53:45,351 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:53:45" (1/1) ... [2025-03-03 22:53:45,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:53:45,466 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-99.i[916,929] [2025-03-03 22:53:45,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:53:45,547 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:53:45,557 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-99.i[916,929] [2025-03-03 22:53:45,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:53:45,623 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:53:45,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:45 WrapperNode [2025-03-03 22:53:45,624 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:53:45,625 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:53:45,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:53:45,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:53:45,630 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:53:45" (1/1) ... [2025-03-03 22:53:45,641 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:53:45" (1/1) ... [2025-03-03 22:53:45,676 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2025-03-03 22:53:45,676 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:53:45,677 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:53:45,677 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:53:45,677 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:53:45,683 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:45" (1/1) ... [2025-03-03 22:53:45,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:45" (1/1) ... [2025-03-03 22:53:45,686 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:45" (1/1) ... [2025-03-03 22:53:45,707 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:53:45,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:45" (1/1) ... [2025-03-03 22:53:45,707 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:45" (1/1) ... [2025-03-03 22:53:45,718 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:45" (1/1) ... [2025-03-03 22:53:45,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:45" (1/1) ... [2025-03-03 22:53:45,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:45" (1/1) ... [2025-03-03 22:53:45,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:45" (1/1) ... [2025-03-03 22:53:45,731 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:53:45,732 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:53:45,732 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:53:45,732 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:53:45,733 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:45" (1/1) ... [2025-03-03 22:53:45,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:53:45,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:53:45,763 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:53:45,766 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:53:45,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:53:45,783 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:53:45,784 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:53:45,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:53:45,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:53:45,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:53:45,843 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:53:45,845 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:53:46,185 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-03 22:53:46,186 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:53:46,192 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:53:46,194 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:53:46,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:53:46 BoogieIcfgContainer [2025-03-03 22:53:46,195 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:53:46,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:53:46,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:53:46,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:53:46,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:53:45" (1/3) ... [2025-03-03 22:53:46,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1867b7dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:53:46, skipping insertion in model container [2025-03-03 22:53:46,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:45" (2/3) ... [2025-03-03 22:53:46,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1867b7dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:53:46, skipping insertion in model container [2025-03-03 22:53:46,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:53:46" (3/3) ... [2025-03-03 22:53:46,202 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-99.i [2025-03-03 22:53:46,213 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:53:46,215 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-99.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:53:46,261 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:53:46,273 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;@7cd2530a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:53:46,273 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:53:46,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 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:53:46,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 22:53:46,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:53:46,303 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:53:46,304 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:53:46,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:53:46,309 INFO L85 PathProgramCache]: Analyzing trace with hash -2131778620, now seen corresponding path program 1 times [2025-03-03 22:53:46,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:53:46,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473650109] [2025-03-03 22:53:46,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:53:46,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:53:46,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 22:53:46,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 22:53:46,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:53:46,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:53:46,573 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:53:46,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:53:46,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473650109] [2025-03-03 22:53:46,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473650109] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:53:46,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324424506] [2025-03-03 22:53:46,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:53:46,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:53:46,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:53:46,579 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:53:46,581 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:53:46,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 22:53:46,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 22:53:46,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:53:46,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:53:46,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:53:46,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:53:46,744 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:53:46,744 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:53:46,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324424506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:53:46,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:53:46,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:53:46,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372526892] [2025-03-03 22:53:46,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:53:46,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:53:46,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:53:46,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:53:46,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:53:46,763 INFO L87 Difference]: Start difference. First operand has 88 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 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:53:46,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:53:46,785 INFO L93 Difference]: Finished difference Result 173 states and 298 transitions. [2025-03-03 22:53:46,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:53:46,786 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:53:46,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:53:46,792 INFO L225 Difference]: With dead ends: 173 [2025-03-03 22:53:46,792 INFO L226 Difference]: Without dead ends: 85 [2025-03-03 22:53:46,794 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:53:46,796 INFO L435 NwaCegarLoop]: 135 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, 135 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:53:46,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:53:46,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-03 22:53:46,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-03 22:53:46,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 58 states have internal predecessors, (82), 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:53:46,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 132 transitions. [2025-03-03 22:53:46,823 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 132 transitions. Word has length 165 [2025-03-03 22:53:46,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:53:46,823 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 132 transitions. [2025-03-03 22:53:46,824 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:53:46,824 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 132 transitions. [2025-03-03 22:53:46,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 22:53:46,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:53:46,828 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:53:46,835 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:53:47,029 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:53:47,029 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:53:47,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:53:47,030 INFO L85 PathProgramCache]: Analyzing trace with hash 2117002909, now seen corresponding path program 1 times [2025-03-03 22:53:47,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:53:47,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400536437] [2025-03-03 22:53:47,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:53:47,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:53:47,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 22:53:47,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 22:53:47,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:53:47,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:53:47,450 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:53:47,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:53:47,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400536437] [2025-03-03 22:53:47,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400536437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:53:47,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:53:47,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:53:47,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667856446] [2025-03-03 22:53:47,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:53:47,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:53:47,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:53:47,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:53:47,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:53:47,454 INFO L87 Difference]: Start difference. First operand 85 states and 132 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:53:47,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:53:47,505 INFO L93 Difference]: Finished difference Result 249 states and 390 transitions. [2025-03-03 22:53:47,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:53:47,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 166 [2025-03-03 22:53:47,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:53:47,511 INFO L225 Difference]: With dead ends: 249 [2025-03-03 22:53:47,512 INFO L226 Difference]: Without dead ends: 167 [2025-03-03 22:53:47,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:53:47,514 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 70 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:53:47,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 258 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:53:47,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-03 22:53:47,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2025-03-03 22:53:47,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 112 states have (on average 1.4107142857142858) internal successors, (158), 112 states have internal predecessors, (158), 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:53:47,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 258 transitions. [2025-03-03 22:53:47,548 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 258 transitions. Word has length 166 [2025-03-03 22:53:47,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:53:47,551 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 258 transitions. [2025-03-03 22:53:47,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:53:47,551 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 258 transitions. [2025-03-03 22:53:47,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 22:53:47,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:53:47,552 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:53:47,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:53:47,553 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:53:47,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:53:47,553 INFO L85 PathProgramCache]: Analyzing trace with hash -418941022, now seen corresponding path program 1 times [2025-03-03 22:53:47,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:53:47,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564337151] [2025-03-03 22:53:47,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:53:47,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:53:47,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 22:53:47,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 22:53:47,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:53:47,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:53:48,041 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:53:48,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:53:48,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564337151] [2025-03-03 22:53:48,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564337151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:53:48,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:53:48,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:53:48,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950857716] [2025-03-03 22:53:48,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:53:48,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:53:48,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:53:48,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:53:48,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:53:48,045 INFO L87 Difference]: Start difference. First operand 165 states and 258 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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:53:48,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:53:48,300 INFO L93 Difference]: Finished difference Result 432 states and 676 transitions. [2025-03-03 22:53:48,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:53:48,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 167 [2025-03-03 22:53:48,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:53:48,304 INFO L225 Difference]: With dead ends: 432 [2025-03-03 22:53:48,307 INFO L226 Difference]: Without dead ends: 270 [2025-03-03 22:53:48,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:53:48,311 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 102 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:53:48,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 448 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:53:48,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-03 22:53:48,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 212. [2025-03-03 22:53:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 133 states have (on average 1.3458646616541354) internal successors, (179), 133 states have internal predecessors, (179), 75 states have call successors, (75), 3 states have call predecessors, (75), 3 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-03 22:53:48,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 329 transitions. [2025-03-03 22:53:48,353 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 329 transitions. Word has length 167 [2025-03-03 22:53:48,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:53:48,353 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 329 transitions. [2025-03-03 22:53:48,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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:53:48,354 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 329 transitions. [2025-03-03 22:53:48,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 22:53:48,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:53:48,357 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, 1] [2025-03-03 22:53:48,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:53:48,357 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:53:48,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:53:48,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1816891301, now seen corresponding path program 1 times [2025-03-03 22:53:48,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:53:48,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674745494] [2025-03-03 22:53:48,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:53:48,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:53:48,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 22:53:48,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 22:53:48,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:53:48,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:53:48,529 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:53:48,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:53:48,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674745494] [2025-03-03 22:53:48,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674745494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:53:48,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:53:48,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:53:48,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925222582] [2025-03-03 22:53:48,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:53:48,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:53:48,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:53:48,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:53:48,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:53:48,534 INFO L87 Difference]: Start difference. First operand 212 states and 329 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:53:48,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:53:48,691 INFO L93 Difference]: Finished difference Result 432 states and 675 transitions. [2025-03-03 22:53:48,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:53:48,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 168 [2025-03-03 22:53:48,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:53:48,694 INFO L225 Difference]: With dead ends: 432 [2025-03-03 22:53:48,694 INFO L226 Difference]: Without dead ends: 270 [2025-03-03 22:53:48,695 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:53:48,695 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 100 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:53:48,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 503 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:53:48,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-03 22:53:48,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 213. [2025-03-03 22:53:48,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 134 states have (on average 1.3432835820895523) internal successors, (180), 134 states have internal predecessors, (180), 75 states have call successors, (75), 3 states have call predecessors, (75), 3 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-03 22:53:48,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 330 transitions. [2025-03-03 22:53:48,723 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 330 transitions. Word has length 168 [2025-03-03 22:53:48,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:53:48,724 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 330 transitions. [2025-03-03 22:53:48,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:53:48,724 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 330 transitions. [2025-03-03 22:53:48,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 22:53:48,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:53:48,726 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, 1, 1] [2025-03-03 22:53:48,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 22:53:48,726 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:53:48,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:53:48,727 INFO L85 PathProgramCache]: Analyzing trace with hash 66997254, now seen corresponding path program 1 times [2025-03-03 22:53:48,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:53:48,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150841993] [2025-03-03 22:53:48,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:53:48,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:53:48,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 22:53:48,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 22:53:48,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:53:48,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:53:49,086 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:53:49,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:53:49,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150841993] [2025-03-03 22:53:49,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150841993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:53:49,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:53:49,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:53:49,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074235378] [2025-03-03 22:53:49,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:53:49,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:53:49,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:53:49,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:53:49,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:53:49,090 INFO L87 Difference]: Start difference. First operand 213 states and 330 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:53:49,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:53:49,298 INFO L93 Difference]: Finished difference Result 432 states and 674 transitions. [2025-03-03 22:53:49,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:53:49,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 169 [2025-03-03 22:53:49,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:53:49,301 INFO L225 Difference]: With dead ends: 432 [2025-03-03 22:53:49,302 INFO L226 Difference]: Without dead ends: 270 [2025-03-03 22:53:49,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:53:49,303 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 84 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:53:49,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 436 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:53:49,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-03 22:53:49,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 214. [2025-03-03 22:53:49,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 135 states have (on average 1.3407407407407408) internal successors, (181), 135 states have internal predecessors, (181), 75 states have call successors, (75), 3 states have call predecessors, (75), 3 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-03 22:53:49,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 331 transitions. [2025-03-03 22:53:49,342 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 331 transitions. Word has length 169 [2025-03-03 22:53:49,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:53:49,343 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 331 transitions. [2025-03-03 22:53:49,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:53:49,343 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 331 transitions. [2025-03-03 22:53:49,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 22:53:49,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:53:49,344 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, 1, 1] [2025-03-03 22:53:49,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 22:53:49,344 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:53:49,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:53:49,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1971059035, now seen corresponding path program 1 times [2025-03-03 22:53:49,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:53:49,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275590049] [2025-03-03 22:53:49,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:53:49,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:53:49,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 22:53:49,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 22:53:49,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:53:49,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:53:49,549 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:53:49,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:53:49,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275590049] [2025-03-03 22:53:49,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275590049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:53:49,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:53:49,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:53:49,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488301241] [2025-03-03 22:53:49,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:53:49,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:53:49,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:53:49,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:53:49,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:53:49,551 INFO L87 Difference]: Start difference. First operand 214 states and 331 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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:53:49,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:53:49,603 INFO L93 Difference]: Finished difference Result 410 states and 636 transitions. [2025-03-03 22:53:49,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:53:49,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 169 [2025-03-03 22:53:49,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:53:49,606 INFO L225 Difference]: With dead ends: 410 [2025-03-03 22:53:49,608 INFO L226 Difference]: Without dead ends: 248 [2025-03-03 22:53:49,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:53:49,609 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 31 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:53:49,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 248 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:53:49,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-03 22:53:49,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 214. [2025-03-03 22:53:49,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 135 states have (on average 1.325925925925926) internal successors, (179), 135 states have internal predecessors, (179), 75 states have call successors, (75), 3 states have call predecessors, (75), 3 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-03 22:53:49,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 329 transitions. [2025-03-03 22:53:49,638 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 329 transitions. Word has length 169 [2025-03-03 22:53:49,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:53:49,638 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 329 transitions. [2025-03-03 22:53:49,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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:53:49,639 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 329 transitions. [2025-03-03 22:53:49,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 22:53:49,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:53:49,640 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, 1, 1, 1] [2025-03-03 22:53:49,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 22:53:49,640 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:53:49,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:53:49,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1652385862, now seen corresponding path program 1 times [2025-03-03 22:53:49,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:53:49,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12075123] [2025-03-03 22:53:49,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:53:49,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:53:49,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 22:53:49,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 22:53:49,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:53:49,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:53:49,762 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:53:49,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 22:53:49,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 22:53:49,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:53:49,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:53:49,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:53:49,938 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:53:49,938 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:53:49,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 22:53:49,943 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:53:50,064 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:53:50,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:53:50 BoogieIcfgContainer [2025-03-03 22:53:50,068 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:53:50,069 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:53:50,069 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:53:50,069 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:53:50,069 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:53:46" (3/4) ... [2025-03-03 22:53:50,071 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:53:50,073 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:53:50,074 INFO L158 Benchmark]: Toolchain (without parser) took 4728.57ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 112.4MB in the beginning and 110.6MB in the end (delta: 1.8MB). Peak memory consumption was 72.8MB. Max. memory is 16.1GB. [2025-03-03 22:53:50,074 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:53:50,074 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.12ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 95.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:53:50,074 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.19ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 89.6MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:53:50,074 INFO L158 Benchmark]: Boogie Preprocessor took 54.17ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 78.8MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:53:50,075 INFO L158 Benchmark]: IcfgBuilder took 463.10ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 46.4MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 22:53:50,075 INFO L158 Benchmark]: TraceAbstraction took 3872.23ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 46.0MB in the beginning and 110.6MB in the end (delta: -64.6MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2025-03-03 22:53:50,075 INFO L158 Benchmark]: Witness Printer took 4.03ms. Allocated memory is still 218.1MB. Free memory was 110.6MB in the beginning and 110.6MB in the end (delta: 21.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:53:50,076 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.19ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.12ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 95.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.19ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 89.6MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.17ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 78.8MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 463.10ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 46.4MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3872.23ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 46.0MB in the beginning and 110.6MB in the end (delta: -64.6MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Witness Printer took 4.03ms. Allocated memory is still 218.1MB. Free memory was 110.6MB in the beginning and 110.6MB in the end (delta: 21.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 186, overapproximation of someBinaryFLOATComparisonOperation at line 182, overapproximation of someBinaryFLOATComparisonOperation at line 215, overapproximation of someBinaryFLOATComparisonOperation at line 184, overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 190. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 8; [L23] unsigned char var_1_4 = 200; [L24] unsigned char var_1_5 = 0; [L25] unsigned long int var_1_6 = 1000000; [L26] signed short int var_1_7 = -1; [L27] unsigned char var_1_8 = 1; [L28] unsigned char var_1_9 = 0; [L29] signed short int var_1_10 = 128; [L30] unsigned char var_1_12 = 1; [L31] unsigned char var_1_14 = 128; [L32] unsigned char var_1_15 = 25; [L33] unsigned char var_1_16 = 1; [L34] float var_1_17 = 1.25; [L35] float var_1_18 = 3.5; [L36] float var_1_19 = 127.45; [L37] float var_1_20 = 1.5; [L38] float var_1_21 = 24.4; [L39] float var_1_22 = 0.8; [L40] unsigned char var_1_23 = 4; [L41] unsigned char var_1_24 = 0; [L42] unsigned char var_1_25 = 8; [L43] unsigned char var_1_26 = 64; [L44] signed short int var_1_27 = 256; [L45] unsigned char var_1_28 = 1; [L46] unsigned char var_1_30 = 0; [L47] unsigned char var_1_31 = 0; [L48] unsigned char last_1_var_1_1 = 8; [L49] unsigned long int last_1_var_1_6 = 1000000; [L50] signed short int last_1_var_1_7 = -1; [L51] unsigned char last_1_var_1_12 = 1; [L52] float last_1_var_1_17 = 1.25; [L53] unsigned char last_1_var_1_23 = 4; [L54] unsigned char last_1_var_1_25 = 8; [L55] unsigned char last_1_var_1_28 = 1; VAL [isInitial=0, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=200, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L219] isInitial = 1 [L220] FCALL initially() [L221] int k_loop; [L222] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=200, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L222] COND TRUE k_loop < 1 [L223] CALL updateLastVariables() [L205] last_1_var_1_1 = var_1_1 [L206] last_1_var_1_6 = var_1_6 [L207] last_1_var_1_7 = var_1_7 [L208] last_1_var_1_12 = var_1_12 [L209] last_1_var_1_17 = var_1_17 [L210] last_1_var_1_23 = var_1_23 [L211] last_1_var_1_25 = var_1_25 [L212] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=200, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L223] RET updateLastVariables() [L224] CALL updateVariables() [L163] var_1_4 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_4 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L164] RET assume_abort_if_not(var_1_4 >= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L165] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L165] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L166] var_1_5 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L167] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L168] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L168] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L169] var_1_9 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1] [L170] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1] [L171] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L171] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L172] var_1_14 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_14 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L173] RET assume_abort_if_not(var_1_14 >= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L174] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L174] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L175] var_1_15 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L176] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L177] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L177] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L178] var_1_16 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L179] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L180] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L180] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L181] var_1_18 = __VERIFIER_nondet_float() [L182] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L182] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L183] var_1_19 = __VERIFIER_nondet_float() [L184] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L184] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L185] var_1_20 = __VERIFIER_nondet_float() [L186] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L186] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L187] var_1_21 = __VERIFIER_nondet_float() [L188] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L188] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L189] var_1_22 = __VERIFIER_nondet_float() [L190] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L190] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L191] var_1_24 = __VERIFIER_nondet_uchar() [L192] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L192] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L193] CALL assume_abort_if_not(var_1_24 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L193] RET assume_abort_if_not(var_1_24 <= 63) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L194] var_1_26 = __VERIFIER_nondet_uchar() [L195] CALL assume_abort_if_not(var_1_26 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L195] RET assume_abort_if_not(var_1_26 >= 63) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L196] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L196] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L197] var_1_30 = __VERIFIER_nondet_uchar() [L198] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L198] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L199] CALL assume_abort_if_not(var_1_30 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L199] RET assume_abort_if_not(var_1_30 <= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L200] var_1_31 = __VERIFIER_nondet_uchar() [L201] CALL assume_abort_if_not(var_1_31 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L201] RET assume_abort_if_not(var_1_31 >= 1) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L202] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L202] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L224] RET updateVariables() [L225] CALL step() [L59] signed long int stepLocal_5 = last_1_var_1_7; [L60] signed long int stepLocal_4 = last_1_var_1_7; [L61] signed long int stepLocal_3 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_3=8, stepLocal_4=-1, stepLocal_5=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L62] COND TRUE stepLocal_4 > last_1_var_1_6 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_3=8, stepLocal_5=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L63] COND TRUE stepLocal_5 < last_1_var_1_25 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_3=8, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L64] COND FALSE !(stepLocal_3 <= last_1_var_1_12) [L67] var_1_12 = (((((var_1_5) < (var_1_15)) ? (var_1_5) : (var_1_15))) + var_1_16) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=126, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L73] COND FALSE !(last_1_var_1_25 < last_1_var_1_1) [L80] var_1_28 = var_1_31 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=126, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L82] COND FALSE !(var_1_21 != var_1_19) [L89] var_1_25 = (var_1_14 - (var_1_26 - var_1_24)) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=126, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L91] unsigned char stepLocal_0 = ! var_1_28; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_0=0, var_1_10=128, var_1_12=126, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L92] COND FALSE !(stepLocal_0 && var_1_28) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=126, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L95] COND TRUE \read(var_1_28) [L96] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=126, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=126, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=-256] [L101] var_1_7 = var_1_5 [L102] unsigned char stepLocal_2 = var_1_12; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_2=126, var_1_10=128, var_1_12=126, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=126, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=126, var_1_8=1, var_1_9=-256] [L103] COND TRUE stepLocal_2 == ((((var_1_7) > (var_1_12)) ? (var_1_7) : (var_1_12))) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=126, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=126, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=126, var_1_8=1, var_1_9=-256] [L104] COND TRUE ! (var_1_12 > ((((var_1_7) < (var_1_4)) ? (var_1_7) : (var_1_4)))) [L105] var_1_8 = var_1_9 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=126, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=126, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=126, var_1_8=-256, var_1_9=-256] [L108] COND FALSE !(var_1_12 < var_1_12) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=126, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=126, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=126, var_1_8=-256, var_1_9=-256] [L111] COND TRUE \read(var_1_28) [L112] var_1_10 = var_1_4 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=254, var_1_12=126, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=126, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=126, var_1_8=-256, var_1_9=-256] [L117] unsigned char stepLocal_10 = var_1_9; [L118] signed short int stepLocal_9 = var_1_10; [L119] unsigned char stepLocal_8 = var_1_15; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=-256, stepLocal_8=126, stepLocal_9=254, var_1_10=254, var_1_12=126, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=126, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=126, var_1_8=-256, var_1_9=-256] [L120] COND TRUE \read(var_1_28) [L121] var_1_27 = var_1_5 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=-256, stepLocal_8=126, stepLocal_9=254, var_1_10=254, var_1_12=126, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=126, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=126, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=126, var_1_8=-256, var_1_9=-256] [L135] unsigned char stepLocal_1 = var_1_4 > 2; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=-256, stepLocal_1=1, stepLocal_8=126, stepLocal_9=254, var_1_10=254, var_1_12=126, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=126, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=126, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=1000000, var_1_7=126, var_1_8=-256, var_1_9=-256] [L136] COND TRUE \read(var_1_28) [L137] var_1_6 = (var_1_4 + var_1_27) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=-256, stepLocal_1=1, stepLocal_8=126, stepLocal_9=254, var_1_10=254, var_1_12=126, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=126, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=126, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=380, var_1_7=126, var_1_8=-256, var_1_9=-256] [L143] signed short int stepLocal_7 = var_1_27; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=-256, stepLocal_1=1, stepLocal_7=126, stepLocal_8=126, stepLocal_9=254, var_1_10=254, var_1_12=126, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=126, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=126, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=380, var_1_7=126, var_1_8=-256, var_1_9=-256] [L144] COND FALSE !(\read(var_1_8)) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=-256, stepLocal_1=1, stepLocal_7=126, stepLocal_8=126, stepLocal_9=254, var_1_10=254, var_1_12=126, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=126, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=126, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=380, var_1_7=126, var_1_8=-256, var_1_9=-256] [L151] signed short int stepLocal_6 = var_1_10; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=-256, stepLocal_1=1, stepLocal_6=254, stepLocal_7=126, stepLocal_8=126, stepLocal_9=254, var_1_10=254, var_1_12=126, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=5/4, var_1_1=126, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=126, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=380, var_1_7=126, var_1_8=-256, var_1_9=-256] [L152] COND FALSE !(\read(var_1_8)) [L159] var_1_17 = var_1_21 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=-256, stepLocal_1=1, stepLocal_6=254, stepLocal_7=126, stepLocal_8=126, stepLocal_9=254, var_1_10=254, var_1_12=126, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=1000005, var_1_1=126, var_1_21=1000005, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=126, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=380, var_1_7=126, var_1_8=-256, var_1_9=-256] [L225] RET step() [L226] CALL, EXPR property() [L215-L216] return ((((((((((((! var_1_28) && var_1_28) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_28 ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) 1)))) && (var_1_28 ? (var_1_6 == ((unsigned long int) (var_1_4 + var_1_27))) : (((var_1_4 > 2) && var_1_8) ? (var_1_6 == ((unsigned long int) ((((var_1_27) > (var_1_4)) ? (var_1_27) : (var_1_4))))) : 1))) && (var_1_7 == ((signed short int) var_1_5))) && ((var_1_12 == ((((var_1_7) > (var_1_12)) ? (var_1_7) : (var_1_12)))) ? ((! (var_1_12 > ((((var_1_7) < (var_1_4)) ? (var_1_7) : (var_1_4))))) ? (var_1_8 == ((unsigned char) var_1_9)) : 1) : 1)) && ((var_1_12 < var_1_12) ? (var_1_10 == ((signed short int) (var_1_25 - ((((var_1_5) < (16)) ? (var_1_5) : (16)))))) : (var_1_28 ? (var_1_10 == ((signed short int) var_1_4)) : (var_1_10 == ((signed short int) var_1_25))))) && ((last_1_var_1_7 > last_1_var_1_6) ? ((last_1_var_1_7 < last_1_var_1_25) ? ((last_1_var_1_1 <= last_1_var_1_12) ? (var_1_12 == ((unsigned char) (((((var_1_4) < (var_1_14)) ? (var_1_4) : (var_1_14))) - var_1_5))) : (var_1_12 == ((unsigned char) (((((var_1_5) < (var_1_15)) ? (var_1_5) : (var_1_15))) + var_1_16)))) : (var_1_12 == ((unsigned char) var_1_16))) : 1)) && (var_1_8 ? ((var_1_10 <= var_1_23) ? (var_1_17 == ((float) ((((((1.0000000000000012E14f + var_1_18)) < (var_1_19)) ? ((1.0000000000000012E14f + var_1_18)) : (var_1_19))) + var_1_20))) : (var_1_17 == ((float) (var_1_21 - var_1_22)))) : (var_1_17 == ((float) var_1_21)))) && (var_1_8 ? ((var_1_27 <= last_1_var_1_23) ? (var_1_23 == ((unsigned char) 10)) : (var_1_23 == ((unsigned char) ((200 - var_1_24) - 64)))) : 1)) && ((var_1_21 != var_1_19) ? (var_1_28 ? (var_1_25 == ((unsigned char) ((((var_1_24) < (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) ? (var_1_24) : (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))))))) : (var_1_25 == ((unsigned char) ((((4) > (var_1_5)) ? (4) : (var_1_5)))))) : (var_1_25 == ((unsigned char) (var_1_14 - (var_1_26 - var_1_24)))))) && (var_1_28 ? (var_1_27 == ((signed short int) var_1_5)) : (var_1_28 ? ((var_1_10 <= var_1_15) ? (var_1_27 == ((signed short int) -10)) : 1) : ((var_1_10 <= (var_1_4 - var_1_5)) ? ((var_1_9 || (var_1_19 < var_1_20)) ? (var_1_27 == ((signed short int) (((((1) < (var_1_4)) ? (1) : (var_1_4))) + ((((var_1_14) > (var_1_10)) ? (var_1_14) : (var_1_10)))))) : 1) : 1)))) && ((last_1_var_1_25 < last_1_var_1_1) ? (((- last_1_var_1_17) < ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))) ? (var_1_28 == ((unsigned char) ((last_1_var_1_28 || var_1_9) && var_1_30))) : (var_1_28 == ((unsigned char) var_1_30))) : (var_1_28 == ((unsigned char) var_1_31))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=254, var_1_12=126, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=1000005, var_1_1=126, var_1_21=1000005, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=126, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=380, var_1_7=126, var_1_8=-256, var_1_9=-256] [L226] RET, EXPR property() [L226] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=254, var_1_12=126, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=1000005, var_1_1=126, var_1_21=1000005, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=126, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=380, var_1_7=126, var_1_8=-256, var_1_9=-256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=254, var_1_12=126, var_1_14=-32258, var_1_15=126, var_1_16=0, var_1_17=1000005, var_1_1=126, var_1_21=1000005, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=126, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=126, var_1_6=380, var_1_7=126, var_1_8=-256, var_1_9=-256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 7, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 387 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 387 mSDsluCounter, 2028 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1228 mSDsCounter, 234 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 217 IncrementalHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 234 mSolverCounterUnsat, 800 mSDtfsCounter, 217 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 198 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=214occurred in iteration=5, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 207 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1339 NumberOfCodeBlocks, 1339 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1162 ConstructedInterpolants, 0 QuantifiedInterpolants, 2939 SizeOfPredicates, 0 NumberOfNonLiveVariables, 414 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 8352/8400 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:53:50,097 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-99.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 9a4594ea31ffbf6212ff96fe98d0ce3ce9979c812b849295a80843482179f790 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:53:52,012 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:53:52,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:53:52,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:53:52,122 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:53:52,144 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:53:52,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:53:52,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:53:52,146 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:53:52,146 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:53:52,147 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:53:52,148 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:53:52,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:53:52,148 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:53:52,148 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:53:52,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:53:52,149 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:53:52,149 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:53:52,149 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:53:52,149 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:53:52,149 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:53:52,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:53:52,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:53:52,149 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:53:52,149 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:53:52,149 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:53:52,149 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:53:52,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:53:52,150 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:53:52,150 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:53:52,150 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:53:52,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:53:52,150 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:53:52,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:53:52,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:53:52,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:53:52,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:53:52,151 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:53:52,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:53:52,151 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:53:52,151 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:53:52,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:53:52,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:53:52,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:53:52,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:53:52,151 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 -> 9a4594ea31ffbf6212ff96fe98d0ce3ce9979c812b849295a80843482179f790 [2025-03-03 22:53:52,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:53:52,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:53:52,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:53:52,410 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:53:52,410 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:53:52,412 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-99.i [2025-03-03 22:53:53,542 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71574ab78/abab30d3dc7d456ca9b6c5f98cd3c363/FLAG4533f2309 [2025-03-03 22:53:53,760 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:53:53,760 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-99.i [2025-03-03 22:53:53,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71574ab78/abab30d3dc7d456ca9b6c5f98cd3c363/FLAG4533f2309 [2025-03-03 22:53:53,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71574ab78/abab30d3dc7d456ca9b6c5f98cd3c363 [2025-03-03 22:53:53,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:53:53,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:53:53,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:53:53,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:53:53,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:53:53,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:53:53" (1/1) ... [2025-03-03 22:53:53,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@235d2378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:53, skipping insertion in model container [2025-03-03 22:53:53,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:53:53" (1/1) ... [2025-03-03 22:53:53,824 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:53:53,940 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-99.i[916,929] [2025-03-03 22:53:54,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:53:54,018 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:53:54,029 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-99.i[916,929] [2025-03-03 22:53:54,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:53:54,074 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:53:54,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:54 WrapperNode [2025-03-03 22:53:54,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:53:54,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:53:54,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:53:54,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:53:54,081 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:53:54" (1/1) ... [2025-03-03 22:53:54,095 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:53:54" (1/1) ... [2025-03-03 22:53:54,122 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2025-03-03 22:53:54,123 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:53:54,123 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:53:54,123 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:53:54,123 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:53:54,133 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:54" (1/1) ... [2025-03-03 22:53:54,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:54" (1/1) ... [2025-03-03 22:53:54,138 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:54" (1/1) ... [2025-03-03 22:53:54,154 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:53:54,154 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:54" (1/1) ... [2025-03-03 22:53:54,155 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:54" (1/1) ... [2025-03-03 22:53:54,169 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:54" (1/1) ... [2025-03-03 22:53:54,170 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:54" (1/1) ... [2025-03-03 22:53:54,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:54" (1/1) ... [2025-03-03 22:53:54,174 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:54" (1/1) ... [2025-03-03 22:53:54,176 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:53:54,180 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:53:54,180 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:53:54,180 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:53:54,181 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:54" (1/1) ... [2025-03-03 22:53:54,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:53:54,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:53:54,206 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:53:54,209 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:53:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:53:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:53:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:53:54,228 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:53:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:53:54,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:53:54,310 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:53:54,311 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:53:55,227 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-03 22:53:55,227 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:53:55,234 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:53:55,235 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:53:55,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:53:55 BoogieIcfgContainer [2025-03-03 22:53:55,235 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:53:55,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:53:55,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:53:55,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:53:55,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:53:53" (1/3) ... [2025-03-03 22:53:55,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e0fb3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:53:55, skipping insertion in model container [2025-03-03 22:53:55,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:54" (2/3) ... [2025-03-03 22:53:55,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e0fb3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:53:55, skipping insertion in model container [2025-03-03 22:53:55,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:53:55" (3/3) ... [2025-03-03 22:53:55,242 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-99.i [2025-03-03 22:53:55,252 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:53:55,253 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-99.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:53:55,289 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:53:55,313 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;@2cf919ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:53:55,314 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:53:55,318 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 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:53:55,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 22:53:55,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:53:55,330 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:53:55,330 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:53:55,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:53:55,334 INFO L85 PathProgramCache]: Analyzing trace with hash -2131778620, now seen corresponding path program 1 times [2025-03-03 22:53:55,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:53:55,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345342496] [2025-03-03 22:53:55,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:53:55,347 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:53:55,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:53:55,350 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:53:55,351 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:53:55,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 22:53:55,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 22:53:55,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:53:55,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:53:55,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:53:55,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:53:55,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2025-03-03 22:53:55,681 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:53:55,682 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:53:55,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345342496] [2025-03-03 22:53:55,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345342496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:53:55,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:53:55,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:53:55,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425170243] [2025-03-03 22:53:55,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:53:55,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:53:55,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:53:55,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:53:55,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:53:55,701 INFO L87 Difference]: Start difference. First operand has 88 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 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:53:55,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:53:55,725 INFO L93 Difference]: Finished difference Result 173 states and 298 transitions. [2025-03-03 22:53:55,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:53:55,726 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:53:55,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:53:55,735 INFO L225 Difference]: With dead ends: 173 [2025-03-03 22:53:55,735 INFO L226 Difference]: Without dead ends: 85 [2025-03-03 22:53:55,738 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:53:55,741 INFO L435 NwaCegarLoop]: 135 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, 135 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:53:55,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:53:55,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-03 22:53:55,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-03 22:53:55,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 58 states have internal predecessors, (82), 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:53:55,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 132 transitions. [2025-03-03 22:53:55,783 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 132 transitions. Word has length 165 [2025-03-03 22:53:55,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:53:55,784 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 132 transitions. [2025-03-03 22:53:55,785 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:53:55,785 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 132 transitions. [2025-03-03 22:53:55,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 22:53:55,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:53:55,788 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:53:55,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 22:53:55,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:53:55,988 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:53:55,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:53:55,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2117002909, now seen corresponding path program 1 times [2025-03-03 22:53:55,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:53:55,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33788873] [2025-03-03 22:53:55,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:53:55,990 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:53:55,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:53:55,992 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:53:55,994 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:53:56,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 22:53:56,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 22:53:56,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:53:56,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:53:56,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 22:53:56,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:53:57,143 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:53:57,143 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:53:57,143 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:53:57,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33788873] [2025-03-03 22:53:57,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [33788873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:53:57,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:53:57,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:53:57,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788669224] [2025-03-03 22:53:57,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:53:57,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:53:57,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:53:57,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:53:57,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:53:57,145 INFO L87 Difference]: Start difference. First operand 85 states and 132 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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:53:58,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:53:58,387 INFO L93 Difference]: Finished difference Result 250 states and 391 transitions. [2025-03-03 22:53:58,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:53:58,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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 166 [2025-03-03 22:53:58,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:53:58,401 INFO L225 Difference]: With dead ends: 250 [2025-03-03 22:53:58,401 INFO L226 Difference]: Without dead ends: 168 [2025-03-03 22:53:58,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:53:58,402 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 99 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:53:58,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 448 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 22:53:58,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-03 22:53:58,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 132. [2025-03-03 22:53:58,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 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:53:58,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 203 transitions. [2025-03-03 22:53:58,428 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 203 transitions. Word has length 166 [2025-03-03 22:53:58,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:53:58,429 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 203 transitions. [2025-03-03 22:53:58,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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:53:58,429 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 203 transitions. [2025-03-03 22:53:58,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 22:53:58,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:53:58,430 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:53:58,439 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:53:58,630 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:53:58,631 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:53:58,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:53:58,631 INFO L85 PathProgramCache]: Analyzing trace with hash -837586236, now seen corresponding path program 1 times [2025-03-03 22:53:58,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:53:58,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442347764] [2025-03-03 22:53:58,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:53:58,632 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:53:58,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:53:58,634 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:53:58,635 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:53:58,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 22:53:58,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 22:53:58,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:53:58,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:53:58,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 22:53:58,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:53:59,217 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:53:59,217 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:53:59,217 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:53:59,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [442347764] [2025-03-03 22:53:59,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [442347764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:53:59,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:53:59,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:53:59,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255251851] [2025-03-03 22:53:59,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:53:59,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:53:59,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:53:59,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:53:59,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:53:59,218 INFO L87 Difference]: Start difference. First operand 132 states and 203 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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:54:00,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:54:00,475 INFO L93 Difference]: Finished difference Result 250 states and 390 transitions. [2025-03-03 22:54:00,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:54:00,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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 167 [2025-03-03 22:54:00,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:54:00,486 INFO L225 Difference]: With dead ends: 250 [2025-03-03 22:54:00,487 INFO L226 Difference]: Without dead ends: 168 [2025-03-03 22:54:00,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 163 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:54:00,487 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 97 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:54:00,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 503 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 22:54:00,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-03 22:54:00,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 133. [2025-03-03 22:54:00,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 80 states have (on average 1.3) internal successors, (104), 80 states have internal predecessors, (104), 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:54:00,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 204 transitions. [2025-03-03 22:54:00,509 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 204 transitions. Word has length 167 [2025-03-03 22:54:00,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:54:00,510 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 204 transitions. [2025-03-03 22:54:00,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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:54:00,510 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 204 transitions. [2025-03-03 22:54:00,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 22:54:00,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:00,514 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, 1] [2025-03-03 22:54:00,524 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:54:00,714 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:54:00,715 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:00,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:00,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1855583673, now seen corresponding path program 1 times [2025-03-03 22:54:00,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:54:00,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264595991] [2025-03-03 22:54:00,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:00,716 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:54:00,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:54:00,719 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:54:00,720 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:54:00,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 22:54:00,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 22:54:00,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:00,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:00,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 22:54:00,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:54:01,466 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:54:01,466 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:54:01,466 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:54:01,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264595991] [2025-03-03 22:54:01,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [264595991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:54:01,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:54:01,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:54:01,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215182584] [2025-03-03 22:54:01,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:54:01,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:54:01,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:54:01,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:54:01,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:54:01,467 INFO L87 Difference]: Start difference. First operand 133 states and 204 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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:54:02,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:54:02,900 INFO L93 Difference]: Finished difference Result 250 states and 389 transitions. [2025-03-03 22:54:02,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:54:02,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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 168 [2025-03-03 22:54:02,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:54:02,912 INFO L225 Difference]: With dead ends: 250 [2025-03-03 22:54:02,912 INFO L226 Difference]: Without dead ends: 168 [2025-03-03 22:54:02,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 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:54:02,913 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 81 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 22:54:02,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 435 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 22:54:02,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-03 22:54:02,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 134. [2025-03-03 22:54:02,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 81 states have internal predecessors, (105), 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:54:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 205 transitions. [2025-03-03 22:54:02,932 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 205 transitions. Word has length 168 [2025-03-03 22:54:02,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:54:02,932 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 205 transitions. [2025-03-03 22:54:02,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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:54:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 205 transitions. [2025-03-03 22:54:02,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 22:54:02,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:02,934 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, 1] [2025-03-03 22:54:02,944 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 (5)] Ended with exit code 0 [2025-03-03 22:54:03,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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:54:03,135 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:03,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:03,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2066934586, now seen corresponding path program 1 times [2025-03-03 22:54:03,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:54:03,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [737801066] [2025-03-03 22:54:03,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:03,137 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:54:03,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:54:03,138 INFO L229 MonitoredProcess]: Starting monitored process 6 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:54:03,140 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 (6)] Waiting until timeout for monitored process [2025-03-03 22:54:03,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 22:54:03,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 22:54:03,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:03,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:03,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 22:54:03,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:54:03,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-03 22:54:03,513 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:54:03,513 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:54:03,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [737801066] [2025-03-03 22:54:03,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [737801066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:54:03,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:54:03,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 22:54:03,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5788122] [2025-03-03 22:54:03,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:54:03,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 22:54:03,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:54:03,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 22:54:03,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:54:03,514 INFO L87 Difference]: Start difference. First operand 134 states and 205 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:54:05,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:54:05,065 INFO L93 Difference]: Finished difference Result 319 states and 474 transitions. [2025-03-03 22:54:05,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 22:54:05,066 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) Word has length 168 [2025-03-03 22:54:05,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:54:05,068 INFO L225 Difference]: With dead ends: 319 [2025-03-03 22:54:05,068 INFO L226 Difference]: Without dead ends: 237 [2025-03-03 22:54:05,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2025-03-03 22:54:05,069 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 244 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:54:05,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 694 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 22:54:05,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-03 22:54:05,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 160. [2025-03-03 22:54:05,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 104 states have internal predecessors, (131), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 22:54:05,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 231 transitions. [2025-03-03 22:54:05,096 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 231 transitions. Word has length 168 [2025-03-03 22:54:05,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:54:05,096 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 231 transitions. [2025-03-03 22:54:05,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:54:05,096 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 231 transitions. [2025-03-03 22:54:05,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 22:54:05,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:05,097 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, 1, 1] [2025-03-03 22:54:05,108 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 (6)] Ended with exit code 0 [2025-03-03 22:54:05,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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:54:05,298 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:05,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:05,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1245930373, now seen corresponding path program 1 times [2025-03-03 22:54:05,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:54:05,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598137643] [2025-03-03 22:54:05,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:05,299 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:54:05,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:54:05,301 INFO L229 MonitoredProcess]: Starting monitored process 7 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:54:05,302 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 (7)] Waiting until timeout for monitored process [2025-03-03 22:54:05,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 22:54:05,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 22:54:05,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:05,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:05,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 22:54:05,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:54:05,751 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:54:05,751 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:54:05,751 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:54:05,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598137643] [2025-03-03 22:54:05,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1598137643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:54:05,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:54:05,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:54:05,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908683257] [2025-03-03 22:54:05,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:54:05,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:54:05,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:54:05,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:54:05,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:54:05,752 INFO L87 Difference]: Start difference. First operand 160 states and 231 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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:54:06,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:54:06,400 INFO L93 Difference]: Finished difference Result 368 states and 535 transitions. [2025-03-03 22:54:06,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:54:06,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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 169 [2025-03-03 22:54:06,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:54:06,412 INFO L225 Difference]: With dead ends: 368 [2025-03-03 22:54:06,412 INFO L226 Difference]: Without dead ends: 264 [2025-03-03 22:54:06,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:54:06,413 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 39 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 22:54:06,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 261 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 22:54:06,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-03 22:54:06,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2025-03-03 22:54:06,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 178 states have (on average 1.2921348314606742) internal successors, (230), 178 states have internal predecessors, (230), 75 states have call successors, (75), 8 states have call predecessors, (75), 8 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-03 22:54:06,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 380 transitions. [2025-03-03 22:54:06,437 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 380 transitions. Word has length 169 [2025-03-03 22:54:06,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:54:06,437 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 380 transitions. [2025-03-03 22:54:06,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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:54:06,437 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 380 transitions. [2025-03-03 22:54:06,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 22:54:06,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:06,439 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, 1, 1, 1] [2025-03-03 22:54:06,457 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 (7)] Ended with exit code 0 [2025-03-03 22:54:06,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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:54:06,639 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:06,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:06,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1652385862, now seen corresponding path program 1 times [2025-03-03 22:54:06,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:54:06,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634877788] [2025-03-03 22:54:06,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:06,640 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:54:06,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:54:06,642 INFO L229 MonitoredProcess]: Starting monitored process 8 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:54:06,644 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 (8)] Waiting until timeout for monitored process [2025-03-03 22:54:06,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 22:54:06,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 22:54:06,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:06,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:06,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-03 22:54:06,879 INFO L279 TraceCheckSpWp]: Computing forward predicates...