./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-23.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_50-1loop_file-23.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 f462d80663b78a29790b023038a77faf5713782a583a5f5f0d8b8d3fab1b2d32 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:48:05,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:48:06,020 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:48:06,024 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:48:06,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:48:06,049 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:48:06,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:48:06,051 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:48:06,052 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:48:06,052 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:48:06,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:48:06,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:48:06,053 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:48:06,053 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:48:06,053 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:48:06,054 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:48:06,054 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:48:06,054 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:48:06,054 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:48:06,054 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:48:06,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:48:06,054 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:48:06,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:48:06,054 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:48:06,055 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:48:06,055 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:48:06,055 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:48:06,055 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:48:06,055 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:48:06,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:48:06,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:48:06,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:48:06,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:48:06,056 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:48:06,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:48:06,056 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:48:06,056 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:48:06,056 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:48:06,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:48:06,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:48:06,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:48:06,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:48:06,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:48:06,057 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 -> f462d80663b78a29790b023038a77faf5713782a583a5f5f0d8b8d3fab1b2d32 [2025-03-17 03:48:06,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:48:06,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:48:06,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:48:06,315 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:48:06,315 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:48:06,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-23.i [2025-03-17 03:48:07,599 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8d1271ae/ff90af91095a403691130f4d6d2d6afe/FLAG439af06a3 [2025-03-17 03:48:07,832 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:48:07,833 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-23.i [2025-03-17 03:48:07,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8d1271ae/ff90af91095a403691130f4d6d2d6afe/FLAG439af06a3 [2025-03-17 03:48:07,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8d1271ae/ff90af91095a403691130f4d6d2d6afe [2025-03-17 03:48:07,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:48:07,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:48:07,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:48:07,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:48:07,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:48:07,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:48:07" (1/1) ... [2025-03-17 03:48:07,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:07, skipping insertion in model container [2025-03-17 03:48:07,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:48:07" (1/1) ... [2025-03-17 03:48:07,884 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:48:08,002 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_50-1loop_file-23.i[915,928] [2025-03-17 03:48:08,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:48:08,079 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:48:08,088 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_50-1loop_file-23.i[915,928] [2025-03-17 03:48:08,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:48:08,144 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:48:08,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:08 WrapperNode [2025-03-17 03:48:08,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:48:08,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:48:08,147 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:48:08,147 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:48:08,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:08" (1/1) ... [2025-03-17 03:48:08,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:08" (1/1) ... [2025-03-17 03:48:08,201 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2025-03-17 03:48:08,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:48:08,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:48:08,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:48:08,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:48:08,217 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:08" (1/1) ... [2025-03-17 03:48:08,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:08" (1/1) ... [2025-03-17 03:48:08,224 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:08" (1/1) ... [2025-03-17 03:48:08,245 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-17 03:48:08,246 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:08" (1/1) ... [2025-03-17 03:48:08,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:08" (1/1) ... [2025-03-17 03:48:08,257 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:08" (1/1) ... [2025-03-17 03:48:08,259 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:08" (1/1) ... [2025-03-17 03:48:08,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:08" (1/1) ... [2025-03-17 03:48:08,265 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:08" (1/1) ... [2025-03-17 03:48:08,269 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:48:08,270 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:48:08,270 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:48:08,271 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:48:08,272 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:08" (1/1) ... [2025-03-17 03:48:08,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:48:08,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:48:08,300 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-17 03:48:08,306 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-17 03:48:08,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:48:08,322 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:48:08,323 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:48:08,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:48:08,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:48:08,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:48:08,371 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:48:08,373 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:48:08,682 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-17 03:48:08,682 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:48:08,697 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:48:08,697 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:48:08,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:48:08 BoogieIcfgContainer [2025-03-17 03:48:08,697 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:48:08,699 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:48:08,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:48:08,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:48:08,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:48:07" (1/3) ... [2025-03-17 03:48:08,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b372c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:48:08, skipping insertion in model container [2025-03-17 03:48:08,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:08" (2/3) ... [2025-03-17 03:48:08,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b372c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:48:08, skipping insertion in model container [2025-03-17 03:48:08,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:48:08" (3/3) ... [2025-03-17 03:48:08,710 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-23.i [2025-03-17 03:48:08,723 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:48:08,727 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-23.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:48:08,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:48:08,798 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;@585fd479, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:48:08,799 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:48:08,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 03:48:08,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 03:48:08,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:48:08,813 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:48:08,813 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:48:08,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:48:08,819 INFO L85 PathProgramCache]: Analyzing trace with hash -370583774, now seen corresponding path program 1 times [2025-03-17 03:48:08,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:48:08,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549884216] [2025-03-17 03:48:08,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:48:08,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:48:08,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 03:48:08,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 03:48:08,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:48:08,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:48:09,088 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-17 03:48:09,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:48:09,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549884216] [2025-03-17 03:48:09,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549884216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:48:09,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134291215] [2025-03-17 03:48:09,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:48:09,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:48:09,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:48:09,094 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-17 03:48:09,096 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-17 03:48:09,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 03:48:09,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 03:48:09,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:48:09,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:48:09,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:48:09,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:48:09,276 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-17 03:48:09,277 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:48:09,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134291215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:48:09,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:48:09,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:48:09,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499218895] [2025-03-17 03:48:09,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:48:09,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:48:09,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:48:09,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:48:09,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:48:09,306 INFO L87 Difference]: Start difference. First operand has 59 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 03:48:09,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:48:09,324 INFO L93 Difference]: Finished difference Result 117 states and 202 transitions. [2025-03-17 03:48:09,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:48:09,329 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 131 [2025-03-17 03:48:09,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:48:09,335 INFO L225 Difference]: With dead ends: 117 [2025-03-17 03:48:09,335 INFO L226 Difference]: Without dead ends: 57 [2025-03-17 03:48:09,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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-17 03:48:09,341 INFO L435 NwaCegarLoop]: 89 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, 89 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-17 03:48:09,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:48:09,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-17 03:48:09,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-17 03:48:09,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 03:48:09,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 87 transitions. [2025-03-17 03:48:09,374 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 87 transitions. Word has length 131 [2025-03-17 03:48:09,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:48:09,374 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 87 transitions. [2025-03-17 03:48:09,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 03:48:09,374 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 87 transitions. [2025-03-17 03:48:09,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 03:48:09,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:48:09,381 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:48:09,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 03:48:09,587 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-17 03:48:09,588 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:48:09,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:48:09,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1492752567, now seen corresponding path program 1 times [2025-03-17 03:48:09,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:48:09,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778549411] [2025-03-17 03:48:09,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:48:09,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:48:09,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 03:48:09,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 03:48:09,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:48:09,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:48:09,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [325256014] [2025-03-17 03:48:09,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:48:09,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:48:09,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:48:09,753 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-17 03:48:09,754 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-17 03:48:09,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 03:48:09,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 03:48:09,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:48:09,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:48:09,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 03:48:09,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:48:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 438 proven. 9 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2025-03-17 03:48:11,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:48:32,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:48:32,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778549411] [2025-03-17 03:48:32,012 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 03:48:32,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325256014] [2025-03-17 03:48:32,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325256014] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:48:32,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:48:32,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2025-03-17 03:48:32,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393610999] [2025-03-17 03:48:32,012 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 03:48:32,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 03:48:32,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:48:32,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 03:48:32,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=563, Unknown=0, NotChecked=0, Total=756 [2025-03-17 03:48:32,015 INFO L87 Difference]: Start difference. First operand 57 states and 87 transitions. Second operand has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-17 03:48:33,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:48:33,598 INFO L93 Difference]: Finished difference Result 204 states and 296 transitions. [2025-03-17 03:48:33,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 03:48:33,600 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21) Word has length 131 [2025-03-17 03:48:33,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:48:33,602 INFO L225 Difference]: With dead ends: 204 [2025-03-17 03:48:33,602 INFO L226 Difference]: Without dead ends: 148 [2025-03-17 03:48:33,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=578, Invalid=1678, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 03:48:33,604 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 271 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:48:33,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 445 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 03:48:33,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-17 03:48:33,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 122. [2025-03-17 03:48:33,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 03:48:33,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 175 transitions. [2025-03-17 03:48:33,628 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 175 transitions. Word has length 131 [2025-03-17 03:48:33,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:48:33,629 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 175 transitions. [2025-03-17 03:48:33,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-17 03:48:33,633 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 175 transitions. [2025-03-17 03:48:33,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 03:48:33,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:48:33,635 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:48:33,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 03:48:33,836 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,SelfDestructingSolverStorable1 [2025-03-17 03:48:33,836 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:48:33,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:48:33,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1492722776, now seen corresponding path program 1 times [2025-03-17 03:48:33,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:48:33,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612216284] [2025-03-17 03:48:33,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:48:33,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:48:33,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 03:48:33,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 03:48:33,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:48:33,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:48:33,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1222362268] [2025-03-17 03:48:33,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:48:33,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:48:33,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:48:33,973 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:48:33,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 03:48:34,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 03:48:34,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 03:48:34,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:48:34,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:48:34,189 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:48:34,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 03:48:34,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 03:48:34,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:48:34,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:48:34,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:48:34,283 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:48:34,284 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:48:34,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 03:48:34,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:48:34,491 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 03:48:34,564 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:48:34,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:48:34 BoogieIcfgContainer [2025-03-17 03:48:34,568 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:48:34,569 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:48:34,569 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:48:34,569 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:48:34,570 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:48:08" (3/4) ... [2025-03-17 03:48:34,571 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:48:34,572 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:48:34,573 INFO L158 Benchmark]: Toolchain (without parser) took 26715.31ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 111.2MB in the beginning and 189.9MB in the end (delta: -78.7MB). Peak memory consumption was 122.8MB. Max. memory is 16.1GB. [2025-03-17 03:48:34,573 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:48:34,574 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.89ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 97.0MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:48:34,574 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.48ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 93.0MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:48:34,574 INFO L158 Benchmark]: Boogie Preprocessor took 63.37ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 87.7MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:48:34,574 INFO L158 Benchmark]: IcfgBuilder took 427.10ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 63.9MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 03:48:34,575 INFO L158 Benchmark]: TraceAbstraction took 25868.72ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 62.9MB in the beginning and 189.9MB in the end (delta: -127.0MB). Peak memory consumption was 80.9MB. Max. memory is 16.1GB. [2025-03-17 03:48:34,575 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 343.9MB. Free memory was 189.9MB in the beginning and 189.9MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:48:34,576 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.13ms. Allocated memory is still 201.3MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.89ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 97.0MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.48ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 93.0MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.37ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 87.7MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 427.10ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 63.9MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 25868.72ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 62.9MB in the beginning and 189.9MB in the end (delta: -127.0MB). Peak memory consumption was 80.9MB. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 343.9MB. Free memory was 189.9MB in the beginning and 189.9MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryFLOATComparisonOperation at line 110, overapproximation of someBinaryFLOATComparisonOperation at line 135, overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 112, overapproximation of someUnaryDOUBLEoperation at line 41, overapproximation of someBinaryDOUBLEComparisonOperation at line 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 66. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 1.4; [L26] float var_1_7 = 9.25; [L27] float var_1_8 = 1.2; [L28] float var_1_9 = 0.0; [L29] float var_1_10 = 3.1; [L30] float var_1_11 = 500.5; [L31] signed long int var_1_12 = 0; [L32] unsigned char var_1_13 = 10; [L33] unsigned char var_1_14 = 8; [L34] unsigned char var_1_17 = 64; [L35] unsigned long int var_1_18 = 25; [L36] signed char var_1_19 = -100; [L37] signed short int var_1_20 = -4; [L38] unsigned short int var_1_21 = 200; [L39] unsigned short int var_1_22 = 54878; [L40] double var_1_23 = 9999.8; [L41] float var_1_24 = -0.25; [L42] signed char var_1_25 = 50; [L43] signed char last_1_var_1_19 = -100; [L139] isInitial = 1 [L140] FCALL initially() [L141] int k_loop; [L142] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L142] COND TRUE k_loop < 1 [L143] CALL updateLastVariables() [L132] last_1_var_1_19 = var_1_19 [L143] RET updateLastVariables() [L144] CALL updateVariables() [L97] var_1_2 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L98] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L99] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L99] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L100] var_1_3 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L101] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L102] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L102] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L103] var_1_7 = __VERIFIER_nondet_float() [L104] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_8=6/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_8=6/5, var_1_9=0] [L104] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_8=6/5, var_1_9=0] [L105] var_1_8 = __VERIFIER_nondet_float() [L106] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_9=0] [L106] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_9=0] [L107] var_1_9 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_9 >= 4611686.018427382800e+12F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L108] RET assume_abort_if_not((var_1_9 >= 4611686.018427382800e+12F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L109] var_1_10 = __VERIFIER_nondet_float() [L110] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L110] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=-100, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L111] var_1_11 = __VERIFIER_nondet_float() [L112] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L112] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L113] var_1_13 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L114] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L115] CALL assume_abort_if_not(var_1_13 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L115] RET assume_abort_if_not(var_1_13 <= 64) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L116] var_1_14 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L117] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L118] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L118] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L119] var_1_17 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L120] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L121] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L121] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L122] CALL assume_abort_if_not(var_1_17 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L122] RET assume_abort_if_not(var_1_17 != 127) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L123] var_1_20 = __VERIFIER_nondet_short() [L124] CALL assume_abort_if_not(var_1_20 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L124] RET assume_abort_if_not(var_1_20 >= -32768) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L125] CALL assume_abort_if_not(var_1_20 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L125] RET assume_abort_if_not(var_1_20 <= 32767) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L126] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L126] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L127] var_1_22 = __VERIFIER_nondet_ushort() [L128] CALL assume_abort_if_not(var_1_22 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L128] RET assume_abort_if_not(var_1_22 >= 32767) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L129] CALL assume_abort_if_not(var_1_22 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L129] RET assume_abort_if_not(var_1_22 <= 65534) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L144] RET updateVariables() [L145] CALL step() [L47] COND TRUE \read(var_1_2) [L48] var_1_1 = var_1_3 VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L50] signed long int stepLocal_4 = 5; VAL [isInitial=1, last_1_var_1_19=-100, stepLocal_4=5, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L51] COND TRUE stepLocal_4 <= var_1_17 [L52] var_1_21 = (var_1_22 - var_1_17) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=32644, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L62] var_1_23 = var_1_10 [L63] var_1_24 = 31.75f [L64] var_1_25 = -5 [L65] unsigned char stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_19=-100, stepLocal_0=0, var_1_10=2, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=32644, var_1_22=163839, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=1, var_1_3=0, var_1_4=7/5] [L66] COND TRUE (var_1_23 <= var_1_23) || stepLocal_0 [L67] var_1_4 = ((((31.5f) > (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) ? (31.5f) : (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8)))))) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=2, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=32644, var_1_22=163839, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L71] signed long int stepLocal_3 = (200 - var_1_13) - var_1_14; [L72] unsigned char stepLocal_2 = var_1_13; [L73] unsigned char stepLocal_1 = var_1_13; VAL [isInitial=1, last_1_var_1_19=-100, stepLocal_1=64, stepLocal_2=64, stepLocal_3=9, var_1_10=2, var_1_12=0, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=32644, var_1_22=163839, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L74] COND TRUE stepLocal_3 != var_1_25 [L75] var_1_12 = (var_1_13 + ((((var_1_14) < (var_1_21)) ? (var_1_14) : (var_1_21)))) VAL [isInitial=1, last_1_var_1_19=-100, stepLocal_1=64, stepLocal_2=64, var_1_10=2, var_1_12=191, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=32644, var_1_22=163839, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L87] COND TRUE (- (var_1_13 / var_1_17)) > var_1_25 [L88] var_1_18 = var_1_13 VAL [isInitial=1, last_1_var_1_19=-100, stepLocal_1=64, stepLocal_2=64, var_1_10=2, var_1_12=191, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=64, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=32644, var_1_22=163839, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L90] COND FALSE !((last_1_var_1_19 / ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20)))) > var_1_21) [L93] var_1_19 = var_1_17 VAL [isInitial=1, last_1_var_1_19=-100, stepLocal_1=64, stepLocal_2=64, var_1_10=2, var_1_12=191, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=64, var_1_19=123, var_1_1=0, var_1_20=101, var_1_21=32644, var_1_22=163839, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L145] RET step() [L146] CALL, EXPR property() [L135-L136] return ((((((((var_1_2 ? (var_1_1 == ((unsigned char) var_1_3)) : 1) && (((var_1_23 <= var_1_23) || var_1_1) ? (var_1_4 == ((float) ((((31.5f) > (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) ? (31.5f) : (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8)))))))) : (var_1_4 == ((float) ((var_1_9 - var_1_10) - var_1_11))))) && ((((200 - var_1_13) - var_1_14) != var_1_25) ? (var_1_12 == ((signed long int) (var_1_13 + ((((var_1_14) < (var_1_21)) ? (var_1_14) : (var_1_21)))))) : (((var_1_25 / (128 - var_1_17)) < var_1_13) ? ((var_1_13 >= var_1_25) ? (var_1_12 == ((signed long int) var_1_14)) : (var_1_12 == ((signed long int) var_1_17))) : (var_1_12 == ((signed long int) var_1_17))))) && (((- (var_1_13 / var_1_17)) > var_1_25) ? (var_1_18 == ((unsigned long int) var_1_13)) : 1)) && (((last_1_var_1_19 / ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20)))) > var_1_21) ? (var_1_19 == ((signed char) ((((var_1_17) > (var_1_13)) ? (var_1_17) : (var_1_13))))) : (var_1_19 == ((signed char) var_1_17)))) && ((5 <= var_1_17) ? (var_1_21 == ((unsigned short int) (var_1_22 - var_1_17))) : (var_1_1 ? (var_1_1 ? (var_1_21 == ((unsigned short int) var_1_17)) : (var_1_21 == ((unsigned short int) var_1_17))) : 1))) && (var_1_23 == ((double) var_1_10))) && (var_1_24 == ((float) 31.75f))) && (var_1_25 == ((signed char) -5)) ; [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=2, var_1_12=191, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=64, var_1_19=123, var_1_1=0, var_1_20=101, var_1_21=32644, var_1_22=163839, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=2, var_1_12=191, var_1_13=64, var_1_14=127, var_1_17=123, var_1_18=64, var_1_19=123, var_1_1=0, var_1_20=101, var_1_21=32644, var_1_22=163839, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 112 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.7s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 271 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 271 mSDsluCounter, 534 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 394 mSDsCounter, 159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 399 IncrementalHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 159 mSolverCounterUnsat, 140 mSDtfsCounter, 399 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 307 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=2, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 26 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 22.2s InterpolantComputationTime, 786 NumberOfCodeBlocks, 786 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 390 ConstructedInterpolants, 0 QuantifiedInterpolants, 1463 SizeOfPredicates, 6 NumberOfNonLiveVariables, 638 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 2471/2520 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-17 03:48:34,621 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_50-1loop_file-23.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 f462d80663b78a29790b023038a77faf5713782a583a5f5f0d8b8d3fab1b2d32 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:48:36,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:48:36,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:48:36,737 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:48:36,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:48:36,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:48:36,762 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:48:36,762 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:48:36,763 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:48:36,763 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:48:36,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:48:36,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:48:36,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:48:36,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:48:36,764 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:48:36,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:48:36,765 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:48:36,765 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:48:36,765 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:48:36,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:48:36,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:48:36,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:48:36,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:48:36,765 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:48:36,765 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:48:36,765 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:48:36,766 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:48:36,766 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:48:36,766 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:48:36,766 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:48:36,766 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:48:36,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:48:36,766 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:48:36,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:48:36,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:48:36,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:48:36,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:48:36,767 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:48:36,767 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:48:36,767 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:48:36,767 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:48:36,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:48:36,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:48:36,768 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:48:36,768 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:48:36,768 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 -> f462d80663b78a29790b023038a77faf5713782a583a5f5f0d8b8d3fab1b2d32 [2025-03-17 03:48:37,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:48:37,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:48:37,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:48:37,067 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:48:37,067 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:48:37,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-23.i [2025-03-17 03:48:38,361 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1795eef89/e97ec20964544ed69029c75221dc1726/FLAG96ea602a5 [2025-03-17 03:48:38,609 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:48:38,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-23.i [2025-03-17 03:48:38,617 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1795eef89/e97ec20964544ed69029c75221dc1726/FLAG96ea602a5 [2025-03-17 03:48:38,632 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1795eef89/e97ec20964544ed69029c75221dc1726 [2025-03-17 03:48:38,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:48:38,635 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:48:38,637 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:48:38,638 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:48:38,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:48:38,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:48:38" (1/1) ... [2025-03-17 03:48:38,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56498984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:38, skipping insertion in model container [2025-03-17 03:48:38,642 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:48:38" (1/1) ... [2025-03-17 03:48:38,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:48:38,775 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_50-1loop_file-23.i[915,928] [2025-03-17 03:48:38,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:48:38,854 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:48:38,863 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_50-1loop_file-23.i[915,928] [2025-03-17 03:48:38,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:48:38,916 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:48:38,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:38 WrapperNode [2025-03-17 03:48:38,918 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:48:38,919 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:48:38,919 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:48:38,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:48:38,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:38" (1/1) ... [2025-03-17 03:48:38,936 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:38" (1/1) ... [2025-03-17 03:48:38,956 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2025-03-17 03:48:38,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:48:38,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:48:38,957 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:48:38,957 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:48:38,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:38" (1/1) ... [2025-03-17 03:48:38,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:38" (1/1) ... [2025-03-17 03:48:38,969 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:38" (1/1) ... [2025-03-17 03:48:38,982 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-17 03:48:38,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:38" (1/1) ... [2025-03-17 03:48:38,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:38" (1/1) ... [2025-03-17 03:48:38,992 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:38" (1/1) ... [2025-03-17 03:48:38,993 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:38" (1/1) ... [2025-03-17 03:48:38,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:38" (1/1) ... [2025-03-17 03:48:38,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:38" (1/1) ... [2025-03-17 03:48:38,998 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:48:38,999 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:48:38,999 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:48:38,999 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:48:39,002 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:38" (1/1) ... [2025-03-17 03:48:39,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:48:39,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:48:39,043 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-17 03:48:39,048 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-17 03:48:39,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:48:39,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:48:39,069 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:48:39,069 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:48:39,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:48:39,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:48:39,132 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:48:39,134 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:48:40,877 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-17 03:48:40,877 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:48:40,885 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:48:40,885 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:48:40,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:48:40 BoogieIcfgContainer [2025-03-17 03:48:40,886 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:48:40,896 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:48:40,896 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:48:40,899 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:48:40,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:48:38" (1/3) ... [2025-03-17 03:48:40,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7936ac07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:48:40, skipping insertion in model container [2025-03-17 03:48:40,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:38" (2/3) ... [2025-03-17 03:48:40,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7936ac07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:48:40, skipping insertion in model container [2025-03-17 03:48:40,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:48:40" (3/3) ... [2025-03-17 03:48:40,900 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-23.i [2025-03-17 03:48:40,911 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:48:40,912 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-23.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:48:40,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:48:40,957 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;@31924b26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:48:40,957 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:48:40,960 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 03:48:40,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 03:48:40,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:48:40,967 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:48:40,967 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:48:40,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:48:40,970 INFO L85 PathProgramCache]: Analyzing trace with hash -370583774, now seen corresponding path program 1 times [2025-03-17 03:48:40,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:48:40,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1907895950] [2025-03-17 03:48:40,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:48:40,978 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-17 03:48:40,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:48:40,980 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-17 03:48:40,981 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-17 03:48:41,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 03:48:41,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 03:48:41,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:48:41,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:48:41,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:48:41,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:48:41,311 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2025-03-17 03:48:41,312 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:48:41,312 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:48:41,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1907895950] [2025-03-17 03:48:41,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1907895950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:48:41,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:48:41,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:48:41,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808977809] [2025-03-17 03:48:41,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:48:41,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:48:41,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:48:41,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:48:41,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:48:41,336 INFO L87 Difference]: Start difference. First operand has 59 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 03:48:41,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:48:41,358 INFO L93 Difference]: Finished difference Result 117 states and 202 transitions. [2025-03-17 03:48:41,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:48:41,360 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 131 [2025-03-17 03:48:41,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:48:41,368 INFO L225 Difference]: With dead ends: 117 [2025-03-17 03:48:41,368 INFO L226 Difference]: Without dead ends: 57 [2025-03-17 03:48:41,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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-17 03:48:41,372 INFO L435 NwaCegarLoop]: 89 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, 89 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-17 03:48:41,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:48:41,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-17 03:48:41,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-17 03:48:41,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 03:48:41,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 87 transitions. [2025-03-17 03:48:41,411 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 87 transitions. Word has length 131 [2025-03-17 03:48:41,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:48:41,411 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 87 transitions. [2025-03-17 03:48:41,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 03:48:41,413 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 87 transitions. [2025-03-17 03:48:41,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 03:48:41,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:48:41,416 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:48:41,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-17 03:48:41,617 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-17 03:48:41,618 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:48:41,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:48:41,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1492752567, now seen corresponding path program 1 times [2025-03-17 03:48:41,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:48:41,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549732770] [2025-03-17 03:48:41,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:48:41,620 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-17 03:48:41,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:48:41,622 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-17 03:48:41,624 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-17 03:48:41,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 03:48:41,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 03:48:41,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:48:41,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:48:41,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 03:48:41,955 INFO L279 TraceCheckSpWp]: Computing forward predicates...