./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 e2fb8bed 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-?-e2fb8be-m [2025-03-08 14:05:23,035 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:05:23,079 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:05:23,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:05:23,087 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:05:23,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:05:23,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:05:23,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:05:23,101 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:05:23,101 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:05:23,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:05:23,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:05:23,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:05:23,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:05:23,102 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:05:23,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:05:23,102 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:05:23,103 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:05:23,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:05:23,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:05:23,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:05:23,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:05:23,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:05:23,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:05:23,104 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:05:23,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:05:23,104 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:05:23,104 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:05:23,105 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:05:23,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:05:23,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:05:23,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:05:23,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:05:23,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:05:23,106 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:05:23,106 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:05:23,106 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:05:23,106 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:05:23,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:05:23,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:05:23,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:05:23,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:05:23,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:05:23,107 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-08 14:05:23,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:05:23,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:05:23,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:05:23,337 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:05:23,337 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:05:23,338 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-08 14:05:24,489 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5669b41b/6322bf0f38954a379a39d5c70b3b0ffb/FLAG55d5d1c93 [2025-03-08 14:05:24,738 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:05:24,739 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-99.i [2025-03-08 14:05:24,745 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5669b41b/6322bf0f38954a379a39d5c70b3b0ffb/FLAG55d5d1c93 [2025-03-08 14:05:25,065 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5669b41b/6322bf0f38954a379a39d5c70b3b0ffb [2025-03-08 14:05:25,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:05:25,068 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:05:25,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:05:25,069 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:05:25,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:05:25,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:05:25" (1/1) ... [2025-03-08 14:05:25,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2abd849d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:25, skipping insertion in model container [2025-03-08 14:05:25,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:05:25" (1/1) ... [2025-03-08 14:05:25,085 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:05:25,184 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-08 14:05:25,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:05:25,283 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:05:25,290 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-08 14:05:25,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:05:25,351 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:05:25,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:25 WrapperNode [2025-03-08 14:05:25,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:05:25,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:05:25,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:05:25,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:05:25,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:25" (1/1) ... [2025-03-08 14:05:25,367 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:25" (1/1) ... [2025-03-08 14:05:25,405 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2025-03-08 14:05:25,406 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:05:25,406 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:05:25,406 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:05:25,406 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:05:25,412 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:25" (1/1) ... [2025-03-08 14:05:25,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:25" (1/1) ... [2025-03-08 14:05:25,415 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:25" (1/1) ... [2025-03-08 14:05:25,439 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-08 14:05:25,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:25" (1/1) ... [2025-03-08 14:05:25,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:25" (1/1) ... [2025-03-08 14:05:25,453 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:25" (1/1) ... [2025-03-08 14:05:25,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:25" (1/1) ... [2025-03-08 14:05:25,460 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:25" (1/1) ... [2025-03-08 14:05:25,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:25" (1/1) ... [2025-03-08 14:05:25,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:05:25,468 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:05:25,468 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:05:25,469 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:05:25,470 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:25" (1/1) ... [2025-03-08 14:05:25,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:05:25,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:05:25,494 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-08 14:05:25,496 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-08 14:05:25,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:05:25,516 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:05:25,516 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:05:25,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:05:25,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:05:25,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:05:25,581 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:05:25,583 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:05:25,948 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-08 14:05:25,949 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:05:25,958 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:05:25,958 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:05:25,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:05:25 BoogieIcfgContainer [2025-03-08 14:05:25,959 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:05:25,961 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:05:25,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:05:25,964 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:05:25,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:05:25" (1/3) ... [2025-03-08 14:05:25,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42491663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:05:25, skipping insertion in model container [2025-03-08 14:05:25,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:25" (2/3) ... [2025-03-08 14:05:25,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42491663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:05:25, skipping insertion in model container [2025-03-08 14:05:25,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:05:25" (3/3) ... [2025-03-08 14:05:25,966 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-99.i [2025-03-08 14:05:25,975 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:05:25,976 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-08 14:05:26,010 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:05:26,016 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;@2250db29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:05:26,017 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:05:26,019 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-08 14:05:26,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 14:05:26,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:05:26,028 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-08 14:05:26,028 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:05:26,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:05:26,031 INFO L85 PathProgramCache]: Analyzing trace with hash -2131778620, now seen corresponding path program 1 times [2025-03-08 14:05:26,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:05:26,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730617749] [2025-03-08 14:05:26,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:26,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:05:26,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 14:05:26,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 14:05:26,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:26,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:26,318 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-08 14:05:26,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:05:26,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730617749] [2025-03-08 14:05:26,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730617749] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:05:26,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600084337] [2025-03-08 14:05:26,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:26,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:05:26,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:05:26,322 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-08 14:05:26,324 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-08 14:05:26,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 14:05:26,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 14:05:26,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:26,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:26,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:05:26,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:05:26,506 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-08 14:05:26,506 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:05:26,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600084337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:05:26,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:05:26,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:05:26,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054272518] [2025-03-08 14:05:26,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:05:26,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:05:26,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:05:26,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:05:26,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:05:26,524 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-08 14:05:26,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:05:26,548 INFO L93 Difference]: Finished difference Result 173 states and 298 transitions. [2025-03-08 14:05:26,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:05:26,549 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-08 14:05:26,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:05:26,554 INFO L225 Difference]: With dead ends: 173 [2025-03-08 14:05:26,555 INFO L226 Difference]: Without dead ends: 85 [2025-03-08 14:05:26,557 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-08 14:05:26,559 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-08 14:05:26,559 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-08 14:05:26,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-08 14:05:26,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-08 14:05:26,582 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-08 14:05:26,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 132 transitions. [2025-03-08 14:05:26,586 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 132 transitions. Word has length 165 [2025-03-08 14:05:26,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:05:26,587 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 132 transitions. [2025-03-08 14:05:26,587 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-08 14:05:26,587 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 132 transitions. [2025-03-08 14:05:26,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 14:05:26,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:05:26,589 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-08 14:05:26,597 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-08 14:05:26,790 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-08 14:05:26,790 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:05:26,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:05:26,791 INFO L85 PathProgramCache]: Analyzing trace with hash 2117002909, now seen corresponding path program 1 times [2025-03-08 14:05:26,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:05:26,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682072538] [2025-03-08 14:05:26,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:26,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:05:26,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 14:05:26,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 14:05:26,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:26,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:27,163 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-08 14:05:27,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:05:27,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682072538] [2025-03-08 14:05:27,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682072538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:05:27,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:05:27,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:05:27,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042937829] [2025-03-08 14:05:27,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:05:27,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:05:27,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:05:27,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:05:27,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:05:27,167 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-08 14:05:27,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:05:27,212 INFO L93 Difference]: Finished difference Result 249 states and 390 transitions. [2025-03-08 14:05:27,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:05:27,213 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-08 14:05:27,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:05:27,217 INFO L225 Difference]: With dead ends: 249 [2025-03-08 14:05:27,217 INFO L226 Difference]: Without dead ends: 167 [2025-03-08 14:05:27,218 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-08 14:05:27,220 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-08 14:05:27,220 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-08 14:05:27,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-08 14:05:27,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2025-03-08 14:05:27,242 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-08 14:05:27,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 258 transitions. [2025-03-08 14:05:27,246 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 258 transitions. Word has length 166 [2025-03-08 14:05:27,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:05:27,246 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 258 transitions. [2025-03-08 14:05:27,247 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-08 14:05:27,247 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 258 transitions. [2025-03-08 14:05:27,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 14:05:27,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:05:27,250 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-08 14:05:27,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:05:27,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:05:27,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:05:27,251 INFO L85 PathProgramCache]: Analyzing trace with hash -418941022, now seen corresponding path program 1 times [2025-03-08 14:05:27,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:05:27,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491240239] [2025-03-08 14:05:27,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:27,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:05:27,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 14:05:27,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 14:05:27,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:27,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:27,668 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-08 14:05:27,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:05:27,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491240239] [2025-03-08 14:05:27,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491240239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:05:27,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:05:27,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 14:05:27,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124105562] [2025-03-08 14:05:27,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:05:27,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 14:05:27,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:05:27,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 14:05:27,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:05:27,671 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-08 14:05:27,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:05:27,924 INFO L93 Difference]: Finished difference Result 432 states and 676 transitions. [2025-03-08 14:05:27,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 14:05:27,925 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-08 14:05:27,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:05:27,928 INFO L225 Difference]: With dead ends: 432 [2025-03-08 14:05:27,928 INFO L226 Difference]: Without dead ends: 270 [2025-03-08 14:05:27,932 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-08 14:05:27,932 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-08 14:05:27,932 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-08 14:05:27,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-08 14:05:27,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 212. [2025-03-08 14:05:27,963 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-08 14:05:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 329 transitions. [2025-03-08 14:05:27,969 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 329 transitions. Word has length 167 [2025-03-08 14:05:27,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:05:27,970 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 329 transitions. [2025-03-08 14:05:27,970 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-08 14:05:27,970 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 329 transitions. [2025-03-08 14:05:27,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 14:05:27,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:05:27,974 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-08 14:05:27,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 14:05:27,974 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:05:27,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:05:27,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1816891301, now seen corresponding path program 1 times [2025-03-08 14:05:27,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:05:27,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998425391] [2025-03-08 14:05:27,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:27,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:05:27,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 14:05:28,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 14:05:28,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:28,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:28,129 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-08 14:05:28,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:05:28,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998425391] [2025-03-08 14:05:28,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998425391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:05:28,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:05:28,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 14:05:28,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258491567] [2025-03-08 14:05:28,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:05:28,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 14:05:28,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:05:28,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 14:05:28,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:05:28,132 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-08 14:05:28,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:05:28,299 INFO L93 Difference]: Finished difference Result 432 states and 675 transitions. [2025-03-08 14:05:28,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 14:05:28,300 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-08 14:05:28,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:05:28,302 INFO L225 Difference]: With dead ends: 432 [2025-03-08 14:05:28,302 INFO L226 Difference]: Without dead ends: 270 [2025-03-08 14:05:28,303 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-08 14:05:28,303 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-08 14:05:28,303 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-08 14:05:28,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-08 14:05:28,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 213. [2025-03-08 14:05:28,333 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-08 14:05:28,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 330 transitions. [2025-03-08 14:05:28,335 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 330 transitions. Word has length 168 [2025-03-08 14:05:28,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:05:28,336 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 330 transitions. [2025-03-08 14:05:28,336 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-08 14:05:28,337 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 330 transitions. [2025-03-08 14:05:28,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 14:05:28,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:05:28,340 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-08 14:05:28,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 14:05:28,340 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:05:28,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:05:28,342 INFO L85 PathProgramCache]: Analyzing trace with hash 66997254, now seen corresponding path program 1 times [2025-03-08 14:05:28,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:05:28,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130149354] [2025-03-08 14:05:28,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:28,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:05:28,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 14:05:28,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 14:05:28,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:28,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:28,699 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-08 14:05:28,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:05:28,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130149354] [2025-03-08 14:05:28,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130149354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:05:28,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:05:28,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 14:05:28,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662468985] [2025-03-08 14:05:28,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:05:28,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 14:05:28,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:05:28,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 14:05:28,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:05:28,702 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-08 14:05:28,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:05:28,898 INFO L93 Difference]: Finished difference Result 432 states and 674 transitions. [2025-03-08 14:05:28,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 14:05:28,899 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-08 14:05:28,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:05:28,900 INFO L225 Difference]: With dead ends: 432 [2025-03-08 14:05:28,901 INFO L226 Difference]: Without dead ends: 270 [2025-03-08 14:05:28,901 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-08 14:05:28,902 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:05:28,902 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.1s Time] [2025-03-08 14:05:28,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-08 14:05:28,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 214. [2025-03-08 14:05:28,941 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-08 14:05:28,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 331 transitions. [2025-03-08 14:05:28,943 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 331 transitions. Word has length 169 [2025-03-08 14:05:28,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:05:28,943 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 331 transitions. [2025-03-08 14:05:28,943 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-08 14:05:28,944 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 331 transitions. [2025-03-08 14:05:28,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 14:05:28,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:05:28,946 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-08 14:05:28,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 14:05:28,946 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:05:28,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:05:28,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1971059035, now seen corresponding path program 1 times [2025-03-08 14:05:28,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:05:28,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44004589] [2025-03-08 14:05:28,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:28,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:05:28,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 14:05:29,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 14:05:29,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:29,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:29,163 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-08 14:05:29,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:05:29,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44004589] [2025-03-08 14:05:29,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44004589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:05:29,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:05:29,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:05:29,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929581861] [2025-03-08 14:05:29,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:05:29,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:05:29,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:05:29,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:05:29,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:05:29,166 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-08 14:05:29,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:05:29,234 INFO L93 Difference]: Finished difference Result 410 states and 636 transitions. [2025-03-08 14:05:29,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:05:29,237 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-08 14:05:29,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:05:29,239 INFO L225 Difference]: With dead ends: 410 [2025-03-08 14:05:29,239 INFO L226 Difference]: Without dead ends: 248 [2025-03-08 14:05:29,240 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-08 14:05:29,241 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-08 14:05:29,242 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-08 14:05:29,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-08 14:05:29,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 214. [2025-03-08 14:05:29,262 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-08 14:05:29,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 329 transitions. [2025-03-08 14:05:29,264 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 329 transitions. Word has length 169 [2025-03-08 14:05:29,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:05:29,264 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 329 transitions. [2025-03-08 14:05:29,264 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-08 14:05:29,264 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 329 transitions. [2025-03-08 14:05:29,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 14:05:29,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:05:29,266 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-08 14:05:29,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 14:05:29,266 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:05:29,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:05:29,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1652385862, now seen corresponding path program 1 times [2025-03-08 14:05:29,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:05:29,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776020500] [2025-03-08 14:05:29,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:29,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:05:29,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 14:05:29,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 14:05:29,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:29,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:05:29,351 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:05:29,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 14:05:29,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 14:05:29,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:29,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:05:29,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:05:29,473 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:05:29,474 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:05:29,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 14:05:29,479 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:05:29,588 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:05:29,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:05:29 BoogieIcfgContainer [2025-03-08 14:05:29,591 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:05:29,591 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:05:29,591 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:05:29,591 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:05:29,592 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:05:25" (3/4) ... [2025-03-08 14:05:29,594 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:05:29,595 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:05:29,595 INFO L158 Benchmark]: Toolchain (without parser) took 4527.79ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 122.7MB in the beginning and 147.3MB in the end (delta: -24.7MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2025-03-08 14:05:29,596 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:05:29,596 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.96ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 105.2MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:05:29,596 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.72ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 99.6MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:05:29,597 INFO L158 Benchmark]: Boogie Preprocessor took 61.16ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 88.8MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:05:29,597 INFO L158 Benchmark]: IcfgBuilder took 491.04ms. Allocated memory is still 167.8MB. Free memory was 88.8MB in the beginning and 56.7MB in the end (delta: 32.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 14:05:29,597 INFO L158 Benchmark]: TraceAbstraction took 3629.97ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 56.3MB in the beginning and 147.4MB in the end (delta: -91.1MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2025-03-08 14:05:29,597 INFO L158 Benchmark]: Witness Printer took 3.84ms. Allocated memory is still 201.3MB. Free memory was 147.4MB in the beginning and 147.3MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:05:29,598 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.29ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.96ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 105.2MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.72ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 99.6MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.16ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 88.8MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 491.04ms. Allocated memory is still 167.8MB. Free memory was 88.8MB in the beginning and 56.7MB in the end (delta: 32.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3629.97ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 56.3MB in the beginning and 147.4MB in the end (delta: -91.1MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. * Witness Printer took 3.84ms. Allocated memory is still 201.3MB. Free memory was 147.4MB in the beginning and 147.3MB in the end (delta: 60.0kB). 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 184, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 215, overapproximation of someBinaryFLOATComparisonOperation at line 190, overapproximation of someBinaryFLOATComparisonOperation at line 186, overapproximation of someBinaryFLOATComparisonOperation at line 182, overapproximation of someBinaryFLOATComparisonOperation at line 188. 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, 163 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, 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.2s 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.4s SatisfiabilityAnalysisTime, 1.4s 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-08 14:05:29,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-?-e2fb8be-m [2025-03-08 14:05:31,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:05:31,455 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:05:31,469 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:05:31,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:05:31,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:05:31,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:05:31,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:05:31,492 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:05:31,492 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:05:31,492 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:05:31,492 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:05:31,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:05:31,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:05:31,493 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:05:31,493 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:05:31,493 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:05:31,493 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:05:31,493 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:05:31,493 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:05:31,493 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:05:31,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:05:31,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:05:31,493 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:05:31,493 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:05:31,493 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:05:31,493 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:05:31,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:05:31,495 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:05:31,495 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:05:31,496 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:05:31,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:05:31,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:05:31,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:05:31,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:05:31,496 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:05:31,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:05:31,496 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:05:31,497 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:05:31,497 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:05:31,497 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:05:31,497 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:05:31,497 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:05:31,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:05:31,497 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:05:31,497 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-08 14:05:31,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:05:31,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:05:31,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:05:31,716 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:05:31,716 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:05:31,718 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-08 14:05:32,853 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33b0f2d14/f0b07ac607234ad8b2d4c0e727cf7256/FLAG7a05b35e1 [2025-03-08 14:05:33,068 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:05:33,073 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-99.i [2025-03-08 14:05:33,085 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33b0f2d14/f0b07ac607234ad8b2d4c0e727cf7256/FLAG7a05b35e1 [2025-03-08 14:05:33,419 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33b0f2d14/f0b07ac607234ad8b2d4c0e727cf7256 [2025-03-08 14:05:33,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:05:33,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:05:33,423 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:05:33,423 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:05:33,426 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:05:33,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:05:33" (1/1) ... [2025-03-08 14:05:33,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46ce2247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:33, skipping insertion in model container [2025-03-08 14:05:33,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:05:33" (1/1) ... [2025-03-08 14:05:33,440 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:05:33,537 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-08 14:05:33,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:05:33,620 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:05:33,627 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-08 14:05:33,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:05:33,667 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:05:33,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:33 WrapperNode [2025-03-08 14:05:33,668 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:05:33,669 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:05:33,669 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:05:33,669 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:05:33,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:33" (1/1) ... [2025-03-08 14:05:33,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:33" (1/1) ... [2025-03-08 14:05:33,703 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2025-03-08 14:05:33,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:05:33,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:05:33,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:05:33,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:05:33,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:33" (1/1) ... [2025-03-08 14:05:33,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:33" (1/1) ... [2025-03-08 14:05:33,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:33" (1/1) ... [2025-03-08 14:05:33,726 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-08 14:05:33,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:33" (1/1) ... [2025-03-08 14:05:33,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:33" (1/1) ... [2025-03-08 14:05:33,735 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:33" (1/1) ... [2025-03-08 14:05:33,736 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:33" (1/1) ... [2025-03-08 14:05:33,737 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:33" (1/1) ... [2025-03-08 14:05:33,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:33" (1/1) ... [2025-03-08 14:05:33,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:05:33,741 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:05:33,741 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:05:33,741 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:05:33,742 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:33" (1/1) ... [2025-03-08 14:05:33,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:05:33,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:05:33,767 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-08 14:05:33,771 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-08 14:05:33,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:05:33,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:05:33,790 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:05:33,790 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:05:33,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:05:33,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:05:33,871 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:05:33,873 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:05:34,694 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-08 14:05:34,694 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:05:34,703 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:05:34,703 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:05:34,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:05:34 BoogieIcfgContainer [2025-03-08 14:05:34,704 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:05:34,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:05:34,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:05:34,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:05:34,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:05:33" (1/3) ... [2025-03-08 14:05:34,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7523bad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:05:34, skipping insertion in model container [2025-03-08 14:05:34,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:33" (2/3) ... [2025-03-08 14:05:34,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7523bad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:05:34, skipping insertion in model container [2025-03-08 14:05:34,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:05:34" (3/3) ... [2025-03-08 14:05:34,710 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-99.i [2025-03-08 14:05:34,719 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:05:34,720 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-08 14:05:34,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:05:34,762 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;@7f014682, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:05:34,764 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:05:34,766 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-08 14:05:34,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 14:05:34,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:05:34,774 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-08 14:05:34,774 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:05:34,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:05:34,777 INFO L85 PathProgramCache]: Analyzing trace with hash -2131778620, now seen corresponding path program 1 times [2025-03-08 14:05:34,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:05:34,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014858585] [2025-03-08 14:05:34,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:34,787 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-08 14:05:34,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:05:34,789 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-08 14:05:34,791 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-08 14:05:34,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 14:05:35,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 14:05:35,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:35,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:35,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:05:35,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:05:35,140 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-08 14:05:35,140 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:05:35,141 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:05:35,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014858585] [2025-03-08 14:05:35,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1014858585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:05:35,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:05:35,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:05:35,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469516406] [2025-03-08 14:05:35,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:05:35,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:05:35,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:05:35,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:05:35,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:05:35,161 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-08 14:05:35,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:05:35,181 INFO L93 Difference]: Finished difference Result 173 states and 298 transitions. [2025-03-08 14:05:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:05:35,183 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-08 14:05:35,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:05:35,190 INFO L225 Difference]: With dead ends: 173 [2025-03-08 14:05:35,191 INFO L226 Difference]: Without dead ends: 85 [2025-03-08 14:05:35,195 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-08 14:05:35,198 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-08 14:05:35,200 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-08 14:05:35,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-08 14:05:35,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-08 14:05:35,228 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-08 14:05:35,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 132 transitions. [2025-03-08 14:05:35,234 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 132 transitions. Word has length 165 [2025-03-08 14:05:35,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:05:35,234 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 132 transitions. [2025-03-08 14:05:35,234 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-08 14:05:35,234 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 132 transitions. [2025-03-08 14:05:35,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 14:05:35,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:05:35,237 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-08 14:05:35,246 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-08 14:05:35,437 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-08 14:05:35,438 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:05:35,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:05:35,438 INFO L85 PathProgramCache]: Analyzing trace with hash 2117002909, now seen corresponding path program 1 times [2025-03-08 14:05:35,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:05:35,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159275815] [2025-03-08 14:05:35,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:35,439 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-08 14:05:35,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:05:35,442 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-08 14:05:35,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 14:05:35,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 14:05:35,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 14:05:35,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:35,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:35,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 14:05:35,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:05:36,669 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-08 14:05:36,669 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:05:36,670 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:05:36,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159275815] [2025-03-08 14:05:36,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159275815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:05:36,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:05:36,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:05:36,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022058043] [2025-03-08 14:05:36,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:05:36,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 14:05:36,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:05:36,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 14:05:36,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:05:36,672 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-08 14:05:38,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:05:38,018 INFO L93 Difference]: Finished difference Result 250 states and 391 transitions. [2025-03-08 14:05:38,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 14:05:38,029 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-08 14:05:38,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:05:38,031 INFO L225 Difference]: With dead ends: 250 [2025-03-08 14:05:38,031 INFO L226 Difference]: Without dead ends: 168 [2025-03-08 14:05:38,032 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-08 14:05:38,032 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 99 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 14:05:38,033 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.3s Time] [2025-03-08 14:05:38,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-08 14:05:38,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 132. [2025-03-08 14:05:38,052 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-08 14:05:38,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 203 transitions. [2025-03-08 14:05:38,053 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 203 transitions. Word has length 166 [2025-03-08 14:05:38,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:05:38,054 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 203 transitions. [2025-03-08 14:05:38,054 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-08 14:05:38,054 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 203 transitions. [2025-03-08 14:05:38,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 14:05:38,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:05:38,056 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-08 14:05:38,065 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-08 14:05:38,256 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-08 14:05:38,256 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:05:38,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:05:38,257 INFO L85 PathProgramCache]: Analyzing trace with hash -837586236, now seen corresponding path program 1 times [2025-03-08 14:05:38,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:05:38,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497404370] [2025-03-08 14:05:38,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:38,260 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-08 14:05:38,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:05:38,262 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-08 14:05:38,263 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-08 14:05:38,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 14:05:38,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 14:05:38,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:38,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:38,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 14:05:38,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:05:38,764 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-08 14:05:38,764 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:05:38,764 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:05:38,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497404370] [2025-03-08 14:05:38,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [497404370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:05:38,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:05:38,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:05:38,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656501351] [2025-03-08 14:05:38,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:05:38,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 14:05:38,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:05:38,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 14:05:38,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:05:38,767 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-08 14:05:39,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:05:39,861 INFO L93 Difference]: Finished difference Result 250 states and 390 transitions. [2025-03-08 14:05:39,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 14:05:39,871 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-08 14:05:39,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:05:39,873 INFO L225 Difference]: With dead ends: 250 [2025-03-08 14:05:39,873 INFO L226 Difference]: Without dead ends: 168 [2025-03-08 14:05:39,873 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-08 14:05:39,874 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 97 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:05:39,874 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.1s Time] [2025-03-08 14:05:39,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-08 14:05:39,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 133. [2025-03-08 14:05:39,903 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-08 14:05:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 204 transitions. [2025-03-08 14:05:39,904 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 204 transitions. Word has length 167 [2025-03-08 14:05:39,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:05:39,905 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 204 transitions. [2025-03-08 14:05:39,905 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-08 14:05:39,905 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 204 transitions. [2025-03-08 14:05:39,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 14:05:39,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:05:39,907 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-08 14:05:39,917 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-08 14:05:40,113 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-08 14:05:40,113 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:05:40,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:05:40,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1855583673, now seen corresponding path program 1 times [2025-03-08 14:05:40,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:05:40,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605832464] [2025-03-08 14:05:40,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:40,114 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-08 14:05:40,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:05:40,118 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-08 14:05:40,119 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-08 14:05:40,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 14:05:40,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 14:05:40,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:40,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:40,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 14:05:40,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:05:40,940 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-08 14:05:40,940 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:05:40,940 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:05:40,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605832464] [2025-03-08 14:05:40,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1605832464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:05:40,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:05:40,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:05:40,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382627376] [2025-03-08 14:05:40,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:05:40,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 14:05:40,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:05:40,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 14:05:40,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:05:40,943 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-08 14:05:42,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:05:42,295 INFO L93 Difference]: Finished difference Result 250 states and 389 transitions. [2025-03-08 14:05:42,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 14:05:42,306 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-08 14:05:42,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:05:42,309 INFO L225 Difference]: With dead ends: 250 [2025-03-08 14:05:42,309 INFO L226 Difference]: Without dead ends: 168 [2025-03-08 14:05:42,310 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-08 14:05:42,310 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 14:05:42,311 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.3s Time] [2025-03-08 14:05:42,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-08 14:05:42,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 134. [2025-03-08 14:05:42,328 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-08 14:05:42,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 205 transitions. [2025-03-08 14:05:42,329 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 205 transitions. Word has length 168 [2025-03-08 14:05:42,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:05:42,330 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 205 transitions. [2025-03-08 14:05:42,330 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-08 14:05:42,330 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 205 transitions. [2025-03-08 14:05:42,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 14:05:42,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:05:42,331 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-08 14:05:42,348 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-08 14:05:42,536 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-08 14:05:42,536 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:05:42,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:05:42,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2066934586, now seen corresponding path program 1 times [2025-03-08 14:05:42,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:05:42,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090524905] [2025-03-08 14:05:42,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:42,537 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-08 14:05:42,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:05:42,539 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-08 14:05:42,541 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-08 14:05:42,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 14:05:42,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 14:05:42,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:42,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:42,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 14:05:42,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:05:42,935 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-08 14:05:42,935 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:05:42,935 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:05:42,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090524905] [2025-03-08 14:05:42,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090524905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:05:42,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:05:42,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 14:05:42,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893674296] [2025-03-08 14:05:42,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:05:42,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 14:05:42,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:05:42,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 14:05:42,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-08 14:05:42,936 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-08 14:05:44,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:05:44,484 INFO L93 Difference]: Finished difference Result 319 states and 474 transitions. [2025-03-08 14:05:44,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 14:05:44,484 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-08 14:05:44,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:05:44,486 INFO L225 Difference]: With dead ends: 319 [2025-03-08 14:05:44,486 INFO L226 Difference]: Without dead ends: 237 [2025-03-08 14:05:44,487 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-08 14:05:44,487 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-08 14:05:44,488 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-08 14:05:44,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-08 14:05:44,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 160. [2025-03-08 14:05:44,509 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-08 14:05:44,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 231 transitions. [2025-03-08 14:05:44,510 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 231 transitions. Word has length 168 [2025-03-08 14:05:44,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:05:44,511 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 231 transitions. [2025-03-08 14:05:44,511 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-08 14:05:44,511 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 231 transitions. [2025-03-08 14:05:44,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 14:05:44,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:05:44,512 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-08 14:05:44,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2025-03-08 14:05:44,713 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-08 14:05:44,713 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:05:44,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:05:44,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1245930373, now seen corresponding path program 1 times [2025-03-08 14:05:44,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:05:44,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818057088] [2025-03-08 14:05:44,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:44,714 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-08 14:05:44,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:05:44,716 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-08 14:05:44,717 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-08 14:05:44,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 14:05:44,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 14:05:44,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:44,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:44,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 14:05:44,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:05:45,171 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-08 14:05:45,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:05:45,171 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:05:45,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818057088] [2025-03-08 14:05:45,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818057088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:05:45,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:05:45,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:05:45,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618792980] [2025-03-08 14:05:45,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:05:45,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:05:45,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:05:45,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:05:45,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:05:45,172 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-08 14:05:45,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:05:45,720 INFO L93 Difference]: Finished difference Result 368 states and 535 transitions. [2025-03-08 14:05:45,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:05:45,730 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-08 14:05:45,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:05:45,733 INFO L225 Difference]: With dead ends: 368 [2025-03-08 14:05:45,733 INFO L226 Difference]: Without dead ends: 264 [2025-03-08 14:05:45,734 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-08 14:05:45,735 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 39 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2025-03-08 14:05:45,736 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.5s Time] [2025-03-08 14:05:45,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-08 14:05:45,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2025-03-08 14:05:45,758 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-08 14:05:45,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 380 transitions. [2025-03-08 14:05:45,760 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 380 transitions. Word has length 169 [2025-03-08 14:05:45,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:05:45,760 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 380 transitions. [2025-03-08 14:05:45,760 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-08 14:05:45,760 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 380 transitions. [2025-03-08 14:05:45,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 14:05:45,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:05:45,762 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-08 14:05:45,771 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-08 14:05:45,962 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-08 14:05:45,963 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:05:45,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:05:45,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1652385862, now seen corresponding path program 1 times [2025-03-08 14:05:45,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:05:45,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779156792] [2025-03-08 14:05:45,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:45,965 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-08 14:05:45,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:05:45,967 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-08 14:05:45,967 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-08 14:05:45,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 14:05:46,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 14:05:46,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:46,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:46,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-08 14:05:46,199 INFO L279 TraceCheckSpWp]: Computing forward predicates...