./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-99.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_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 d1f2fd33e5d2eefab538c8e9509f9026512706d91745f186ee11fd8135485551 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:05:40,160 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:05:40,211 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:05:40,216 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:05:40,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:05:40,236 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:05:40,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:05:40,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:05:40,238 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:05:40,238 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:05:40,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:05:40,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:05:40,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:05:40,239 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:05:40,240 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:05:40,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:05:40,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:05:40,240 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:05:40,240 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:05:40,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:05:40,240 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:05:40,240 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:05:40,240 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:05:40,240 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:05:40,241 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:05:40,241 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:05:40,241 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:05:40,241 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:05:40,241 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:05:40,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:05:40,241 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:05:40,241 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:05:40,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:05:40,241 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:05:40,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:05:40,242 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:05:40,242 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:05:40,242 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:05:40,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:05:40,242 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:05:40,242 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:05:40,242 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:05:40,242 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:05:40,242 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 -> d1f2fd33e5d2eefab538c8e9509f9026512706d91745f186ee11fd8135485551 [2025-03-03 23:05:40,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:05:40,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:05:40,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:05:40,484 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:05:40,485 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:05:40,486 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-99.i [2025-03-03 23:05:41,642 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e59697a19/a2409b3e99214733a20d151ac861ff18/FLAG32eadd113 [2025-03-03 23:05:41,905 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:05:41,906 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-99.i [2025-03-03 23:05:41,913 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e59697a19/a2409b3e99214733a20d151ac861ff18/FLAG32eadd113 [2025-03-03 23:05:42,204 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e59697a19/a2409b3e99214733a20d151ac861ff18 [2025-03-03 23:05:42,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:05:42,210 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:05:42,211 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:05:42,212 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:05:42,215 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:05:42,216 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:05:42" (1/1) ... [2025-03-03 23:05:42,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eef1065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:42, skipping insertion in model container [2025-03-03 23:05:42,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:05:42" (1/1) ... [2025-03-03 23:05:42,237 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:05:42,340 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-while_file-99.i[916,929] [2025-03-03 23:05:42,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:05:42,414 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:05:42,421 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-while_file-99.i[916,929] [2025-03-03 23:05:42,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:05:42,467 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:05:42,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:42 WrapperNode [2025-03-03 23:05:42,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:05:42,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:05:42,468 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:05:42,468 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:05:42,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:42" (1/1) ... [2025-03-03 23:05:42,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:42" (1/1) ... [2025-03-03 23:05:42,533 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2025-03-03 23:05:42,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:05:42,534 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:05:42,534 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:05:42,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:05:42,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:42" (1/1) ... [2025-03-03 23:05:42,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:42" (1/1) ... [2025-03-03 23:05:42,544 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:42" (1/1) ... [2025-03-03 23:05:42,565 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:05:42,567 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:42" (1/1) ... [2025-03-03 23:05:42,567 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:42" (1/1) ... [2025-03-03 23:05:42,580 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:42" (1/1) ... [2025-03-03 23:05:42,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:42" (1/1) ... [2025-03-03 23:05:42,584 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:42" (1/1) ... [2025-03-03 23:05:42,585 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:42" (1/1) ... [2025-03-03 23:05:42,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:05:42,594 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:05:42,595 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:05:42,595 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:05:42,596 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:42" (1/1) ... [2025-03-03 23:05:42,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:05:42,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:05:42,625 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:05:42,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:05:42,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:05:42,645 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:05:42,645 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:05:42,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:05:42,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:05:42,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:05:42,714 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:05:42,716 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:05:43,152 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-03 23:05:43,153 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:05:43,163 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:05:43,164 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:05:43,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:05:43 BoogieIcfgContainer [2025-03-03 23:05:43,164 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:05:43,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:05:43,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:05:43,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:05:43,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:05:42" (1/3) ... [2025-03-03 23:05:43,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b00d21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:05:43, skipping insertion in model container [2025-03-03 23:05:43,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:42" (2/3) ... [2025-03-03 23:05:43,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b00d21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:05:43, skipping insertion in model container [2025-03-03 23:05:43,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:05:43" (3/3) ... [2025-03-03 23:05:43,171 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-99.i [2025-03-03 23:05:43,182 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:05:43,185 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-99.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:05:43,226 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:05:43,244 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;@31438d3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:05:43,245 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:05:43,248 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 23:05:43,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 23:05:43,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:05:43,259 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:05:43,259 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:05:43,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:05:43,264 INFO L85 PathProgramCache]: Analyzing trace with hash -2131778620, now seen corresponding path program 1 times [2025-03-03 23:05:43,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:05:43,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9099179] [2025-03-03 23:05:43,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:43,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:05:43,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 23:05:43,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 23:05:43,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:43,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:43,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-03 23:05:43,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:05:43,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9099179] [2025-03-03 23:05:43,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9099179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:05:43,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355086612] [2025-03-03 23:05:43,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:43,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:05:43,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:05:43,551 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:05:43,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 23:05:43,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 23:05:43,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 23:05:43,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:43,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:43,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:05:43,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:05:43,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-03 23:05:43,731 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:05:43,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355086612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:05:43,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:05:43,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:05:43,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723416382] [2025-03-03 23:05:43,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:05:43,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:05:43,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:05:43,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:05:43,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:05:43,752 INFO L87 Difference]: Start difference. First operand has 88 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 23:05:43,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:05:43,769 INFO L93 Difference]: Finished difference Result 170 states and 296 transitions. [2025-03-03 23:05:43,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:05:43,771 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 165 [2025-03-03 23:05:43,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:05:43,775 INFO L225 Difference]: With dead ends: 170 [2025-03-03 23:05:43,775 INFO L226 Difference]: Without dead ends: 85 [2025-03-03 23:05:43,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:05:43,778 INFO L435 NwaCegarLoop]: 132 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, 132 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:05:43,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:05:43,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-03 23:05:43,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-03 23:05:43,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 58 states have internal predecessors, (82), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 23:05:43,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 132 transitions. [2025-03-03 23:05:43,813 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 132 transitions. Word has length 165 [2025-03-03 23:05:43,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:05:43,813 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 132 transitions. [2025-03-03 23:05:43,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 23:05:43,813 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 132 transitions. [2025-03-03 23:05:43,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 23:05:43,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:05:43,815 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:05:43,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 23:05:44,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 23:05:44,020 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:05:44,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:05:44,021 INFO L85 PathProgramCache]: Analyzing trace with hash 2117002909, now seen corresponding path program 1 times [2025-03-03 23:05:44,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:05:44,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111132880] [2025-03-03 23:05:44,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:44,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:05:44,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 23:05:44,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 23:05:44,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:44,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:44,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 23:05:44,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:05:44,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111132880] [2025-03-03 23:05:44,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111132880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:05:44,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:05:44,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:05:44,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769535287] [2025-03-03 23:05:44,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:05:44,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:05:44,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:05:44,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:05:44,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:05:44,402 INFO L87 Difference]: Start difference. First operand 85 states and 132 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 23:05:44,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:05:44,447 INFO L93 Difference]: Finished difference Result 249 states and 390 transitions. [2025-03-03 23:05:44,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:05:44,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 166 [2025-03-03 23:05:44,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:05:44,450 INFO L225 Difference]: With dead ends: 249 [2025-03-03 23:05:44,450 INFO L226 Difference]: Without dead ends: 167 [2025-03-03 23:05:44,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:05:44,451 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 70 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:05:44,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 258 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:05:44,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-03 23:05:44,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2025-03-03 23:05:44,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 112 states have (on average 1.4107142857142858) internal successors, (158), 112 states have internal predecessors, (158), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 23:05:44,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 258 transitions. [2025-03-03 23:05:44,481 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 258 transitions. Word has length 166 [2025-03-03 23:05:44,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:05:44,482 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 258 transitions. [2025-03-03 23:05:44,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 23:05:44,482 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 258 transitions. [2025-03-03 23:05:44,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 23:05:44,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:05:44,484 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:05:44,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:05:44,485 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:05:44,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:05:44,485 INFO L85 PathProgramCache]: Analyzing trace with hash -418941022, now seen corresponding path program 1 times [2025-03-03 23:05:44,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:05:44,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898272817] [2025-03-03 23:05:44,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:44,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:05:44,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 23:05:44,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 23:05:44,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:44,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:44,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 23:05:44,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:05:44,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898272817] [2025-03-03 23:05:44,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898272817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:05:44,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:05:44,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:05:44,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299324049] [2025-03-03 23:05:44,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:05:44,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:05:44,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:05:44,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:05:44,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:05:44,958 INFO L87 Difference]: Start difference. First operand 165 states and 258 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 23:05:45,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:05:45,214 INFO L93 Difference]: Finished difference Result 432 states and 676 transitions. [2025-03-03 23:05:45,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:05:45,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2025-03-03 23:05:45,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:05:45,217 INFO L225 Difference]: With dead ends: 432 [2025-03-03 23:05:45,219 INFO L226 Difference]: Without dead ends: 270 [2025-03-03 23:05:45,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:05:45,220 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 102 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:05:45,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 448 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:05:45,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-03 23:05:45,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 212. [2025-03-03 23:05:45,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 133 states have (on average 1.3458646616541354) internal successors, (179), 133 states have internal predecessors, (179), 75 states have call successors, (75), 3 states have call predecessors, (75), 3 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-03 23:05:45,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 329 transitions. [2025-03-03 23:05:45,268 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 329 transitions. Word has length 167 [2025-03-03 23:05:45,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:05:45,268 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 329 transitions. [2025-03-03 23:05:45,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 23:05:45,269 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 329 transitions. [2025-03-03 23:05:45,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 23:05:45,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:05:45,270 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:05:45,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:05:45,270 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:05:45,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:05:45,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1816891301, now seen corresponding path program 1 times [2025-03-03 23:05:45,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:05:45,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103849546] [2025-03-03 23:05:45,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:45,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:05:45,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 23:05:45,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 23:05:45,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:45,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:45,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 23:05:45,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:05:45,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103849546] [2025-03-03 23:05:45,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103849546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:05:45,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:05:45,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:05:45,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911603033] [2025-03-03 23:05:45,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:05:45,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:05:45,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:05:45,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:05:45,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:05:45,445 INFO L87 Difference]: Start difference. First operand 212 states and 329 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 23:05:45,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:05:45,583 INFO L93 Difference]: Finished difference Result 432 states and 675 transitions. [2025-03-03 23:05:45,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:05:45,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 168 [2025-03-03 23:05:45,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:05:45,586 INFO L225 Difference]: With dead ends: 432 [2025-03-03 23:05:45,586 INFO L226 Difference]: Without dead ends: 270 [2025-03-03 23:05:45,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:05:45,588 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 100 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:05:45,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 503 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:05:45,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-03 23:05:45,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 213. [2025-03-03 23:05:45,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 134 states have (on average 1.3432835820895523) internal successors, (180), 134 states have internal predecessors, (180), 75 states have call successors, (75), 3 states have call predecessors, (75), 3 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-03 23:05:45,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 330 transitions. [2025-03-03 23:05:45,622 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 330 transitions. Word has length 168 [2025-03-03 23:05:45,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:05:45,623 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 330 transitions. [2025-03-03 23:05:45,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 23:05:45,623 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 330 transitions. [2025-03-03 23:05:45,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 23:05:45,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:05:45,625 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:05:45,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 23:05:45,625 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:05:45,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:05:45,626 INFO L85 PathProgramCache]: Analyzing trace with hash 66997254, now seen corresponding path program 1 times [2025-03-03 23:05:45,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:05:45,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52548216] [2025-03-03 23:05:45,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:45,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:05:45,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 23:05:45,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 23:05:45,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:45,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:46,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 23:05:46,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:05:46,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52548216] [2025-03-03 23:05:46,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52548216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:05:46,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:05:46,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:05:46,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390163009] [2025-03-03 23:05:46,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:05:46,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:05:46,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:05:46,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:05:46,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:05:46,066 INFO L87 Difference]: Start difference. First operand 213 states and 330 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 23:05:46,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:05:46,281 INFO L93 Difference]: Finished difference Result 432 states and 674 transitions. [2025-03-03 23:05:46,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:05:46,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 169 [2025-03-03 23:05:46,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:05:46,283 INFO L225 Difference]: With dead ends: 432 [2025-03-03 23:05:46,283 INFO L226 Difference]: Without dead ends: 270 [2025-03-03 23:05:46,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:05:46,286 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 84 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:05:46,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 436 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:05:46,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-03 23:05:46,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 214. [2025-03-03 23:05:46,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 135 states have (on average 1.3407407407407408) internal successors, (181), 135 states have internal predecessors, (181), 75 states have call successors, (75), 3 states have call predecessors, (75), 3 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-03 23:05:46,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 331 transitions. [2025-03-03 23:05:46,310 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 331 transitions. Word has length 169 [2025-03-03 23:05:46,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:05:46,310 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 331 transitions. [2025-03-03 23:05:46,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 23:05:46,310 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 331 transitions. [2025-03-03 23:05:46,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 23:05:46,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:05:46,311 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:05:46,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 23:05:46,312 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:05:46,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:05:46,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1971059035, now seen corresponding path program 1 times [2025-03-03 23:05:46,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:05:46,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649119434] [2025-03-03 23:05:46,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:46,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:05:46,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 23:05:46,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 23:05:46,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:46,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:46,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 23:05:46,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:05:46,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649119434] [2025-03-03 23:05:46,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649119434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:05:46,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:05:46,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:05:46,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082863585] [2025-03-03 23:05:46,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:05:46,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:05:46,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:05:46,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:05:46,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:05:46,536 INFO L87 Difference]: Start difference. First operand 214 states and 331 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 23:05:46,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:05:46,591 INFO L93 Difference]: Finished difference Result 410 states and 636 transitions. [2025-03-03 23:05:46,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:05:46,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 169 [2025-03-03 23:05:46,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:05:46,594 INFO L225 Difference]: With dead ends: 410 [2025-03-03 23:05:46,594 INFO L226 Difference]: Without dead ends: 248 [2025-03-03 23:05:46,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:05:46,594 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 31 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:05:46,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 248 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:05:46,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-03 23:05:46,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 214. [2025-03-03 23:05:46,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 135 states have (on average 1.325925925925926) internal successors, (179), 135 states have internal predecessors, (179), 75 states have call successors, (75), 3 states have call predecessors, (75), 3 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-03 23:05:46,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 329 transitions. [2025-03-03 23:05:46,621 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 329 transitions. Word has length 169 [2025-03-03 23:05:46,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:05:46,622 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 329 transitions. [2025-03-03 23:05:46,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 23:05:46,622 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 329 transitions. [2025-03-03 23:05:46,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 23:05:46,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:05:46,623 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:05:46,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 23:05:46,623 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:05:46,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:05:46,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1652385862, now seen corresponding path program 1 times [2025-03-03 23:05:46,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:05:46,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090969706] [2025-03-03 23:05:46,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:46,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:05:46,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 23:05:46,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 23:05:46,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:46,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:05:46,747 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:05:46,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 23:05:46,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 23:05:46,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:46,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:05:46,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:05:46,912 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:05:46,913 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:05:46,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 23:05:46,917 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:05:47,024 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:05:47,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:05:47 BoogieIcfgContainer [2025-03-03 23:05:47,027 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:05:47,027 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:05:47,027 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:05:47,027 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:05:47,029 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:05:43" (3/4) ... [2025-03-03 23:05:47,030 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:05:47,031 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:05:47,032 INFO L158 Benchmark]: Toolchain (without parser) took 4822.41ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 115.7MB in the beginning and 198.1MB in the end (delta: -82.4MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2025-03-03 23:05:47,033 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory was 126.7MB in the beginning and 126.6MB in the end (delta: 154.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:05:47,033 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.80ms. Allocated memory is still 142.6MB. Free memory was 115.7MB in the beginning and 98.1MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:05:47,033 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.29ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 92.7MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:05:47,034 INFO L158 Benchmark]: Boogie Preprocessor took 59.86ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 82.1MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:05:47,034 INFO L158 Benchmark]: IcfgBuilder took 570.46ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 50.1MB in the end (delta: 32.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 23:05:47,034 INFO L158 Benchmark]: TraceAbstraction took 3860.80ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 49.3MB in the beginning and 198.2MB in the end (delta: -148.9MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. [2025-03-03 23:05:47,034 INFO L158 Benchmark]: Witness Printer took 4.15ms. Allocated memory is still 285.2MB. Free memory was 198.2MB in the beginning and 198.1MB in the end (delta: 57.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:05:47,035 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory was 126.7MB in the beginning and 126.6MB in the end (delta: 154.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.80ms. Allocated memory is still 142.6MB. Free memory was 115.7MB in the beginning and 98.1MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.29ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 92.7MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.86ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 82.1MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 570.46ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 50.1MB in the end (delta: 32.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3860.80ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 49.3MB in the beginning and 198.2MB in the end (delta: -148.9MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. * Witness Printer took 4.15ms. Allocated memory is still 285.2MB. Free memory was 198.2MB in the beginning and 198.1MB in the end (delta: 57.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 186, overapproximation of someBinaryFLOATComparisonOperation at line 182, overapproximation of someBinaryFLOATComparisonOperation at line 184, overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 215, overapproximation of someBinaryFLOATComparisonOperation at line 190. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 8; [L23] unsigned char var_1_4 = 200; [L24] unsigned char var_1_5 = 0; [L25] unsigned long int var_1_6 = 1000000; [L26] signed short int var_1_7 = -1; [L27] unsigned char var_1_8 = 1; [L28] unsigned char var_1_9 = 0; [L29] signed short int var_1_10 = 128; [L30] unsigned char var_1_12 = 1; [L31] unsigned char var_1_14 = 128; [L32] unsigned char var_1_15 = 25; [L33] unsigned char var_1_16 = 1; [L34] float var_1_17 = 1.25; [L35] float var_1_18 = 3.5; [L36] float var_1_19 = 127.45; [L37] float var_1_20 = 1.5; [L38] float var_1_21 = 24.4; [L39] float var_1_22 = 0.8; [L40] unsigned char var_1_23 = 4; [L41] unsigned char var_1_24 = 0; [L42] unsigned char var_1_25 = 8; [L43] unsigned char var_1_26 = 64; [L44] signed short int var_1_27 = 256; [L45] unsigned char var_1_28 = 1; [L46] unsigned char var_1_30 = 0; [L47] unsigned char var_1_31 = 0; [L48] unsigned char last_1_var_1_1 = 8; [L49] unsigned long int last_1_var_1_6 = 1000000; [L50] signed short int last_1_var_1_7 = -1; [L51] unsigned char last_1_var_1_12 = 1; [L52] float last_1_var_1_17 = 1.25; [L53] unsigned char last_1_var_1_23 = 4; [L54] unsigned char last_1_var_1_25 = 8; [L55] unsigned char last_1_var_1_28 = 1; VAL [isInitial=0, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=200, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L219] isInitial = 1 [L220] FCALL initially() [L221] COND TRUE 1 [L222] 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] [L222] RET updateLastVariables() [L223] 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, var_1_5=256, 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=127, var_1_5=256, 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=127, var_1_5=256, 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=127, var_1_5=256, 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=127, var_1_5=256, 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=127, var_1_5=256, 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=127, var_1_5=256, 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=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, 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=127, var_1_5=256, 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=49279, 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=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, 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=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, 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=127, var_1_5=256, 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=49279, 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=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, 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=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, 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=127, var_1_5=256, 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=49279, 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=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, 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=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=127, var_1_5=256, 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=49279, var_1_15=1, 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=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=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=127, var_1_5=256, 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=49279, var_1_15=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=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=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=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=127, var_1_5=256, 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=49279, var_1_15=1, 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=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=127, var_1_5=256, 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=49279, var_1_15=1, 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=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=127, var_1_5=256, 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=49279, var_1_15=1, 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=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=127, var_1_5=256, 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=49279, var_1_15=1, 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=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=127, var_1_5=256, 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=49279, var_1_15=1, 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=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=127, var_1_5=256, 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=49279, var_1_15=1, 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=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=127, var_1_5=256, 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=49279, var_1_15=1, 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=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=127, var_1_5=256, 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=49279, var_1_15=1, 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=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, 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=49279, var_1_15=1, 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=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, 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=49279, var_1_15=1, 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=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=-193, var_1_27=256, var_1_28=1, var_1_31=0, var_1_4=127, var_1_5=256, 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=49279, var_1_15=1, 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=-193, var_1_27=256, var_1_28=1, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=-193, var_1_27=256, var_1_28=1, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, 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=49279, var_1_15=1, 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=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, 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=49279, var_1_15=1, 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=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, 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=49279, var_1_15=1, 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=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L223] RET updateVariables() [L224] 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=49279, var_1_15=1, 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=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=49279, var_1_15=1, 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=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=0, var_1_14=49279, var_1_15=1, 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=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=0, var_1_14=49279, var_1_15=1, 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=-193, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=256, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [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=0, var_1_10=128, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=256, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=0, var_1_8=1, var_1_9=0] [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=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=256, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=0, var_1_8=1, var_1_9=0] [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=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=256, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=0, var_1_8=0, var_1_9=0] [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=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=256, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=0, var_1_8=0, var_1_9=0] [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=127, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=256, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=0, var_1_8=0, var_1_9=0] [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=0, stepLocal_8=1, stepLocal_9=127, var_1_10=127, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=256, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=0, var_1_8=0, var_1_9=0] [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=0, stepLocal_8=1, stepLocal_9=127, var_1_10=127, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=256, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=0, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=0, var_1_8=0, var_1_9=0] [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=0, stepLocal_1=1, stepLocal_8=1, stepLocal_9=127, var_1_10=127, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=256, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=0, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=0, var_1_8=0, var_1_9=0] [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=0, stepLocal_1=1, stepLocal_8=1, stepLocal_9=127, var_1_10=127, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=256, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=0, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=0] [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=0, stepLocal_1=1, stepLocal_7=0, stepLocal_8=1, stepLocal_9=127, var_1_10=127, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=256, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=0, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=0] [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=0, stepLocal_1=1, stepLocal_7=0, stepLocal_8=1, stepLocal_9=127, var_1_10=127, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=256, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=0, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=0] [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=0, stepLocal_1=1, stepLocal_6=127, stepLocal_7=0, stepLocal_8=1, stepLocal_9=127, var_1_10=127, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=256, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=0, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=0] [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=0, stepLocal_1=1, stepLocal_6=127, stepLocal_7=0, stepLocal_8=1, stepLocal_9=127, var_1_10=127, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=1000005, var_1_1=256, var_1_21=1000005, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=0, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=0] [L224] RET step() [L225] 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=127, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=1000005, var_1_1=256, var_1_21=1000005, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=0, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=0] [L225] RET, EXPR property() [L225] 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=127, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=1000005, var_1_1=256, var_1_21=1000005, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=0, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=0] [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=127, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=1000005, var_1_1=256, var_1_21=1000005, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=0, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 7, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 387 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 387 mSDsluCounter, 2025 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, 797 mSDtfsCounter, 217 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 198 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=214occurred in iteration=5, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 207 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1339 NumberOfCodeBlocks, 1339 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1162 ConstructedInterpolants, 0 QuantifiedInterpolants, 2939 SizeOfPredicates, 0 NumberOfNonLiveVariables, 412 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 8352/8400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 23:05:47,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_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 d1f2fd33e5d2eefab538c8e9509f9026512706d91745f186ee11fd8135485551 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:05:48,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:05:48,944 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:05:48,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:05:48,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:05:48,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:05:48,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:05:48,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:05:48,975 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:05:48,975 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:05:48,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:05:48,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:05:48,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:05:48,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:05:48,976 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:05:48,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:05:48,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:05:48,977 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:05:48,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:05:48,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:05:48,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:05:48,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:05:48,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:05:48,977 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:05:48,977 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:05:48,978 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:05:48,978 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:05:48,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:05:48,978 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:05:48,978 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:05:48,978 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:05:48,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:05:48,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:05:48,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:05:48,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:05:48,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:05:48,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:05:48,979 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:05:48,979 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:05:48,979 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:05:48,979 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:05:48,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:05:48,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:05:48,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:05:48,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:05:48,980 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 -> d1f2fd33e5d2eefab538c8e9509f9026512706d91745f186ee11fd8135485551 [2025-03-03 23:05:49,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:05:49,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:05:49,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:05:49,197 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:05:49,197 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:05:49,198 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-99.i [2025-03-03 23:05:50,299 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/670250205/ed39dcbc8c6f4ac2826a09d6efd92225/FLAG77979fdd1 [2025-03-03 23:05:50,488 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:05:50,489 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-99.i [2025-03-03 23:05:50,499 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/670250205/ed39dcbc8c6f4ac2826a09d6efd92225/FLAG77979fdd1 [2025-03-03 23:05:50,881 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/670250205/ed39dcbc8c6f4ac2826a09d6efd92225 [2025-03-03 23:05:50,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:05:50,884 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:05:50,885 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:05:50,885 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:05:50,888 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:05:50,888 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:05:50" (1/1) ... [2025-03-03 23:05:50,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e886fa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:50, skipping insertion in model container [2025-03-03 23:05:50,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:05:50" (1/1) ... [2025-03-03 23:05:50,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:05:50,998 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-while_file-99.i[916,929] [2025-03-03 23:05:51,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:05:51,063 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:05:51,070 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-while_file-99.i[916,929] [2025-03-03 23:05:51,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:05:51,117 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:05:51,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:51 WrapperNode [2025-03-03 23:05:51,119 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:05:51,120 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:05:51,120 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:05:51,120 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:05:51,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:51" (1/1) ... [2025-03-03 23:05:51,136 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:51" (1/1) ... [2025-03-03 23:05:51,173 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2025-03-03 23:05:51,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:05:51,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:05:51,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:05:51,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:05:51,180 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:51" (1/1) ... [2025-03-03 23:05:51,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:51" (1/1) ... [2025-03-03 23:05:51,189 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:51" (1/1) ... [2025-03-03 23:05:51,218 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:05:51,218 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:51" (1/1) ... [2025-03-03 23:05:51,219 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:51" (1/1) ... [2025-03-03 23:05:51,233 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:51" (1/1) ... [2025-03-03 23:05:51,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:51" (1/1) ... [2025-03-03 23:05:51,236 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:51" (1/1) ... [2025-03-03 23:05:51,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:51" (1/1) ... [2025-03-03 23:05:51,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:05:51,245 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:05:51,245 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:05:51,246 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:05:51,246 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:51" (1/1) ... [2025-03-03 23:05:51,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:05:51,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:05:51,271 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:05:51,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:05:51,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:05:51,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:05:51,292 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:05:51,292 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:05:51,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:05:51,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:05:51,374 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:05:51,376 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:05:52,148 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-03 23:05:52,150 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:05:52,158 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:05:52,158 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:05:52,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:05:52 BoogieIcfgContainer [2025-03-03 23:05:52,159 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:05:52,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:05:52,161 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:05:52,164 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:05:52,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:05:50" (1/3) ... [2025-03-03 23:05:52,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f2c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:05:52, skipping insertion in model container [2025-03-03 23:05:52,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:51" (2/3) ... [2025-03-03 23:05:52,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f2c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:05:52, skipping insertion in model container [2025-03-03 23:05:52,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:05:52" (3/3) ... [2025-03-03 23:05:52,167 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-99.i [2025-03-03 23:05:52,178 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:05:52,180 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-99.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:05:52,214 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:05:52,225 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;@6743244b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:05:52,225 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:05:52,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 23:05:52,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 23:05:52,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:05:52,255 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:05:52,256 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:05:52,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:05:52,260 INFO L85 PathProgramCache]: Analyzing trace with hash -2131778620, now seen corresponding path program 1 times [2025-03-03 23:05:52,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:05:52,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142723124] [2025-03-03 23:05:52,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:52,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:05:52,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:05:52,270 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:05:52,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 23:05:52,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 23:05:52,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 23:05:52,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:52,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:52,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:05:52,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:05:52,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2025-03-03 23:05:52,594 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:05:52,594 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:05:52,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142723124] [2025-03-03 23:05:52,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142723124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:05:52,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:05:52,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:05:52,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548731005] [2025-03-03 23:05:52,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:05:52,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:05:52,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:05:52,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:05:52,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:05:52,619 INFO L87 Difference]: Start difference. First operand has 88 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 23:05:52,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:05:52,644 INFO L93 Difference]: Finished difference Result 170 states and 296 transitions. [2025-03-03 23:05:52,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:05:52,646 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 165 [2025-03-03 23:05:52,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:05:52,653 INFO L225 Difference]: With dead ends: 170 [2025-03-03 23:05:52,653 INFO L226 Difference]: Without dead ends: 85 [2025-03-03 23:05:52,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:05:52,659 INFO L435 NwaCegarLoop]: 132 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, 132 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:05:52,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:05:52,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-03 23:05:52,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-03 23:05:52,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 58 states have internal predecessors, (82), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 23:05:52,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 132 transitions. [2025-03-03 23:05:52,697 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 132 transitions. Word has length 165 [2025-03-03 23:05:52,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:05:52,697 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 132 transitions. [2025-03-03 23:05:52,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 23:05:52,698 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 132 transitions. [2025-03-03 23:05:52,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 23:05:52,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:05:52,700 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:05:52,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 23:05:52,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:05:52,902 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:05:52,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:05:52,902 INFO L85 PathProgramCache]: Analyzing trace with hash 2117002909, now seen corresponding path program 1 times [2025-03-03 23:05:52,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:05:52,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970509785] [2025-03-03 23:05:52,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:52,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:05:52,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:05:52,905 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:05:52,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 23:05:52,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 23:05:53,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 23:05:53,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:53,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:53,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 23:05:53,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:05:53,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 23:05:53,965 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:05:53,965 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:05:53,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970509785] [2025-03-03 23:05:53,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970509785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:05:53,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:05:53,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:05:53,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227968828] [2025-03-03 23:05:53,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:05:53,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:05:53,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:05:53,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:05:53,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:05:53,967 INFO L87 Difference]: Start difference. First operand 85 states and 132 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 23:05:54,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:05:54,956 INFO L93 Difference]: Finished difference Result 250 states and 391 transitions. [2025-03-03 23:05:54,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:05:54,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 166 [2025-03-03 23:05:54,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:05:54,969 INFO L225 Difference]: With dead ends: 250 [2025-03-03 23:05:54,969 INFO L226 Difference]: Without dead ends: 168 [2025-03-03 23:05:54,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:05:54,971 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 99 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 23:05:54,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 448 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 23:05:54,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-03 23:05:55,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 132. [2025-03-03 23:05:55,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 23:05:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 203 transitions. [2025-03-03 23:05:55,005 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 203 transitions. Word has length 166 [2025-03-03 23:05:55,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:05:55,005 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 203 transitions. [2025-03-03 23:05:55,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 23:05:55,006 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 203 transitions. [2025-03-03 23:05:55,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 23:05:55,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:05:55,007 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:05:55,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-03 23:05:55,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:05:55,208 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:05:55,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:05:55,209 INFO L85 PathProgramCache]: Analyzing trace with hash -837586236, now seen corresponding path program 1 times [2025-03-03 23:05:55,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:05:55,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128232638] [2025-03-03 23:05:55,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:55,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:05:55,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:05:55,211 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:05:55,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 23:05:55,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 23:05:55,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 23:05:55,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:55,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:55,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 23:05:55,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:05:55,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 23:05:55,730 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:05:55,730 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:05:55,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128232638] [2025-03-03 23:05:55,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128232638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:05:55,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:05:55,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:05:55,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534829751] [2025-03-03 23:05:55,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:05:55,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:05:55,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:05:55,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:05:55,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:05:55,733 INFO L87 Difference]: Start difference. First operand 132 states and 203 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 23:05:56,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:05:56,342 INFO L93 Difference]: Finished difference Result 250 states and 390 transitions. [2025-03-03 23:05:56,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:05:56,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2025-03-03 23:05:56,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:05:56,353 INFO L225 Difference]: With dead ends: 250 [2025-03-03 23:05:56,353 INFO L226 Difference]: Without dead ends: 168 [2025-03-03 23:05:56,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:05:56,354 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 97 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 23:05:56,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 503 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 23:05:56,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-03 23:05:56,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 133. [2025-03-03 23:05:56,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 80 states have (on average 1.3) internal successors, (104), 80 states have internal predecessors, (104), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 23:05:56,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 204 transitions. [2025-03-03 23:05:56,370 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 204 transitions. Word has length 167 [2025-03-03 23:05:56,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:05:56,370 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 204 transitions. [2025-03-03 23:05:56,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 23:05:56,370 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 204 transitions. [2025-03-03 23:05:56,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 23:05:56,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:05:56,372 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:05:56,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-03 23:05:56,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:05:56,576 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:05:56,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:05:56,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1855583673, now seen corresponding path program 1 times [2025-03-03 23:05:56,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:05:56,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759621666] [2025-03-03 23:05:56,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:56,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:05:56,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:05:56,579 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:05:56,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 23:05:56,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 23:05:56,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 23:05:56,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:56,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:56,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 23:05:56,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:05:57,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 23:05:57,286 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:05:57,287 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:05:57,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759621666] [2025-03-03 23:05:57,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759621666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:05:57,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:05:57,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:05:57,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048860356] [2025-03-03 23:05:57,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:05:57,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:05:57,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:05:57,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:05:57,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:05:57,288 INFO L87 Difference]: Start difference. First operand 133 states and 204 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 23:05:58,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:05:58,106 INFO L93 Difference]: Finished difference Result 250 states and 389 transitions. [2025-03-03 23:05:58,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:05:58,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 168 [2025-03-03 23:05:58,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:05:58,116 INFO L225 Difference]: With dead ends: 250 [2025-03-03 23:05:58,116 INFO L226 Difference]: Without dead ends: 168 [2025-03-03 23:05:58,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:05:58,117 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 81 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 23:05:58,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 435 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 23:05:58,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-03 23:05:58,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 134. [2025-03-03 23:05:58,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 81 states have internal predecessors, (105), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 23:05:58,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 205 transitions. [2025-03-03 23:05:58,133 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 205 transitions. Word has length 168 [2025-03-03 23:05:58,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:05:58,134 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 205 transitions. [2025-03-03 23:05:58,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 23:05:58,134 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 205 transitions. [2025-03-03 23:05:58,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 23:05:58,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:05:58,135 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:05:58,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-03 23:05:58,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:05:58,336 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:05:58,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:05:58,337 INFO L85 PathProgramCache]: Analyzing trace with hash 2066934586, now seen corresponding path program 1 times [2025-03-03 23:05:58,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:05:58,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [921041346] [2025-03-03 23:05:58,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:58,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:05:58,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:05:58,339 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:05:58,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-03 23:05:58,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 23:05:58,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 23:05:58,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:58,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:58,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 23:05:58,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:05:58,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-03 23:05:58,683 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:05:58,684 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:05:58,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [921041346] [2025-03-03 23:05:58,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [921041346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:05:58,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:05:58,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 23:05:58,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600510071] [2025-03-03 23:05:58,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:05:58,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 23:05:58,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:05:58,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 23:05:58,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:05:58,687 INFO L87 Difference]: Start difference. First operand 134 states and 205 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 23:05:59,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:05:59,962 INFO L93 Difference]: Finished difference Result 319 states and 474 transitions. [2025-03-03 23:05:59,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 23:05:59,963 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) Word has length 168 [2025-03-03 23:05:59,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:05:59,964 INFO L225 Difference]: With dead ends: 319 [2025-03-03 23:05:59,964 INFO L226 Difference]: Without dead ends: 237 [2025-03-03 23:05:59,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2025-03-03 23:05:59,965 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 369 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:05:59,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 651 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 23:05:59,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-03 23:05:59,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 160. [2025-03-03 23:05:59,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 104 states have internal predecessors, (131), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 23:05:59,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 231 transitions. [2025-03-03 23:05:59,985 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 231 transitions. Word has length 168 [2025-03-03 23:05:59,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:05:59,986 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 231 transitions. [2025-03-03 23:05:59,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 23:05:59,986 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 231 transitions. [2025-03-03 23:05:59,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 23:05:59,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:05:59,987 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:05:59,996 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-03 23:06:00,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:06:00,188 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:06:00,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:06:00,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1245930373, now seen corresponding path program 1 times [2025-03-03 23:06:00,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:06:00,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130040044] [2025-03-03 23:06:00,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:06:00,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:06:00,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:06:00,190 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:06:00,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-03 23:06:00,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 23:06:00,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 23:06:00,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:06:00,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:06:00,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 23:06:00,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:06:00,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 23:06:00,597 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:06:00,597 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:06:00,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130040044] [2025-03-03 23:06:00,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130040044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:06:00,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:06:00,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:06:00,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896924603] [2025-03-03 23:06:00,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:06:00,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:06:00,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:06:00,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:06:00,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:06:00,598 INFO L87 Difference]: Start difference. First operand 160 states and 231 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 23:06:00,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:06:00,926 INFO L93 Difference]: Finished difference Result 368 states and 535 transitions. [2025-03-03 23:06:00,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:06:00,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 169 [2025-03-03 23:06:00,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:06:00,939 INFO L225 Difference]: With dead ends: 368 [2025-03-03 23:06:00,939 INFO L226 Difference]: Without dead ends: 264 [2025-03-03 23:06:00,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:06:00,940 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 39 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:06:00,940 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.3s Time] [2025-03-03 23:06:00,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-03 23:06:00,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2025-03-03 23:06:00,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 178 states have (on average 1.2921348314606742) internal successors, (230), 178 states have internal predecessors, (230), 75 states have call successors, (75), 8 states have call predecessors, (75), 8 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-03 23:06:00,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 380 transitions. [2025-03-03 23:06:00,965 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 380 transitions. Word has length 169 [2025-03-03 23:06:00,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:06:00,966 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 380 transitions. [2025-03-03 23:06:00,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 23:06:00,966 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 380 transitions. [2025-03-03 23:06:00,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 23:06:00,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:06:00,967 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:06:00,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-03 23:06:01,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:06:01,168 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:06:01,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:06:01,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1652385862, now seen corresponding path program 1 times [2025-03-03 23:06:01,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:06:01,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733782785] [2025-03-03 23:06:01,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:06:01,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:06:01,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:06:01,170 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:06:01,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-03 23:06:01,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 23:06:01,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 23:06:01,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:06:01,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:06:01,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-03 23:06:01,393 INFO L279 TraceCheckSpWp]: Computing forward predicates...