./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-91.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-91.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 208f44a9e9f2438986e071a7e09693363ee28f0f67d864c3fa3df50951cdc9e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:52:33,124 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:52:33,179 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:52:33,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:52:33,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:52:33,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:52:33,208 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:52:33,208 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:52:33,209 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:52:33,209 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:52:33,210 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:52:33,210 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:52:33,210 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:52:33,210 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:52:33,210 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:52:33,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:52:33,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:52:33,211 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:52:33,211 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:52:33,211 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:52:33,211 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:52:33,211 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:52:33,211 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:52:33,211 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:52:33,211 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:52:33,211 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:52:33,212 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:52:33,212 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:52:33,212 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:52:33,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:52:33,212 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:52:33,212 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:52:33,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:52:33,212 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:52:33,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:52:33,213 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:52:33,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:52:33,213 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:52:33,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:52:33,213 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:52:33,213 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:52:33,213 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:52:33,213 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:52:33,213 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 -> 208f44a9e9f2438986e071a7e09693363ee28f0f67d864c3fa3df50951cdc9e6 [2025-03-03 22:52:33,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:52:33,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:52:33,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:52:33,464 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:52:33,464 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:52:33,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-91.i [2025-03-03 22:52:34,620 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da5578749/68414c24321147fe9af31fe9fa599d22/FLAG03ddc433d [2025-03-03 22:52:34,906 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:52:34,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-91.i [2025-03-03 22:52:34,921 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da5578749/68414c24321147fe9af31fe9fa599d22/FLAG03ddc433d [2025-03-03 22:52:34,935 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da5578749/68414c24321147fe9af31fe9fa599d22 [2025-03-03 22:52:34,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:52:34,939 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:52:34,940 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:52:34,940 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:52:34,943 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:52:34,944 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:52:34" (1/1) ... [2025-03-03 22:52:34,944 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d80931f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:34, skipping insertion in model container [2025-03-03 22:52:34,945 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:52:34" (1/1) ... [2025-03-03 22:52:34,965 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:52:35,065 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-91.i[916,929] [2025-03-03 22:52:35,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:52:35,146 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:52:35,152 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-91.i[916,929] [2025-03-03 22:52:35,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:52:35,192 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:52:35,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:35 WrapperNode [2025-03-03 22:52:35,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:52:35,195 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:52:35,195 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:52:35,195 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:52:35,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:35" (1/1) ... [2025-03-03 22:52:35,210 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:35" (1/1) ... [2025-03-03 22:52:35,252 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 188 [2025-03-03 22:52:35,253 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:52:35,253 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:52:35,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:52:35,254 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:52:35,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:35" (1/1) ... [2025-03-03 22:52:35,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:35" (1/1) ... [2025-03-03 22:52:35,268 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:35" (1/1) ... [2025-03-03 22:52:35,295 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:52:35,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:35" (1/1) ... [2025-03-03 22:52:35,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:35" (1/1) ... [2025-03-03 22:52:35,306 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:35" (1/1) ... [2025-03-03 22:52:35,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:35" (1/1) ... [2025-03-03 22:52:35,310 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:35" (1/1) ... [2025-03-03 22:52:35,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:35" (1/1) ... [2025-03-03 22:52:35,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:52:35,317 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:52:35,317 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:52:35,317 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:52:35,318 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:35" (1/1) ... [2025-03-03 22:52:35,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:52:35,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:52:35,347 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:52:35,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:52:35,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:52:35,369 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:52:35,369 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:52:35,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:52:35,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:52:35,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:52:35,435 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:52:35,437 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:52:35,805 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-03 22:52:35,805 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:52:35,815 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:52:35,816 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:52:35,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:52:35 BoogieIcfgContainer [2025-03-03 22:52:35,817 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:52:35,818 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:52:35,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:52:35,822 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:52:35,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:52:34" (1/3) ... [2025-03-03 22:52:35,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19413a45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:52:35, skipping insertion in model container [2025-03-03 22:52:35,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:35" (2/3) ... [2025-03-03 22:52:35,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19413a45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:52:35, skipping insertion in model container [2025-03-03 22:52:35,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:52:35" (3/3) ... [2025-03-03 22:52:35,825 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-91.i [2025-03-03 22:52:35,836 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:52:35,839 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-91.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:52:35,881 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:52:35,892 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;@10e0ee51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:52:35,892 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:52:35,895 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 22:52:35,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 22:52:35,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:52:35,907 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:52:35,907 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:52:35,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:52:35,911 INFO L85 PathProgramCache]: Analyzing trace with hash 670360973, now seen corresponding path program 1 times [2025-03-03 22:52:35,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:52:35,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791995438] [2025-03-03 22:52:35,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:52:35,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:52:35,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 22:52:36,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 22:52:36,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:52:36,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:52:36,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-03 22:52:36,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:52:36,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791995438] [2025-03-03 22:52:36,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791995438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:52:36,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700257477] [2025-03-03 22:52:36,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:52:36,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:52:36,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:52:36,222 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:52:36,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 22:52:36,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 22:52:36,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 22:52:36,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:52:36,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:52:36,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:52:36,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:52:36,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-03 22:52:36,404 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:52:36,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700257477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:52:36,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:52:36,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:52:36,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480690290] [2025-03-03 22:52:36,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:52:36,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:52:36,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:52:36,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:52:36,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:52:36,428 INFO L87 Difference]: Start difference. First operand has 80 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:52:36,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:52:36,451 INFO L93 Difference]: Finished difference Result 157 states and 266 transitions. [2025-03-03 22:52:36,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:52:36,453 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 165 [2025-03-03 22:52:36,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:52:36,457 INFO L225 Difference]: With dead ends: 157 [2025-03-03 22:52:36,458 INFO L226 Difference]: Without dead ends: 77 [2025-03-03 22:52:36,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:52:36,462 INFO L435 NwaCegarLoop]: 120 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, 120 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:52:36,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:52:36,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-03 22:52:36,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-03 22:52:36,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 22:52:36,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2025-03-03 22:52:36,514 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 165 [2025-03-03 22:52:36,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:52:36,518 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2025-03-03 22:52:36,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:52:36,518 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2025-03-03 22:52:36,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 22:52:36,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:52:36,520 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:52:36,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 22:52:36,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 22:52:36,721 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:52:36,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:52:36,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1378882098, now seen corresponding path program 1 times [2025-03-03 22:52:36,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:52:36,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426800586] [2025-03-03 22:52:36,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:52:36,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:52:36,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 22:52:37,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 22:52:37,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:52:37,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:52:37,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 22:52:37,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:52:37,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426800586] [2025-03-03 22:52:37,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426800586] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:52:37,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260061564] [2025-03-03 22:52:37,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:52:37,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:52:37,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:52:37,400 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-03 22:52:37,401 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-03 22:52:37,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 22:52:37,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 22:52:37,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:52:37,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:52:37,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 22:52:37,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:52:37,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 684 proven. 9 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2025-03-03 22:52:37,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:52:38,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 63 proven. 9 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 22:52:38,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260061564] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:52:38,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:52:38,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 7] total 16 [2025-03-03 22:52:38,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400981734] [2025-03-03 22:52:38,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:52:38,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 22:52:38,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:52:38,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 22:52:38,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-03-03 22:52:38,201 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand has 16 states, 16 states have (on average 5.6875) internal successors, (91), 16 states have internal predecessors, (91), 5 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) [2025-03-03 22:52:39,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:52:39,256 INFO L93 Difference]: Finished difference Result 278 states and 408 transitions. [2025-03-03 22:52:39,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 22:52:39,257 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.6875) internal successors, (91), 16 states have internal predecessors, (91), 5 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) Word has length 165 [2025-03-03 22:52:39,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:52:39,260 INFO L225 Difference]: With dead ends: 278 [2025-03-03 22:52:39,260 INFO L226 Difference]: Without dead ends: 204 [2025-03-03 22:52:39,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=416, Invalid=990, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 22:52:39,262 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 725 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 22:52:39,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 410 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 22:52:39,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-03 22:52:39,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 128. [2025-03-03 22:52:39,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 77 states have internal predecessors, (91), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 22:52:39,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 183 transitions. [2025-03-03 22:52:39,292 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 183 transitions. Word has length 165 [2025-03-03 22:52:39,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:52:39,292 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 183 transitions. [2025-03-03 22:52:39,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.6875) internal successors, (91), 16 states have internal predecessors, (91), 5 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) [2025-03-03 22:52:39,293 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 183 transitions. [2025-03-03 22:52:39,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 22:52:39,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:52:39,297 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:52:39,304 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-03 22:52:39,497 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-03 22:52:39,498 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:52:39,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:52:39,499 INFO L85 PathProgramCache]: Analyzing trace with hash 788319065, now seen corresponding path program 1 times [2025-03-03 22:52:39,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:52:39,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344963784] [2025-03-03 22:52:39,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:52:39,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:52:39,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 22:52:39,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 22:52:39,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:52:39,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:52:40,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 22:52:40,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:52:40,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344963784] [2025-03-03 22:52:40,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344963784] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:52:40,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960521854] [2025-03-03 22:52:40,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:52:40,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:52:40,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:52:40,146 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-03 22:52:40,147 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-03 22:52:40,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 22:52:40,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 22:52:40,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:52:40,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:52:40,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 22:52:40,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:52:40,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 624 proven. 36 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2025-03-03 22:52:40,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:52:40,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 22:52:40,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960521854] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:52:40,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:52:40,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-03 22:52:40,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573091912] [2025-03-03 22:52:40,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:52:40,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 22:52:40,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:52:40,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 22:52:40,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:52:40,615 INFO L87 Difference]: Start difference. First operand 128 states and 183 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-03 22:52:41,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:52:41,492 INFO L93 Difference]: Finished difference Result 419 states and 569 transitions. [2025-03-03 22:52:41,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-03 22:52:41,493 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 166 [2025-03-03 22:52:41,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:52:41,496 INFO L225 Difference]: With dead ends: 419 [2025-03-03 22:52:41,498 INFO L226 Difference]: Without dead ends: 333 [2025-03-03 22:52:41,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 330 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 22:52:41,501 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 309 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 22:52:41,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 860 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 22:52:41,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-03 22:52:41,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 229. [2025-03-03 22:52:41,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 143 states have (on average 1.167832167832168) internal successors, (167), 144 states have internal predecessors, (167), 71 states have call successors, (71), 14 states have call predecessors, (71), 14 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2025-03-03 22:52:41,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 309 transitions. [2025-03-03 22:52:41,544 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 309 transitions. Word has length 166 [2025-03-03 22:52:41,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:52:41,544 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 309 transitions. [2025-03-03 22:52:41,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-03 22:52:41,544 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 309 transitions. [2025-03-03 22:52:41,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 22:52:41,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:52:41,546 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:52:41,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 22:52:41,747 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-03 22:52:41,747 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:52:41,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:52:41,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1675822746, now seen corresponding path program 1 times [2025-03-03 22:52:41,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:52:41,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674597017] [2025-03-03 22:52:41,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:52:41,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:52:41,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 22:52:41,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 22:52:41,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:52:41,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:52:41,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2090350723] [2025-03-03 22:52:41,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:52:41,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:52:41,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:52:41,857 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:52:41,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 22:52:41,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 22:52:42,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 22:52:42,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:52:42,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:52:42,180 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:52:42,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 22:52:42,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 22:52:42,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:52:42,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:52:42,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:52:42,337 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:52:42,338 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:52:42,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 22:52:42,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:52:42,542 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-03 22:52:42,637 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:52:42,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:52:42 BoogieIcfgContainer [2025-03-03 22:52:42,639 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:52:42,639 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:52:42,639 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:52:42,639 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:52:42,641 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:52:35" (3/4) ... [2025-03-03 22:52:42,642 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:52:42,643 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:52:42,644 INFO L158 Benchmark]: Toolchain (without parser) took 7704.55ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 105.8MB in the beginning and 125.8MB in the end (delta: -20.0MB). Peak memory consumption was 120.3MB. Max. memory is 16.1GB. [2025-03-03 22:52:42,645 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:52:42,645 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.12ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 87.9MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:52:42,646 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.33ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 80.5MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:52:42,646 INFO L158 Benchmark]: Boogie Preprocessor took 63.10ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 64.2MB in the end (delta: 16.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:52:42,646 INFO L158 Benchmark]: IcfgBuilder took 499.84ms. Allocated memory is still 142.6MB. Free memory was 64.2MB in the beginning and 99.2MB in the end (delta: -35.0MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2025-03-03 22:52:42,647 INFO L158 Benchmark]: TraceAbstraction took 6820.58ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 98.4MB in the beginning and 125.9MB in the end (delta: -27.4MB). Peak memory consumption was 113.7MB. Max. memory is 16.1GB. [2025-03-03 22:52:42,647 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 285.2MB. Free memory was 125.9MB in the beginning and 125.8MB in the end (delta: 37.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:52:42,648 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.20ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.12ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 87.9MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.33ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 80.5MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.10ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 64.2MB in the end (delta: 16.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 499.84ms. Allocated memory is still 142.6MB. Free memory was 64.2MB in the beginning and 99.2MB in the end (delta: -35.0MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. * TraceAbstraction took 6820.58ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 98.4MB in the beginning and 125.9MB in the end (delta: -27.4MB). Peak memory consumption was 113.7MB. Max. memory is 16.1GB. * Witness Printer took 3.74ms. Allocated memory is still 285.2MB. Free memory was 125.9MB in the beginning and 125.8MB in the end (delta: 37.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 someBinaryDOUBLEComparisonOperation at line 145, overapproximation of someBinaryDOUBLEComparisonOperation at line 143, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 169, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 162, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 168, overapproximation of someBinaryDOUBLEComparisonOperation at line 156, overapproximation of someBinaryDOUBLEComparisonOperation at line 177. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 200; [L23] unsigned char var_1_4 = 128; [L24] unsigned char var_1_5 = 16; [L25] unsigned char var_1_6 = 16; [L26] signed short int var_1_7 = -8; [L27] signed char var_1_9 = 0; [L28] signed char var_1_10 = -4; [L29] double var_1_11 = 2.25; [L30] double var_1_12 = 199.3; [L31] double var_1_13 = 7.2; [L32] unsigned long int var_1_14 = 10; [L33] signed short int var_1_15 = -4; [L34] unsigned char var_1_16 = 0; [L35] signed short int var_1_19 = 256; [L36] unsigned char var_1_20 = 0; [L37] signed long int var_1_21 = -1; [L38] unsigned char var_1_22 = 0; [L39] unsigned char var_1_23 = 0; [L40] unsigned char var_1_24 = 0; [L41] unsigned short int var_1_25 = 100; [L42] double var_1_26 = 15.125; [L43] double var_1_27 = 2.3; [L44] double var_1_28 = 999.25; [L45] double var_1_29 = 1.75; [L46] unsigned short int var_1_30 = 43183; [L47] unsigned long int var_1_31 = 100000; [L48] double var_1_32 = 7.4; [L49] double var_1_33 = 31.125; [L50] signed short int var_1_34 = -128; [L51] signed char var_1_35 = -1; [L52] signed char last_1_var_1_9 = 0; [L53] signed short int last_1_var_1_19 = 256; [L54] unsigned long int last_1_var_1_31 = 100000; VAL [isInitial=0, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L181] isInitial = 1 [L182] FCALL initially() [L183] int k_loop; [L184] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L184] COND TRUE k_loop < 1 [L185] CALL updateLastVariables() [L172] last_1_var_1_9 = var_1_9 [L173] last_1_var_1_19 = var_1_19 [L174] last_1_var_1_31 = var_1_31 VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L185] RET updateLastVariables() [L186] CALL updateVariables() [L130] var_1_4 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_4 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L131] RET assume_abort_if_not(var_1_4 >= 127) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L132] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L132] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L133] var_1_5 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_6=16, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_6=16, var_1_7=-8, var_1_9=0] [L134] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_6=16, var_1_7=-8, var_1_9=0] [L135] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=16, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=16, var_1_7=-8, var_1_9=0] [L135] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=16, var_1_7=-8, var_1_9=0] [L136] var_1_6 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_7=-8, var_1_9=0] [L137] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_7=-8, var_1_9=0] [L138] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L138] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L139] var_1_10 = __VERIFIER_nondet_char() [L140] CALL assume_abort_if_not(var_1_10 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L140] RET assume_abort_if_not(var_1_10 >= -127) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L141] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L142] var_1_12 = __VERIFIER_nondet_double() [L143] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L143] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L144] var_1_13 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L145] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L146] var_1_16 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L147] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L148] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L149] var_1_23 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_23 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L150] RET assume_abort_if_not(var_1_23 >= 1) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_23 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L151] RET assume_abort_if_not(var_1_23 <= 1) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L152] var_1_24 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L153] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L154] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L154] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L155] var_1_26 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_26 >= 0.0F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427387900e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L156] RET assume_abort_if_not((var_1_26 >= 0.0F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427387900e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L157] var_1_27 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L158] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L159] var_1_28 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L160] RET assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L161] var_1_29 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L162] RET assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L163] CALL assume_abort_if_not(var_1_29 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L163] RET assume_abort_if_not(var_1_29 != 0.0F) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L164] var_1_30 = __VERIFIER_nondet_ushort() [L165] CALL assume_abort_if_not(var_1_30 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L165] RET assume_abort_if_not(var_1_30 >= 32767) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L166] CALL assume_abort_if_not(var_1_30 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L166] RET assume_abort_if_not(var_1_30 <= 65534) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L167] var_1_33 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_33 >= -922337.2036854776000e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L168] RET assume_abort_if_not((var_1_33 >= -922337.2036854776000e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L169] CALL assume_abort_if_not(var_1_33 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L169] RET assume_abort_if_not(var_1_33 != 0.0F) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L186] RET updateVariables() [L187] CALL step() [L58] signed long int stepLocal_0 = last_1_var_1_19; VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_0=256, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L59] COND TRUE last_1_var_1_31 != stepLocal_0 [L60] var_1_1 = (var_1_4 - var_1_5) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L64] var_1_34 = var_1_1 VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_34=1, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L65] COND TRUE var_1_10 == var_1_34 [L66] var_1_20 = (var_1_6 + var_1_5) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_34=1, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L68] var_1_14 = ((((((((var_1_6) > (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))) ? (var_1_6) : (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))))) > (var_1_1)) ? (((((var_1_6) > (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))) ? (var_1_6) : (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))))) : (var_1_1))) [L69] unsigned char stepLocal_4 = var_1_28 == (var_1_27 + var_1_29); VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_4=0, var_1_10=1, var_1_11=9/4, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_34=1, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L70] COND FALSE !((var_1_1 > var_1_30) && stepLocal_4) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_34=1, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L73] COND TRUE (var_1_29 / var_1_33) <= (- (var_1_12 + 10.1)) [L74] var_1_32 = var_1_26 VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L79] unsigned long int stepLocal_2 = var_1_14 - var_1_5; [L80] unsigned long int stepLocal_1 = (((var_1_14) < ((var_1_5 / var_1_4))) ? (var_1_14) : ((var_1_5 / var_1_4))); VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_1=0, stepLocal_2=-124, var_1_10=1, var_1_11=9/4, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=0] [L81] COND FALSE !(stepLocal_1 < (last_1_var_1_9 * (var_1_6 + var_1_20))) [L86] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-124, var_1_10=1, var_1_11=9/4, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=1] [L88] COND FALSE !(! var_1_24) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-124, var_1_10=1, var_1_11=9/4, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=-8, var_1_9=1] [L91] var_1_7 = ((((((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1) < 0 ) ? -(((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1) : (((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1))) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-124, var_1_10=1, var_1_11=9/4, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=1, var_1_9=1] [L92] COND TRUE ((var_1_10 / var_1_4) / 1) <= var_1_1 [L93] var_1_11 = ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-124, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=-1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=1, var_1_9=1] [L95] var_1_35 = var_1_10 [L96] var_1_21 = (var_1_6 - ((((var_1_5) > (var_1_20)) ? (var_1_5) : (var_1_20)))) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-124, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-126, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=1, var_1_9=1] [L97] COND FALSE !(var_1_13 <= ((var_1_26 + 128.65) - ((((var_1_27) > (var_1_28)) ? (var_1_27) : (var_1_28))))) [L104] var_1_25 = (var_1_30 - ((((var_1_20) > (128)) ? (var_1_20) : (128)))) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-124, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-126, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32639, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=1, var_1_9=1] [L106] unsigned char stepLocal_3 = var_1_13 < (var_1_32 * var_1_12); VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-124, stepLocal_3=0, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-126, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32639, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=1, var_1_9=1] [L107] COND FALSE !(stepLocal_3 && var_1_16) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-124, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-126, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32639, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=1, var_1_9=1] [L110] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-124, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-126, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32639, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=1, var_1_9=1] [L117] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-124, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-126, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32639, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=1, var_1_9=1] [L187] RET step() [L188] CALL, EXPR property() [L177-L178] return (((((((((((((((last_1_var_1_31 != last_1_var_1_19) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (((((50) > (var_1_5)) ? (50) : (var_1_5))) + var_1_6)))) && (var_1_7 == ((signed short int) ((((((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1) < 0 ) ? -(((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1) : (((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1)))))) && ((((((var_1_14) < ((var_1_5 / var_1_4))) ? (var_1_14) : ((var_1_5 / var_1_4)))) < (last_1_var_1_9 * (var_1_6 + var_1_20))) ? ((var_1_20 < (var_1_14 - var_1_5)) ? (var_1_9 == ((signed char) var_1_10)) : 1) : (var_1_9 == ((signed char) var_1_10)))) && ((((var_1_10 / var_1_4) / 1) <= var_1_1) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (var_1_14 == ((unsigned long int) ((((((((var_1_6) > (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))) ? (var_1_6) : (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))))) > (var_1_1)) ? (((((var_1_6) > (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))) ? (var_1_6) : (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))))) : (var_1_1)))))) && (var_1_22 ? (var_1_22 ? (var_1_15 == ((signed short int) ((((((((var_1_9) > (1000)) ? (var_1_9) : (1000))) < 0 ) ? -((((var_1_9) > (1000)) ? (var_1_9) : (1000))) : ((((var_1_9) > (1000)) ? (var_1_9) : (1000))))) + var_1_4))) : (var_1_15 == ((signed short int) ((((var_1_5) < (var_1_9)) ? (var_1_5) : (var_1_9)))))) : 1)) && (var_1_22 ? ((var_1_20 > var_1_15) ? (var_1_19 == ((signed short int) (var_1_34 + var_1_10))) : ((var_1_15 < var_1_4) ? (var_1_19 == ((signed short int) var_1_4)) : (var_1_19 == ((signed short int) var_1_5)))) : 1)) && ((var_1_10 == var_1_34) ? (var_1_20 == ((unsigned char) (var_1_6 + var_1_5))) : 1)) && (var_1_21 == ((signed long int) (var_1_6 - ((((var_1_5) > (var_1_20)) ? (var_1_5) : (var_1_20))))))) && (((var_1_13 < (var_1_32 * var_1_12)) && var_1_16) ? (var_1_22 == ((unsigned char) (var_1_23 && var_1_24))) : 1)) && ((var_1_13 <= ((var_1_26 + 128.65) - ((((var_1_27) > (var_1_28)) ? (var_1_27) : (var_1_28))))) ? (((var_1_13 / var_1_29) < var_1_28) ? (var_1_25 == ((unsigned short int) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_25 == ((unsigned short int) (((((var_1_14 + var_1_20)) < (((((var_1_20) > (var_1_5)) ? (var_1_20) : (var_1_5))))) ? ((var_1_14 + var_1_20)) : (((((var_1_20) > (var_1_5)) ? (var_1_20) : (var_1_5))))))))) : (var_1_25 == ((unsigned short int) (var_1_30 - ((((var_1_20) > (128)) ? (var_1_20) : (128)))))))) && ((! var_1_24) ? (var_1_31 == ((unsigned long int) (var_1_34 + ((((var_1_20) < (var_1_6)) ? (var_1_20) : (var_1_6)))))) : 1)) && (((var_1_1 > var_1_30) && (var_1_28 == (var_1_27 + var_1_29))) ? (var_1_32 == ((double) ((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) : (((var_1_29 / var_1_33) <= (- (var_1_12 + 10.1))) ? (var_1_32 == ((double) var_1_26)) : (var_1_32 == ((double) var_1_26))))) && (var_1_34 == ((signed short int) var_1_1))) && (var_1_35 == ((signed char) var_1_10)) ; VAL [\result=0, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-126, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32639, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=1, var_1_9=1] [L188] RET, EXPR property() [L188] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-126, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32639, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-126, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32639, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=127, var_1_5=126, var_1_6=-254, var_1_7=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 4, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1096 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1034 mSDsluCounter, 1390 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 898 mSDsCounter, 477 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1318 IncrementalHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 477 mSolverCounterUnsat, 492 mSDtfsCounter, 1318 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 888 GetRequests, 818 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229occurred in iteration=3, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 180 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1324 NumberOfCodeBlocks, 1324 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1315 ConstructedInterpolants, 0 QuantifiedInterpolants, 2766 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1215 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 9396/9600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 22:52:42,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-91.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 208f44a9e9f2438986e071a7e09693363ee28f0f67d864c3fa3df50951cdc9e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:52:44,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:52:44,680 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:52:44,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:52:44,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:52:44,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:52:44,739 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:52:44,740 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:52:44,740 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:52:44,740 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:52:44,741 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:52:44,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:52:44,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:52:44,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:52:44,742 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:52:44,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:52:44,742 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:52:44,743 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:52:44,743 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:52:44,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:52:44,743 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:52:44,743 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:52:44,743 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:52:44,743 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:52:44,743 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:52:44,743 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:52:44,743 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:52:44,743 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:52:44,744 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:52:44,744 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:52:44,744 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:52:44,744 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:52:44,744 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:52:44,744 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:52:44,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:52:44,745 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:52:44,745 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:52:44,745 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:52:44,745 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:52:44,745 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:52:44,745 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:52:44,745 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:52:44,745 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:52:44,745 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:52:44,745 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:52:44,745 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 -> 208f44a9e9f2438986e071a7e09693363ee28f0f67d864c3fa3df50951cdc9e6 [2025-03-03 22:52:44,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:52:44,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:52:45,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:52:45,002 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:52:45,002 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:52:45,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-91.i [2025-03-03 22:52:46,202 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ab1a7e3c/b03913584ff74c2ca196aceaf3712942/FLAGafc4beec8 [2025-03-03 22:52:46,461 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:52:46,461 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-91.i [2025-03-03 22:52:46,470 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ab1a7e3c/b03913584ff74c2ca196aceaf3712942/FLAGafc4beec8 [2025-03-03 22:52:46,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ab1a7e3c/b03913584ff74c2ca196aceaf3712942 [2025-03-03 22:52:46,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:52:46,777 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:52:46,778 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:52:46,778 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:52:46,781 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:52:46,782 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:52:46" (1/1) ... [2025-03-03 22:52:46,784 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@688a0fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:46, skipping insertion in model container [2025-03-03 22:52:46,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:52:46" (1/1) ... [2025-03-03 22:52:46,809 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:52:46,913 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-91.i[916,929] [2025-03-03 22:52:46,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:52:47,018 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:52:47,030 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-91.i[916,929] [2025-03-03 22:52:47,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:52:47,094 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:52:47,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:47 WrapperNode [2025-03-03 22:52:47,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:52:47,096 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:52:47,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:52:47,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:52:47,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:47" (1/1) ... [2025-03-03 22:52:47,114 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:47" (1/1) ... [2025-03-03 22:52:47,139 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2025-03-03 22:52:47,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:52:47,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:52:47,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:52:47,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:52:47,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:47" (1/1) ... [2025-03-03 22:52:47,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:47" (1/1) ... [2025-03-03 22:52:47,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:47" (1/1) ... [2025-03-03 22:52:47,173 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:52:47,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:47" (1/1) ... [2025-03-03 22:52:47,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:47" (1/1) ... [2025-03-03 22:52:47,183 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:47" (1/1) ... [2025-03-03 22:52:47,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:47" (1/1) ... [2025-03-03 22:52:47,185 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:47" (1/1) ... [2025-03-03 22:52:47,186 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:47" (1/1) ... [2025-03-03 22:52:47,188 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:52:47,189 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:52:47,189 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:52:47,189 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:52:47,190 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:47" (1/1) ... [2025-03-03 22:52:47,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:52:47,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:52:47,218 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:52:47,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:52:47,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:52:47,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:52:47,239 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:52:47,239 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:52:47,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:52:47,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:52:47,312 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:52:47,314 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:53:12,057 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-03 22:53:12,057 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:53:12,064 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:53:12,064 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:53:12,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:53:12 BoogieIcfgContainer [2025-03-03 22:53:12,065 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:53:12,066 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:53:12,066 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:53:12,069 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:53:12,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:52:46" (1/3) ... [2025-03-03 22:53:12,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3de3bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:53:12, skipping insertion in model container [2025-03-03 22:53:12,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:47" (2/3) ... [2025-03-03 22:53:12,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3de3bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:53:12, skipping insertion in model container [2025-03-03 22:53:12,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:53:12" (3/3) ... [2025-03-03 22:53:12,071 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-91.i [2025-03-03 22:53:12,080 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:53:12,081 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-91.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:53:12,119 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:53:12,130 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;@4815ec6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:53:12,132 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:53:12,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 22:53:12,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 22:53:12,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:53:12,148 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:53:12,148 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:53:12,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:53:12,153 INFO L85 PathProgramCache]: Analyzing trace with hash 670360973, now seen corresponding path program 1 times [2025-03-03 22:53:12,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:53:12,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507638465] [2025-03-03 22:53:12,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:53:12,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:53:12,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:53:12,164 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:53:12,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 22:53:12,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 22:53:13,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 22:53:13,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:53:13,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:53:13,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:53:13,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:53:13,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2025-03-03 22:53:13,332 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:53:13,332 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:53:13,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507638465] [2025-03-03 22:53:13,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1507638465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:53:13,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:53:13,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:53:13,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226366479] [2025-03-03 22:53:13,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:53:13,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:53:13,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:53:13,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:53:13,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:53:13,357 INFO L87 Difference]: Start difference. First operand has 80 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:53:13,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:53:13,374 INFO L93 Difference]: Finished difference Result 157 states and 266 transitions. [2025-03-03 22:53:13,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:53:13,375 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 165 [2025-03-03 22:53:13,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:53:13,382 INFO L225 Difference]: With dead ends: 157 [2025-03-03 22:53:13,382 INFO L226 Difference]: Without dead ends: 77 [2025-03-03 22:53:13,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:53:13,386 INFO L435 NwaCegarLoop]: 120 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, 120 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:53:13,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:53:13,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-03 22:53:13,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-03 22:53:13,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 22:53:13,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2025-03-03 22:53:13,416 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 165 [2025-03-03 22:53:13,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:53:13,417 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2025-03-03 22:53:13,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:53:13,417 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2025-03-03 22:53:13,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 22:53:13,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:53:13,419 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:53:13,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 22:53:13,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:53:13,620 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:53:13,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:53:13,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1378882098, now seen corresponding path program 1 times [2025-03-03 22:53:13,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:53:13,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1157789547] [2025-03-03 22:53:13,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:53:13,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:53:13,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:53:13,623 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:53:13,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 22:53:13,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 22:53:14,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 22:53:14,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:53:14,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:53:14,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 22:53:14,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:53:15,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 318 proven. 9 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2025-03-03 22:53:15,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:53:16,276 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:53:16,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1157789547] [2025-03-03 22:53:16,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1157789547] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:53:16,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2085113512] [2025-03-03 22:53:16,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:53:16,276 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 22:53:16,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 22:53:16,278 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 22:53:16,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-03 22:53:16,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 22:53:18,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 22:53:18,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:53:18,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:53:18,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 22:53:18,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:53:19,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 318 proven. 9 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2025-03-03 22:53:19,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:53:19,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2085113512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:53:19,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 22:53:19,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2025-03-03 22:53:19,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325603875] [2025-03-03 22:53:19,665 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 22:53:19,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:53:19,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:53:19,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:53:19,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:53:19,667 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:53:23,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:53:28,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:53:32,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:53:36,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:53:36,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:53:36,333 INFO L93 Difference]: Finished difference Result 157 states and 236 transitions. [2025-03-03 22:53:36,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 22:53:36,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 165 [2025-03-03 22:53:36,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:53:36,460 INFO L225 Difference]: With dead ends: 157 [2025-03-03 22:53:36,460 INFO L226 Difference]: Without dead ends: 83 [2025-03-03 22:53:36,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:53:36,462 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 77 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:53:36,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 210 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 3 Unknown, 0 Unchecked, 16.3s Time] [2025-03-03 22:53:36,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-03 22:53:36,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2025-03-03 22:53:36,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 22:53:36,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 119 transitions. [2025-03-03 22:53:36,479 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 119 transitions. Word has length 165 [2025-03-03 22:53:36,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:53:36,480 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 119 transitions. [2025-03-03 22:53:36,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:53:36,480 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 119 transitions. [2025-03-03 22:53:36,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 22:53:36,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:53:36,483 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:53:36,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-03-03 22:53:36,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 22:53:36,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:53:36,884 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:53:36,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:53:36,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1081722072, now seen corresponding path program 1 times [2025-03-03 22:53:36,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:53:36,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [801555424] [2025-03-03 22:53:36,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:53:36,885 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:53:36,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:53:36,896 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:53:36,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 22:53:36,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 22:53:38,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 22:53:38,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:53:38,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:53:38,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 22:53:38,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:53:41,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 612 proven. 30 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2025-03-03 22:53:41,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:53:44,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 22:53:44,111 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:53:44,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [801555424] [2025-03-03 22:53:44,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [801555424] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:53:44,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 22:53:44,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-03 22:53:44,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731925527] [2025-03-03 22:53:44,112 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 22:53:44,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:53:44,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:53:44,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:53:44,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:53:44,113 INFO L87 Difference]: Start difference. First operand 81 states and 119 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 22:53:51,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:53:55,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:53:59,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:54:00,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:54:00,403 INFO L93 Difference]: Finished difference Result 191 states and 280 transitions. [2025-03-03 22:54:00,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:54:00,404 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 166 [2025-03-03 22:54:00,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:54:00,406 INFO L225 Difference]: With dead ends: 191 [2025-03-03 22:54:00,406 INFO L226 Difference]: Without dead ends: 113 [2025-03-03 22:54:00,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 324 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:54:00,407 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 145 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 59 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2025-03-03 22:54:00,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 253 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 213 Invalid, 3 Unknown, 0 Unchecked, 15.8s Time] [2025-03-03 22:54:00,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-03 22:54:00,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2025-03-03 22:54:00,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 66 states have internal predecessors, (80), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 22:54:00,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 158 transitions. [2025-03-03 22:54:00,417 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 158 transitions. Word has length 166 [2025-03-03 22:54:00,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:54:00,418 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 158 transitions. [2025-03-03 22:54:00,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 22:54:00,419 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 158 transitions. [2025-03-03 22:54:00,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 22:54:00,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:00,420 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:54:00,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-03 22:54:00,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:54:00,621 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:00,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:00,621 INFO L85 PathProgramCache]: Analyzing trace with hash 788319065, now seen corresponding path program 1 times [2025-03-03 22:54:00,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:54:00,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203720193] [2025-03-03 22:54:00,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:00,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:54:00,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:54:00,623 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:54:00,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 (6)] Waiting until timeout for monitored process [2025-03-03 22:54:00,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 22:54:02,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 22:54:02,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:02,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:02,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 22:54:02,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:54:07,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 680 proven. 63 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2025-03-03 22:54:07,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:54:13,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 75 proven. 66 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2025-03-03 22:54:13,116 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:54:13,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203720193] [2025-03-03 22:54:13,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203720193] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:54:13,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 22:54:13,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2025-03-03 22:54:13,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909924137] [2025-03-03 22:54:13,116 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 22:54:13,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 22:54:13,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:54:13,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 22:54:13,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-03 22:54:13,117 INFO L87 Difference]: Start difference. First operand 108 states and 158 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (37), 3 states have call predecessors, (37), 7 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38)