./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-25.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 c147c84511e5c0677a9069c27a4d754d19564d6e4b1f08886ba1a76b5d6b51d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:07:39,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:07:39,235 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:07:39,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:07:39,239 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:07:39,259 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:07:39,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:07:39,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:07:39,260 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:07:39,260 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:07:39,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:07:39,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:07:39,261 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:07:39,261 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:07:39,261 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:07:39,261 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:07:39,261 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:07:39,261 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:07:39,261 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:07:39,261 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:07:39,262 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:07:39,262 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:07:39,262 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:07:39,262 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:07:39,262 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:07:39,262 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:07:39,262 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:07:39,262 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:07:39,262 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:07:39,262 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:07:39,262 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:07:39,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:07:39,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:07:39,263 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:07:39,263 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:07:39,263 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:07:39,263 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:07:39,263 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:07:39,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:07:39,263 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:07:39,263 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:07:39,263 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:07:39,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:07:39,263 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 -> c147c84511e5c0677a9069c27a4d754d19564d6e4b1f08886ba1a76b5d6b51d6 [2025-03-08 14:07:39,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:07:39,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:07:39,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:07:39,480 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:07:39,480 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:07:39,481 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-25.i [2025-03-08 14:07:40,575 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cbe1b712/ac02a4488c24407b8f27c7053ea7f664/FLAGf585c0be2 [2025-03-08 14:07:40,807 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:07:40,807 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-25.i [2025-03-08 14:07:40,813 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cbe1b712/ac02a4488c24407b8f27c7053ea7f664/FLAGf585c0be2 [2025-03-08 14:07:41,136 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cbe1b712/ac02a4488c24407b8f27c7053ea7f664 [2025-03-08 14:07:41,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:07:41,140 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:07:41,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:07:41,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:07:41,146 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:07:41,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:07:41" (1/1) ... [2025-03-08 14:07:41,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be0aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41, skipping insertion in model container [2025-03-08 14:07:41,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:07:41" (1/1) ... [2025-03-08 14:07:41,168 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:07:41,275 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-25.i[916,929] [2025-03-08 14:07:41,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:07:41,363 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:07:41,371 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-25.i[916,929] [2025-03-08 14:07:41,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:07:41,423 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:07:41,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41 WrapperNode [2025-03-08 14:07:41,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:07:41,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:07:41,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:07:41,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:07:41,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41" (1/1) ... [2025-03-08 14:07:41,437 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41" (1/1) ... [2025-03-08 14:07:41,469 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2025-03-08 14:07:41,469 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:07:41,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:07:41,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:07:41,470 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:07:41,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41" (1/1) ... [2025-03-08 14:07:41,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41" (1/1) ... [2025-03-08 14:07:41,484 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41" (1/1) ... [2025-03-08 14:07:41,502 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:07:41,502 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41" (1/1) ... [2025-03-08 14:07:41,504 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41" (1/1) ... [2025-03-08 14:07:41,510 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41" (1/1) ... [2025-03-08 14:07:41,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41" (1/1) ... [2025-03-08 14:07:41,512 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41" (1/1) ... [2025-03-08 14:07:41,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41" (1/1) ... [2025-03-08 14:07:41,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:07:41,516 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:07:41,516 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:07:41,516 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:07:41,517 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41" (1/1) ... [2025-03-08 14:07:41,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:07:41,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:07:41,543 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:07:41,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:07:41,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:07:41,564 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:07:41,564 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:07:41,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:07:41,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:07:41,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:07:41,627 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:07:41,628 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:07:41,936 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-08 14:07:41,936 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:07:41,947 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:07:41,948 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:07:41,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:07:41 BoogieIcfgContainer [2025-03-08 14:07:41,948 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:07:41,949 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:07:41,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:07:41,954 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:07:41,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:07:41" (1/3) ... [2025-03-08 14:07:41,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c95f8ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:07:41, skipping insertion in model container [2025-03-08 14:07:41,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41" (2/3) ... [2025-03-08 14:07:41,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c95f8ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:07:41, skipping insertion in model container [2025-03-08 14:07:41,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:07:41" (3/3) ... [2025-03-08 14:07:41,956 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-25.i [2025-03-08 14:07:41,966 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:07:41,968 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-25.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:07:42,011 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:07:42,022 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;@357dd762, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:07:42,022 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:07:42,026 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 57 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 14:07:42,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 14:07:42,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:07:42,037 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:07:42,037 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:07:42,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:07:42,042 INFO L85 PathProgramCache]: Analyzing trace with hash 796266895, now seen corresponding path program 1 times [2025-03-08 14:07:42,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:07:42,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43995505] [2025-03-08 14:07:42,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:07:42,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:07:42,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 14:07:42,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 14:07:42,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:07:42,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:07:42,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-08 14:07:42,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:07:42,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43995505] [2025-03-08 14:07:42,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43995505] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:07:42,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633287323] [2025-03-08 14:07:42,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:07:42,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:07:42,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:07:42,310 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:07:42,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 14:07:42,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 14:07:42,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 14:07:42,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:07:42,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:07:42,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:07:42,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:07:42,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-08 14:07:42,518 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:07:42,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633287323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:07:42,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:07:42,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:07:42,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072723294] [2025-03-08 14:07:42,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:07:42,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:07:42,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:07:42,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:07:42,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:07:42,541 INFO L87 Difference]: Start difference. First operand has 83 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 57 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 14:07:42,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:07:42,565 INFO L93 Difference]: Finished difference Result 160 states and 271 transitions. [2025-03-08 14:07:42,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:07:42,567 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 164 [2025-03-08 14:07:42,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:07:42,573 INFO L225 Difference]: With dead ends: 160 [2025-03-08 14:07:42,573 INFO L226 Difference]: Without dead ends: 80 [2025-03-08 14:07:42,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:07:42,578 INFO L435 NwaCegarLoop]: 121 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, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:07:42,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:07:42,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-08 14:07:42,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-08 14:07:42,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 14:07:42,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 121 transitions. [2025-03-08 14:07:42,618 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 121 transitions. Word has length 164 [2025-03-08 14:07:42,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:07:42,621 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 121 transitions. [2025-03-08 14:07:42,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 14:07:42,621 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 121 transitions. [2025-03-08 14:07:42,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 14:07:42,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:07:42,623 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:07:42,632 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-08 14:07:42,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 14:07:42,824 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:07:42,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:07:42,825 INFO L85 PathProgramCache]: Analyzing trace with hash -675309101, now seen corresponding path program 1 times [2025-03-08 14:07:42,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:07:42,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346538561] [2025-03-08 14:07:42,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:07:42,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:07:42,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 14:07:42,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 14:07:42,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:07:42,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:07:43,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 14:07:43,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:07:43,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346538561] [2025-03-08 14:07:43,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346538561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:07:43,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:07:43,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:07:43,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497005869] [2025-03-08 14:07:43,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:07:43,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:07:43,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:07:43,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:07:43,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:07:43,090 INFO L87 Difference]: Start difference. First operand 80 states and 121 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 14:07:43,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:07:43,132 INFO L93 Difference]: Finished difference Result 188 states and 285 transitions. [2025-03-08 14:07:43,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:07:43,133 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 164 [2025-03-08 14:07:43,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:07:43,135 INFO L225 Difference]: With dead ends: 188 [2025-03-08 14:07:43,135 INFO L226 Difference]: Without dead ends: 111 [2025-03-08 14:07:43,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:07:43,136 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 36 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:07:43,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 231 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:07:43,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-08 14:07:43,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2025-03-08 14:07:43,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 76 states have internal predecessors, (107), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 14:07:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2025-03-08 14:07:43,147 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 164 [2025-03-08 14:07:43,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:07:43,149 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2025-03-08 14:07:43,149 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 14:07:43,150 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2025-03-08 14:07:43,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 14:07:43,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:07:43,151 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:07:43,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:07:43,151 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:07:43,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:07:43,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1889471889, now seen corresponding path program 1 times [2025-03-08 14:07:43,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:07:43,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618214627] [2025-03-08 14:07:43,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:07:43,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:07:43,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 14:07:43,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 14:07:43,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:07:43,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:07:46,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 14:07:46,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:07:46,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618214627] [2025-03-08 14:07:46,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618214627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:07:46,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:07:46,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 14:07:46,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941853521] [2025-03-08 14:07:46,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:07:46,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 14:07:46,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:07:46,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 14:07:46,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 14:07:46,239 INFO L87 Difference]: Start difference. First operand 102 states and 155 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 14:07:46,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:07:46,875 INFO L93 Difference]: Finished difference Result 365 states and 554 transitions. [2025-03-08 14:07:46,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 14:07:46,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-03-08 14:07:46,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:07:46,878 INFO L225 Difference]: With dead ends: 365 [2025-03-08 14:07:46,880 INFO L226 Difference]: Without dead ends: 266 [2025-03-08 14:07:46,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 14:07:46,883 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 171 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 14:07:46,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 419 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 14:07:46,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-08 14:07:46,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 168. [2025-03-08 14:07:46,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 117 states have (on average 1.3675213675213675) internal successors, (160), 117 states have internal predecessors, (160), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 14:07:46,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2025-03-08 14:07:46,899 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 165 [2025-03-08 14:07:46,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:07:46,900 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2025-03-08 14:07:46,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 14:07:46,900 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2025-03-08 14:07:46,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 14:07:46,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:07:46,902 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:07:46,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 14:07:46,902 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:07:46,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:07:46,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1405927024, now seen corresponding path program 1 times [2025-03-08 14:07:46,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:07:46,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591685636] [2025-03-08 14:07:46,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:07:46,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:07:46,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 14:07:46,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 14:07:46,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:07:46,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:07:49,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 14:07:49,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:07:49,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591685636] [2025-03-08 14:07:49,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591685636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:07:49,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:07:49,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 14:07:49,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101368661] [2025-03-08 14:07:49,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:07:49,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 14:07:49,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:07:49,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 14:07:49,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 14:07:49,847 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 14:07:50,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:07:50,730 INFO L93 Difference]: Finished difference Result 365 states and 552 transitions. [2025-03-08 14:07:50,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 14:07:50,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-03-08 14:07:50,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:07:50,733 INFO L225 Difference]: With dead ends: 365 [2025-03-08 14:07:50,733 INFO L226 Difference]: Without dead ends: 266 [2025-03-08 14:07:50,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 14:07:50,734 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 171 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 14:07:50,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 472 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 14:07:50,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-08 14:07:50,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 170. [2025-03-08 14:07:50,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 119 states have (on average 1.361344537815126) internal successors, (162), 119 states have internal predecessors, (162), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 14:07:50,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 258 transitions. [2025-03-08 14:07:50,754 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 258 transitions. Word has length 165 [2025-03-08 14:07:50,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:07:50,755 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 258 transitions. [2025-03-08 14:07:50,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 14:07:50,755 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 258 transitions. [2025-03-08 14:07:50,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 14:07:50,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:07:50,756 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:07:50,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 14:07:50,756 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:07:50,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:07:50,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1081585809, now seen corresponding path program 1 times [2025-03-08 14:07:50,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:07:50,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961556838] [2025-03-08 14:07:50,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:07:50,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:07:50,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 14:07:50,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 14:07:50,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:07:50,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:07:51,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 14:07:51,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:07:51,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961556838] [2025-03-08 14:07:51,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961556838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:07:51,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:07:51,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:07:51,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964573291] [2025-03-08 14:07:51,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:07:51,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 14:07:51,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:07:51,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 14:07:51,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:07:51,084 INFO L87 Difference]: Start difference. First operand 170 states and 258 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 14:07:51,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:07:51,131 INFO L93 Difference]: Finished difference Result 355 states and 534 transitions. [2025-03-08 14:07:51,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:07:51,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-03-08 14:07:51,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:07:51,134 INFO L225 Difference]: With dead ends: 355 [2025-03-08 14:07:51,134 INFO L226 Difference]: Without dead ends: 238 [2025-03-08 14:07:51,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:07:51,135 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 42 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:07:51,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 363 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:07:51,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-08 14:07:51,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 224. [2025-03-08 14:07:51,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 169 states have (on average 1.3727810650887573) internal successors, (232), 170 states have internal predecessors, (232), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 14:07:51,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 332 transitions. [2025-03-08 14:07:51,162 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 332 transitions. Word has length 165 [2025-03-08 14:07:51,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:07:51,165 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 332 transitions. [2025-03-08 14:07:51,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 14:07:51,165 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 332 transitions. [2025-03-08 14:07:51,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 14:07:51,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:07:51,166 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:07:51,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 14:07:51,166 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:07:51,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:07:51,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1899936782, now seen corresponding path program 1 times [2025-03-08 14:07:51,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:07:51,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70682938] [2025-03-08 14:07:51,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:07:51,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:07:51,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 14:07:51,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 14:07:51,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:07:51,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:07:51,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 14:07:51,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:07:51,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70682938] [2025-03-08 14:07:51,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70682938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:07:51,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:07:51,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 14:07:51,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914619781] [2025-03-08 14:07:51,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:07:51,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 14:07:51,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:07:51,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 14:07:51,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 14:07:51,374 INFO L87 Difference]: Start difference. First operand 224 states and 332 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 14:07:51,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:07:51,583 INFO L93 Difference]: Finished difference Result 507 states and 752 transitions. [2025-03-08 14:07:51,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 14:07:51,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-03-08 14:07:51,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:07:51,587 INFO L225 Difference]: With dead ends: 507 [2025-03-08 14:07:51,587 INFO L226 Difference]: Without dead ends: 364 [2025-03-08 14:07:51,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 14:07:51,588 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 176 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:07:51,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 499 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 14:07:51,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-08 14:07:51,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 282. [2025-03-08 14:07:51,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 227 states have (on average 1.4008810572687225) internal successors, (318), 228 states have internal predecessors, (318), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 14:07:51,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 418 transitions. [2025-03-08 14:07:51,606 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 418 transitions. Word has length 165 [2025-03-08 14:07:51,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:07:51,606 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 418 transitions. [2025-03-08 14:07:51,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 14:07:51,606 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 418 transitions. [2025-03-08 14:07:51,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 14:07:51,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:07:51,607 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:07:51,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 14:07:51,608 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:07:51,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:07:51,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1911485649, now seen corresponding path program 1 times [2025-03-08 14:07:51,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:07:51,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777861412] [2025-03-08 14:07:51,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:07:51,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:07:51,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 14:07:51,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 14:07:51,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:07:51,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:07:51,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 14:07:51,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:07:51,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777861412] [2025-03-08 14:07:51,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777861412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:07:51,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:07:51,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 14:07:51,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785854736] [2025-03-08 14:07:51,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:07:51,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 14:07:51,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:07:51,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 14:07:51,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 14:07:51,789 INFO L87 Difference]: Start difference. First operand 282 states and 418 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 14:07:52,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:07:52,061 INFO L93 Difference]: Finished difference Result 507 states and 749 transitions. [2025-03-08 14:07:52,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 14:07:52,063 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-03-08 14:07:52,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:07:52,065 INFO L225 Difference]: With dead ends: 507 [2025-03-08 14:07:52,065 INFO L226 Difference]: Without dead ends: 364 [2025-03-08 14:07:52,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-08 14:07:52,066 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 214 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:07:52,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 506 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 14:07:52,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-08 14:07:52,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 258. [2025-03-08 14:07:52,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 203 states have (on average 1.3793103448275863) internal successors, (280), 204 states have internal predecessors, (280), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 14:07:52,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 380 transitions. [2025-03-08 14:07:52,086 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 380 transitions. Word has length 165 [2025-03-08 14:07:52,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:07:52,086 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 380 transitions. [2025-03-08 14:07:52,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 14:07:52,086 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 380 transitions. [2025-03-08 14:07:52,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 14:07:52,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:07:52,087 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:07:52,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 14:07:52,087 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:07:52,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:07:52,088 INFO L85 PathProgramCache]: Analyzing trace with hash 576027184, now seen corresponding path program 1 times [2025-03-08 14:07:52,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:07:52,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583214705] [2025-03-08 14:07:52,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:07:52,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:07:52,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 14:07:52,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 14:07:52,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:07:52,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:07:52,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1991709373] [2025-03-08 14:07:52,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:07:52,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:07:52,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:07:52,296 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:07:52,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 14:07:52,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 14:07:52,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 14:07:52,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:07:52,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:07:52,474 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:07:52,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 14:07:52,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 14:07:52,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:07:52,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:07:52,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:07:52,662 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:07:52,663 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:07:52,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 14:07:52,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-08 14:07:52,867 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:07:52,955 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:07:52,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:07:52 BoogieIcfgContainer [2025-03-08 14:07:52,957 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:07:52,958 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:07:52,958 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:07:52,958 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:07:52,958 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:07:41" (3/4) ... [2025-03-08 14:07:52,960 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:07:52,960 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:07:52,961 INFO L158 Benchmark]: Toolchain (without parser) took 11820.82ms. Allocated memory was 167.8MB in the beginning and 494.9MB in the end (delta: 327.2MB). Free memory was 128.2MB in the beginning and 303.1MB in the end (delta: -174.9MB). Peak memory consumption was 152.0MB. Max. memory is 16.1GB. [2025-03-08 14:07:52,961 INFO L158 Benchmark]: CDTParser took 0.70ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:07:52,961 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.96ms. Allocated memory is still 167.8MB. Free memory was 128.2MB in the beginning and 112.1MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:07:52,961 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.53ms. Allocated memory is still 167.8MB. Free memory was 112.1MB in the beginning and 108.6MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:07:52,961 INFO L158 Benchmark]: Boogie Preprocessor took 45.98ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 102.8MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:07:52,962 INFO L158 Benchmark]: IcfgBuilder took 431.97ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 75.8MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 14:07:52,962 INFO L158 Benchmark]: TraceAbstraction took 11007.75ms. Allocated memory was 167.8MB in the beginning and 494.9MB in the end (delta: 327.2MB). Free memory was 75.2MB in the beginning and 303.2MB in the end (delta: -228.0MB). Peak memory consumption was 101.7MB. Max. memory is 16.1GB. [2025-03-08 14:07:52,962 INFO L158 Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 494.9MB. Free memory was 303.2MB in the beginning and 303.1MB in the end (delta: 102.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:07:52,964 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.70ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.96ms. Allocated memory is still 167.8MB. Free memory was 128.2MB in the beginning and 112.1MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.53ms. Allocated memory is still 167.8MB. Free memory was 112.1MB in the beginning and 108.6MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.98ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 102.8MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 431.97ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 75.8MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11007.75ms. Allocated memory was 167.8MB in the beginning and 494.9MB in the end (delta: 327.2MB). Free memory was 75.2MB in the beginning and 303.2MB in the end (delta: -228.0MB). Peak memory consumption was 101.7MB. Max. memory is 16.1GB. * Witness Printer took 2.80ms. Allocated memory is still 494.9MB. Free memory was 303.2MB in the beginning and 303.1MB in the end (delta: 102.2kB). 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 someBinaryDOUBLEComparisonOperation at line 128, overapproximation of someBinaryDOUBLEComparisonOperation at line 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 170, overapproximation of someBinaryDOUBLEComparisonOperation at line 165, overapproximation of someBinaryDOUBLEComparisonOperation at line 152, overapproximation of someBinaryDOUBLEComparisonOperation at line 150, overapproximation of someBinaryDOUBLEComparisonOperation at line 172, overapproximation of someBinaryDOUBLEComparisonOperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 193. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] signed short int var_1_4 = -256; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 1; [L26] double var_1_7 = 256.25; [L27] double var_1_8 = 127.8; [L28] signed short int var_1_10 = -2; [L29] signed short int var_1_11 = 5; [L30] signed short int var_1_12 = 16; [L31] unsigned long int var_1_13 = 1000000000; [L32] signed long int var_1_14 = -100000000; [L33] double var_1_16 = 50.8; [L34] double var_1_17 = 2.2; [L35] double var_1_18 = 2.675; [L36] double var_1_19 = 100.5; [L37] unsigned short int var_1_20 = 46250; [L38] double var_1_21 = 99999999999.75; [L39] double var_1_22 = 32.4; [L40] double var_1_23 = 15.25; [L41] signed short int var_1_24 = -100; [L42] signed char var_1_25 = -1; [L43] unsigned short int var_1_26 = 128; [L44] unsigned long int var_1_27 = 8; [L45] signed short int var_1_28 = -4; [L46] unsigned long int var_1_29 = 100; [L47] unsigned long int var_1_30 = 100; [L48] unsigned long int var_1_31 = 1000000000; [L49] double var_1_32 = 0.0; [L50] signed long int last_1_var_1_1 = -64; [L51] signed long int last_1_var_1_14 = -100000000; [L52] double last_1_var_1_16 = 50.8; [L53] signed short int last_1_var_1_24 = -100; [L54] signed short int last_1_var_1_28 = -4; [L55] unsigned long int last_1_var_1_29 = 100; [L56] unsigned long int last_1_var_1_30 = 100; VAL [isInitial=0, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=1, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L197] isInitial = 1 [L198] FCALL initially() [L199] COND TRUE 1 [L200] CALL updateLastVariables() [L184] last_1_var_1_1 = var_1_1 [L185] last_1_var_1_14 = var_1_14 [L186] last_1_var_1_16 = var_1_16 [L187] last_1_var_1_24 = var_1_24 [L188] last_1_var_1_28 = var_1_28 [L189] last_1_var_1_29 = var_1_29 [L190] last_1_var_1_30 = var_1_30 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=1, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L200] RET updateLastVariables() [L201] CALL updateVariables() [L143] var_1_5 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L144] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L145] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L145] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L146] var_1_6 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_7=1025/4, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_7=1025/4, var_1_8=639/5] [L147] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_7=1025/4, var_1_8=639/5] [L148] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_7=1025/4, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_7=1025/4, var_1_8=639/5] [L148] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_7=1025/4, var_1_8=639/5] [L149] var_1_7 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_8=639/5] [L150] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_8=639/5] [L151] var_1_8 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L152] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L153] var_1_10 = __VERIFIER_nondet_short() [L154] CALL assume_abort_if_not(var_1_10 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L154] RET assume_abort_if_not(var_1_10 >= -16383) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L155] CALL assume_abort_if_not(var_1_10 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L155] RET assume_abort_if_not(var_1_10 <= 16383) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L156] var_1_11 = __VERIFIER_nondet_short() [L157] CALL assume_abort_if_not(var_1_11 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L157] RET assume_abort_if_not(var_1_11 >= -1) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L158] CALL assume_abort_if_not(var_1_11 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L158] RET assume_abort_if_not(var_1_11 <= 32766) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L159] var_1_12 = __VERIFIER_nondet_short() [L160] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L160] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L161] CALL assume_abort_if_not(var_1_12 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L161] RET assume_abort_if_not(var_1_12 <= 32766) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L162] var_1_17 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L163] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L164] var_1_18 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L165] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L166] var_1_20 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_20 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L167] RET assume_abort_if_not(var_1_20 >= 32767) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L168] CALL assume_abort_if_not(var_1_20 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L168] RET assume_abort_if_not(var_1_20 <= 65535) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L169] var_1_21 = __VERIFIER_nondet_double() [L170] 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_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L170] 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_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L171] var_1_22 = __VERIFIER_nondet_double() [L172] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L172] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L173] var_1_23 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L174] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L175] var_1_25 = __VERIFIER_nondet_char() [L176] CALL assume_abort_if_not(var_1_25 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L176] RET assume_abort_if_not(var_1_25 >= -128) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L177] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L177] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L178] CALL assume_abort_if_not(var_1_25 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L178] RET assume_abort_if_not(var_1_25 != 0) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L179] var_1_31 = __VERIFIER_nondet_ulong() [L180] CALL assume_abort_if_not(var_1_31 >= 536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L180] RET assume_abort_if_not(var_1_31 >= 536870912) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L181] CALL assume_abort_if_not(var_1_31 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L181] RET assume_abort_if_not(var_1_31 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L201] RET updateVariables() [L202] CALL step() [L60] unsigned char stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_2=0, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L61] COND FALSE !(var_1_5 && stepLocal_2) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L64] COND TRUE (var_1_7 - var_1_8) > last_1_var_1_16 [L65] var_1_4 = ((((((last_1_var_1_30 - last_1_var_1_24) + var_1_10)) > ((((((var_1_11 - var_1_12)) > (4)) ? ((var_1_11 - var_1_12)) : (4))))) ? (((last_1_var_1_30 - last_1_var_1_24) + var_1_10)) : ((((((var_1_11 - var_1_12)) > (4)) ? ((var_1_11 - var_1_12)) : (4)))))) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-1, var_1_5=0, var_1_6=0] [L70] unsigned char stepLocal_6 = (var_1_12 / var_1_25) != (last_1_var_1_1 * 16); VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_6=1, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-1, var_1_5=0, var_1_6=0] [L71] COND FALSE !(stepLocal_6 && var_1_6) [L78] var_1_26 = last_1_var_1_29 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-1, var_1_5=0, var_1_6=0] [L80] signed long int stepLocal_5 = var_1_20 / var_1_25; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_5=258, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-1, var_1_5=0, var_1_6=0] [L81] COND TRUE stepLocal_5 > var_1_26 [L82] var_1_24 = var_1_11 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-1, var_1_5=0, var_1_6=0] [L84] unsigned short int stepLocal_7 = var_1_26; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_7=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-1, var_1_5=0, var_1_6=0] [L85] COND TRUE (last_1_var_1_28 + (- var_1_10)) > stepLocal_7 [L86] var_1_28 = (((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) - var_1_26) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-1, var_1_5=0, var_1_6=0] [L88] signed long int stepLocal_4 = 128; [L89] signed short int stepLocal_3 = var_1_4; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_3=-1, stepLocal_4=128, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-1, var_1_5=0, var_1_6=0] [L90] COND FALSE !(var_1_26 <= stepLocal_3) [L97] var_1_19 = var_1_22 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_4=128, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=2, var_1_1=-64, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-1, var_1_5=0, var_1_6=0] [L99] COND TRUE (~ var_1_11) >= (~ var_1_20) [L100] var_1_32 = var_1_17 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_4=128, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=-1, var_1_5=0, var_1_6=0] [L102] COND FALSE !(\read(var_1_6)) [L105] var_1_14 = (((((var_1_4) > (var_1_12)) ? (var_1_4) : (var_1_12))) - (last_1_var_1_14 + var_1_26)) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_4=128, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=99999901, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=-1, var_1_5=0, var_1_6=0] [L107] var_1_13 = (var_1_14 + var_1_12) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_4=128, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=99999902, var_1_14=99999901, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=-1, var_1_5=0, var_1_6=0] [L108] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_4=128, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=99999902, var_1_14=99999901, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=-1, var_1_5=0, var_1_6=0] [L113] signed long int stepLocal_1 = var_1_14; [L114] signed long int stepLocal_0 = var_1_14; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=99999901, stepLocal_1=99999901, stepLocal_4=128, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=99999902, var_1_14=99999901, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=-1, var_1_5=0, var_1_6=0] [L115] COND FALSE !(! (var_1_14 >= var_1_4)) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=99999901, stepLocal_1=99999901, stepLocal_4=128, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=99999902, var_1_14=99999901, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=-1, var_1_5=0, var_1_6=0] [L120] COND FALSE !(var_1_4 >= stepLocal_1) [L123] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=99999901, stepLocal_4=128, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=99999902, var_1_14=99999901, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-1, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=-1, var_1_5=0, var_1_6=0] [L126] var_1_29 = (var_1_1 + 4u) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=99999901, stepLocal_4=128, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=99999902, var_1_14=99999901, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-1, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=3, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=-1, var_1_5=0, var_1_6=0] [L127] COND TRUE (var_1_28 + (var_1_29 + var_1_26)) < var_1_4 [L128] var_1_16 = ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=99999901, stepLocal_4=128, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=99999902, var_1_14=99999901, var_1_16=3, var_1_17=3, var_1_18=0, var_1_19=2, var_1_1=-1, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=3, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=-1, var_1_5=0, var_1_6=0] [L130] unsigned long int stepLocal_9 = var_1_20 - ((((var_1_29) > (var_1_12)) ? (var_1_29) : (var_1_12))); [L131] unsigned char stepLocal_8 = var_1_6; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=99999901, stepLocal_4=128, stepLocal_8=0, stepLocal_9=32764, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=99999902, var_1_14=99999901, var_1_16=3, var_1_17=3, var_1_18=0, var_1_19=2, var_1_1=-1, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=3, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=-1, var_1_5=0, var_1_6=0] [L132] COND FALSE !(stepLocal_8 || var_1_5) [L139] var_1_30 = ((((var_1_26) > (var_1_29)) ? (var_1_26) : (var_1_29))) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=99999901, stepLocal_4=128, stepLocal_9=32764, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=99999902, var_1_14=99999901, var_1_16=3, var_1_17=3, var_1_18=0, var_1_19=2, var_1_1=-1, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=3, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=-1, var_1_5=0, var_1_6=0] [L202] RET step() [L203] CALL, EXPR property() [L193-L194] return (((((((((((((! (var_1_14 >= var_1_4)) ? ((256 != var_1_14) ? (var_1_1 == ((signed long int) (var_1_4 + var_1_14))) : 1) : ((var_1_4 >= var_1_14) ? (var_1_1 == ((signed long int) var_1_14)) : (var_1_1 == ((signed long int) var_1_4)))) && ((var_1_5 && var_1_6) ? (var_1_4 == ((signed short int) ((((last_1_var_1_24) < (-100)) ? (last_1_var_1_24) : (-100))))) : (((var_1_7 - var_1_8) > last_1_var_1_16) ? (var_1_4 == ((signed short int) ((((((last_1_var_1_30 - last_1_var_1_24) + var_1_10)) > ((((((var_1_11 - var_1_12)) > (4)) ? ((var_1_11 - var_1_12)) : (4))))) ? (((last_1_var_1_30 - last_1_var_1_24) + var_1_10)) : ((((((var_1_11 - var_1_12)) > (4)) ? ((var_1_11 - var_1_12)) : (4)))))))) : (var_1_4 == ((signed short int) (last_1_var_1_30 + ((((var_1_10) > (last_1_var_1_24)) ? (var_1_10) : (last_1_var_1_24))))))))) && (var_1_13 == ((unsigned long int) (var_1_14 + var_1_12)))) && (var_1_6 ? (var_1_14 == ((signed long int) (var_1_4 - last_1_var_1_14))) : (var_1_14 == ((signed long int) (((((var_1_4) > (var_1_12)) ? (var_1_4) : (var_1_12))) - (last_1_var_1_14 + var_1_26)))))) && (((var_1_28 + (var_1_29 + var_1_26)) < var_1_4) ? (var_1_16 == ((double) ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))))) : 1)) && ((var_1_26 <= var_1_4) ? (((var_1_26 / (var_1_20 - 25)) >= 128) ? (var_1_19 == ((double) (((((15.25 - var_1_21) < 0 ) ? -(15.25 - var_1_21) : (15.25 - var_1_21))) - (var_1_22 + var_1_23)))) : (var_1_19 == ((double) var_1_22))) : (var_1_19 == ((double) var_1_22)))) && (((var_1_20 / var_1_25) > var_1_26) ? (var_1_24 == ((signed short int) var_1_11)) : 1)) && ((((var_1_12 / var_1_25) != (last_1_var_1_1 * 16)) && var_1_6) ? (var_1_6 ? (var_1_26 == ((unsigned short int) var_1_12)) : (var_1_26 == ((unsigned short int) last_1_var_1_29))) : (var_1_26 == ((unsigned short int) last_1_var_1_29)))) && (var_1_5 ? (((var_1_12 * var_1_13) >= var_1_11) ? (var_1_27 == ((unsigned long int) var_1_26)) : 1) : 1)) && (((last_1_var_1_28 + (- var_1_10)) > var_1_26) ? (var_1_28 == ((signed short int) (((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) - var_1_26))) : 1)) && (var_1_29 == ((unsigned long int) (var_1_1 + 4u)))) && ((var_1_6 || var_1_5) ? (((var_1_20 - ((((var_1_29) > (var_1_12)) ? (var_1_29) : (var_1_12)))) >= var_1_11) ? (var_1_30 == ((unsigned long int) var_1_29)) : (var_1_30 == ((unsigned long int) (((((var_1_20) > (var_1_4)) ? (var_1_20) : (var_1_4))) + ((1000000000u + var_1_31) - var_1_29))))) : (var_1_30 == ((unsigned long int) ((((var_1_26) > (var_1_29)) ? (var_1_26) : (var_1_29))))))) && (((~ var_1_11) >= (~ var_1_20)) ? (var_1_32 == ((double) var_1_17)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=99999902, var_1_14=99999901, var_1_16=3, var_1_17=3, var_1_18=0, var_1_19=2, var_1_1=-1, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=3, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=-1, var_1_5=0, var_1_6=0] [L203] RET, EXPR property() [L203] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=99999902, var_1_14=99999901, var_1_16=3, var_1_17=3, var_1_18=0, var_1_19=2, var_1_1=-1, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=3, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=-1, var_1_5=0, var_1_6=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=99999902, var_1_14=99999901, var_1_16=3, var_1_17=3, var_1_18=0, var_1_19=2, var_1_1=-1, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=3, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=-1, var_1_5=0, var_1_6=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 83 locations, 150 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.9s, OverallIterations: 8, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 810 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 810 mSDsluCounter, 2611 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1610 mSDsCounter, 326 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 880 IncrementalHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 326 mSolverCounterUnsat, 1001 mSDtfsCounter, 880 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=282occurred in iteration=6, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 405 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 1647 NumberOfCodeBlocks, 1647 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1309 ConstructedInterpolants, 0 QuantifiedInterpolants, 19543 SizeOfPredicates, 0 NumberOfNonLiveVariables, 419 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 8786/8832 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 14:07:52,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-25.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 c147c84511e5c0677a9069c27a4d754d19564d6e4b1f08886ba1a76b5d6b51d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:07:54,847 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:07:54,922 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:07:54,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:07:54,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:07:54,947 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:07:54,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:07:54,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:07:54,948 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:07:54,948 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:07:54,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:07:54,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:07:54,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:07:54,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:07:54,949 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:07:54,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:07:54,949 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:07:54,949 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:07:54,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:07:54,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:07:54,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:07:54,951 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:07:54,951 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:07:54,951 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:07:54,951 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:07:54,951 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:07:54,951 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:07:54,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:07:54,951 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:07:54,951 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:07:54,951 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:07:54,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:07:54,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:07:54,951 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:07:54,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:07:54,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:07:54,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:07:54,952 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:07:54,952 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:07:54,952 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:07:54,952 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:07:54,952 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:07:54,952 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:07:54,952 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:07:54,952 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:07:54,953 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 -> c147c84511e5c0677a9069c27a4d754d19564d6e4b1f08886ba1a76b5d6b51d6 [2025-03-08 14:07:55,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:07:55,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:07:55,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:07:55,168 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:07:55,168 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:07:55,169 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-25.i [2025-03-08 14:07:56,301 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e28cf2e80/dae36d98c41446888cf9abe496d07f75/FLAG647d7facc [2025-03-08 14:07:56,510 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:07:56,512 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-25.i [2025-03-08 14:07:56,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e28cf2e80/dae36d98c41446888cf9abe496d07f75/FLAG647d7facc [2025-03-08 14:07:56,538 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e28cf2e80/dae36d98c41446888cf9abe496d07f75 [2025-03-08 14:07:56,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:07:56,541 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:07:56,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:07:56,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:07:56,545 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:07:56,546 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:07:56" (1/1) ... [2025-03-08 14:07:56,547 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52cdbfba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:56, skipping insertion in model container [2025-03-08 14:07:56,547 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:07:56" (1/1) ... [2025-03-08 14:07:56,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:07:56,675 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-25.i[916,929] [2025-03-08 14:07:56,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:07:56,764 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:07:56,772 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-25.i[916,929] [2025-03-08 14:07:56,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:07:56,811 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:07:56,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:56 WrapperNode [2025-03-08 14:07:56,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:07:56,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:07:56,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:07:56,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:07:56,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:56" (1/1) ... [2025-03-08 14:07:56,828 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:56" (1/1) ... [2025-03-08 14:07:56,853 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2025-03-08 14:07:56,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:07:56,854 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:07:56,854 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:07:56,854 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:07:56,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:56" (1/1) ... [2025-03-08 14:07:56,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:56" (1/1) ... [2025-03-08 14:07:56,871 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:56" (1/1) ... [2025-03-08 14:07:56,880 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:07:56,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:56" (1/1) ... [2025-03-08 14:07:56,880 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:56" (1/1) ... [2025-03-08 14:07:56,887 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:56" (1/1) ... [2025-03-08 14:07:56,887 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:56" (1/1) ... [2025-03-08 14:07:56,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:56" (1/1) ... [2025-03-08 14:07:56,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:56" (1/1) ... [2025-03-08 14:07:56,892 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:07:56,893 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:07:56,893 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:07:56,893 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:07:56,893 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:56" (1/1) ... [2025-03-08 14:07:56,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:07:56,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:07:56,920 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:07:56,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:07:56,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:07:56,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:07:56,941 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:07:56,941 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:07:56,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:07:56,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:07:57,022 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:07:57,024 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:08:03,097 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-08 14:08:03,097 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:08:03,104 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:08:03,106 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:08:03,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:08:03 BoogieIcfgContainer [2025-03-08 14:08:03,106 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:08:03,108 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:08:03,108 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:08:03,111 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:08:03,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:07:56" (1/3) ... [2025-03-08 14:08:03,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c7d8cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:08:03, skipping insertion in model container [2025-03-08 14:08:03,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:56" (2/3) ... [2025-03-08 14:08:03,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c7d8cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:08:03, skipping insertion in model container [2025-03-08 14:08:03,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:08:03" (3/3) ... [2025-03-08 14:08:03,115 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-25.i [2025-03-08 14:08:03,125 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:08:03,126 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-25.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:08:03,167 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:08:03,177 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;@7e1da467, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:08:03,177 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:08:03,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 57 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 14:08:03,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 14:08:03,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:08:03,188 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:08:03,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:08:03,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:08:03,192 INFO L85 PathProgramCache]: Analyzing trace with hash 796266895, now seen corresponding path program 1 times [2025-03-08 14:08:03,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:08:03,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928122688] [2025-03-08 14:08:03,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:08:03,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:08:03,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:08:03,205 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:08:03,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 14:08:03,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 14:08:03,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 14:08:03,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:08:03,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:08:03,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:08:03,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:08:03,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 406 proven. 0 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2025-03-08 14:08:03,729 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:08:03,729 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:08:03,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928122688] [2025-03-08 14:08:03,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1928122688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:08:03,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:08:03,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:08:03,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495647369] [2025-03-08 14:08:03,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:08:03,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:08:03,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:08:03,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:08:03,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:08:03,748 INFO L87 Difference]: Start difference. First operand has 83 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 57 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 14:08:03,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:08:03,764 INFO L93 Difference]: Finished difference Result 160 states and 271 transitions. [2025-03-08 14:08:03,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:08:03,766 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 164 [2025-03-08 14:08:03,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:08:03,774 INFO L225 Difference]: With dead ends: 160 [2025-03-08 14:08:03,774 INFO L226 Difference]: Without dead ends: 80 [2025-03-08 14:08:03,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:08:03,778 INFO L435 NwaCegarLoop]: 121 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, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:08:03,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:08:03,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-08 14:08:03,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-08 14:08:03,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 14:08:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 121 transitions. [2025-03-08 14:08:03,817 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 121 transitions. Word has length 164 [2025-03-08 14:08:03,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:08:03,817 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 121 transitions. [2025-03-08 14:08:03,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 14:08:03,818 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 121 transitions. [2025-03-08 14:08:03,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 14:08:03,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:08:03,823 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:08:03,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 14:08:04,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:08:04,024 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:08:04,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:08:04,025 INFO L85 PathProgramCache]: Analyzing trace with hash -675309101, now seen corresponding path program 1 times [2025-03-08 14:08:04,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:08:04,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491910548] [2025-03-08 14:08:04,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:08:04,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:08:04,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:08:04,027 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:08:04,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 14:08:04,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 14:08:04,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 14:08:04,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:08:04,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:08:04,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 14:08:04,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:08:04,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 14:08:04,646 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:08:04,646 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:08:04,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1491910548] [2025-03-08 14:08:04,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1491910548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:08:04,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:08:04,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:08:04,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686192791] [2025-03-08 14:08:04,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:08:04,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:08:04,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:08:04,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:08:04,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:08:04,649 INFO L87 Difference]: Start difference. First operand 80 states and 121 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 14:08:08,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:08:11,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:08:11,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:08:11,090 INFO L93 Difference]: Finished difference Result 188 states and 285 transitions. [2025-03-08 14:08:11,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:08:11,136 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 164 [2025-03-08 14:08:11,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:08:11,137 INFO L225 Difference]: With dead ends: 188 [2025-03-08 14:08:11,137 INFO L226 Difference]: Without dead ends: 111 [2025-03-08 14:08:11,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:08:11,138 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 36 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2025-03-08 14:08:11,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 230 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2025-03-08 14:08:11,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-08 14:08:11,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2025-03-08 14:08:11,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 76 states have internal predecessors, (107), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 14:08:11,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2025-03-08 14:08:11,155 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 164 [2025-03-08 14:08:11,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:08:11,156 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2025-03-08 14:08:11,156 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 14:08:11,156 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2025-03-08 14:08:11,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 14:08:11,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:08:11,161 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:08:11,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 14:08:11,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:08:11,361 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:08:11,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:08:11,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1889471889, now seen corresponding path program 1 times [2025-03-08 14:08:11,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:08:11,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847778895] [2025-03-08 14:08:11,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:08:11,363 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:08:11,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:08:11,366 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:08:11,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 14:08:11,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 14:08:11,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 14:08:11,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:08:11,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:08:11,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 14:08:11,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:08:13,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 269 proven. 60 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2025-03-08 14:08:13,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:08:14,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 14:08:14,436 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:08:14,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847778895] [2025-03-08 14:08:14,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847778895] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 14:08:14,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:08:14,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-08 14:08:14,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383005379] [2025-03-08 14:08:14,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:08:14,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 14:08:14,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:08:14,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 14:08:14,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 14:08:14,440 INFO L87 Difference]: Start difference. First operand 102 states and 155 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 14:08:18,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:08:20,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:08:20,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:08:20,284 INFO L93 Difference]: Finished difference Result 256 states and 387 transitions. [2025-03-08 14:08:20,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:08:20,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-03-08 14:08:20,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:08:20,328 INFO L225 Difference]: With dead ends: 256 [2025-03-08 14:08:20,328 INFO L226 Difference]: Without dead ends: 157 [2025-03-08 14:08:20,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-08 14:08:20,329 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 43 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-03-08 14:08:20,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 373 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2025-03-08 14:08:20,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-08 14:08:20,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 146. [2025-03-08 14:08:20,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 118 states have internal predecessors, (164), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 14:08:20,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 216 transitions. [2025-03-08 14:08:20,352 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 216 transitions. Word has length 165 [2025-03-08 14:08:20,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:08:20,353 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 216 transitions. [2025-03-08 14:08:20,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 14:08:20,353 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 216 transitions. [2025-03-08 14:08:20,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 14:08:20,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:08:20,354 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:08:20,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 14:08:20,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:08:20,555 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:08:20,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:08:20,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1899936782, now seen corresponding path program 1 times [2025-03-08 14:08:20,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:08:20,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318194391] [2025-03-08 14:08:20,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:08:20,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:08:20,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:08:20,559 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:08:20,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 14:08:20,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 14:08:21,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 14:08:21,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:08:21,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:08:21,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 14:08:21,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:08:24,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-03-08 14:08:24,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:08:25,686 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:08:25,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318194391] [2025-03-08 14:08:25,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318194391] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:08:25,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [452498580] [2025-03-08 14:08:25,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:08:25,687 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 14:08:25,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 14:08:25,708 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 14:08:25,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-08 14:08:25,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 14:08:27,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 14:08:27,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:08:27,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:08:27,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 14:08:27,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:08:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-03-08 14:08:30,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:08:31,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [452498580] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:08:31,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 14:08:31,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2025-03-08 14:08:31,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535146175] [2025-03-08 14:08:31,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 14:08:31,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 14:08:31,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:08:31,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 14:08:31,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-08 14:08:31,478 INFO L87 Difference]: Start difference. First operand 146 states and 216 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 14:08:37,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 14:08:42,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 14:08:46,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 14:08:51,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:08:55,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:08:56,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:08:56,171 INFO L93 Difference]: Finished difference Result 505 states and 746 transitions. [2025-03-08 14:08:56,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 14:08:56,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 165 [2025-03-08 14:08:56,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:08:56,176 INFO L225 Difference]: With dead ends: 505 [2025-03-08 14:08:56,176 INFO L226 Difference]: Without dead ends: 362 [2025-03-08 14:08:56,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-03-08 14:08:56,177 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 251 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 77 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:08:56,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 672 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 357 Invalid, 3 Unknown, 0 Unchecked, 24.0s Time] [2025-03-08 14:08:56,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-08 14:08:56,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 232. [2025-03-08 14:08:56,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 176 states have (on average 1.3693181818181819) internal successors, (241), 177 states have internal predecessors, (241), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 14:08:56,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 341 transitions. [2025-03-08 14:08:56,212 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 341 transitions. Word has length 165 [2025-03-08 14:08:56,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:08:56,213 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 341 transitions. [2025-03-08 14:08:56,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 14:08:56,213 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 341 transitions. [2025-03-08 14:08:56,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 14:08:56,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:08:56,214 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:08:56,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-08 14:08:56,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-03-08 14:08:56,615 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-08 14:08:56,615 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:08:56,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:08:56,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1911485649, now seen corresponding path program 1 times [2025-03-08 14:08:56,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:08:56,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139503266] [2025-03-08 14:08:56,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:08:56,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:08:56,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:08:56,620 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:08:56,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-08 14:08:56,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 14:08:57,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 14:08:57,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:08:57,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:08:57,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 14:08:57,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:09:01,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-03-08 14:09:01,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:09:03,447 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:09:03,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139503266] [2025-03-08 14:09:03,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139503266] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:09:03,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [194680542] [2025-03-08 14:09:03,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:09:03,447 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 14:09:03,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 14:09:03,449 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 14:09:03,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-03-08 14:09:03,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 14:09:05,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 14:09:05,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:09:05,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:09:05,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 14:09:05,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:09:08,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-03-08 14:09:08,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:09:09,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [194680542] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:09:09,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 14:09:09,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2025-03-08 14:09:09,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78076314] [2025-03-08 14:09:09,922 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 14:09:09,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 14:09:09,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:09:09,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 14:09:09,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-08 14:09:09,924 INFO L87 Difference]: Start difference. First operand 232 states and 341 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24)