./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-32.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 a1cbd694c9eed06f1e9279ceeb8d61e9debe17c32801c70f5b1c8faace63fe8f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:07:13,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:07:13,837 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:07:13,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:07:13,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:07:13,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:07:13,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:07:13,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:07:13,857 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:07:13,857 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:07:13,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:07:13,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:07:13,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:07:13,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:07:13,857 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:07:13,857 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:07:13,857 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:07:13,857 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:07:13,857 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:07:13,857 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:07:13,857 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:07:13,857 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:07:13,857 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:07:13,857 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:07:13,857 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:07:13,858 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:07:13,858 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:07:13,858 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:07:13,858 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:07:13,858 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:07:13,858 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:07:13,858 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:07:13,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:07:13,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:07:13,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:07:13,858 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:07:13,858 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:07:13,858 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:07:13,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:07:13,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:07:13,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:07:13,861 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:07:13,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:07:13,861 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 -> a1cbd694c9eed06f1e9279ceeb8d61e9debe17c32801c70f5b1c8faace63fe8f [2025-03-16 23:07:14,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:07:14,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:07:14,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:07:14,109 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:07:14,110 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:07:14,111 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-32.i [2025-03-16 23:07:15,217 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96e0c2145/a13c570c93a342e7b536626b378e65e3/FLAGb6935506c [2025-03-16 23:07:15,454 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:07:15,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-32.i [2025-03-16 23:07:15,473 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96e0c2145/a13c570c93a342e7b536626b378e65e3/FLAGb6935506c [2025-03-16 23:07:15,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96e0c2145/a13c570c93a342e7b536626b378e65e3 [2025-03-16 23:07:15,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:07:15,493 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:07:15,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:07:15,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:07:15,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:07:15,499 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:07:15" (1/1) ... [2025-03-16 23:07:15,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25aa5fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:15, skipping insertion in model container [2025-03-16 23:07:15,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:07:15" (1/1) ... [2025-03-16 23:07:15,516 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:07:15,605 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_codestructure_normal_file-32.i[913,926] [2025-03-16 23:07:15,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:07:15,649 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:07:15,655 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_codestructure_normal_file-32.i[913,926] [2025-03-16 23:07:15,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:07:15,683 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:07:15,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:15 WrapperNode [2025-03-16 23:07:15,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:07:15,685 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:07:15,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:07:15,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:07:15,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:15" (1/1) ... [2025-03-16 23:07:15,697 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:15" (1/1) ... [2025-03-16 23:07:15,717 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2025-03-16 23:07:15,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:07:15,718 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:07:15,718 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:07:15,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:07:15,726 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:15" (1/1) ... [2025-03-16 23:07:15,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:15" (1/1) ... [2025-03-16 23:07:15,728 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:15" (1/1) ... [2025-03-16 23:07:15,743 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-16 23:07:15,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:15" (1/1) ... [2025-03-16 23:07:15,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:15" (1/1) ... [2025-03-16 23:07:15,752 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:15" (1/1) ... [2025-03-16 23:07:15,753 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:15" (1/1) ... [2025-03-16 23:07:15,757 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:15" (1/1) ... [2025-03-16 23:07:15,758 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:15" (1/1) ... [2025-03-16 23:07:15,760 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:07:15,761 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:07:15,761 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:07:15,761 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:07:15,762 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:15" (1/1) ... [2025-03-16 23:07:15,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:07:15,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:07:15,784 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-16 23:07:15,787 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-16 23:07:15,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:07:15,804 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:07:15,804 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:07:15,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:07:15,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:07:15,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:07:15,866 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:07:15,867 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:07:16,071 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 23:07:16,072 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:07:16,078 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:07:16,078 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:07:16,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:07:16 BoogieIcfgContainer [2025-03-16 23:07:16,079 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:07:16,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:07:16,081 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:07:16,084 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:07:16,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:07:15" (1/3) ... [2025-03-16 23:07:16,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44006d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:07:16, skipping insertion in model container [2025-03-16 23:07:16,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:15" (2/3) ... [2025-03-16 23:07:16,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44006d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:07:16, skipping insertion in model container [2025-03-16 23:07:16,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:07:16" (3/3) ... [2025-03-16 23:07:16,086 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-32.i [2025-03-16 23:07:16,095 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:07:16,096 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-32.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:07:16,132 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:07:16,140 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;@c00054b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:07:16,140 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:07:16,143 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-16 23:07:16,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-16 23:07:16,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:07:16,151 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:07:16,151 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:07:16,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:07:16,155 INFO L85 PathProgramCache]: Analyzing trace with hash -89269563, now seen corresponding path program 1 times [2025-03-16 23:07:16,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:07:16,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978112221] [2025-03-16 23:07:16,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:07:16,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:07:16,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-16 23:07:16,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-16 23:07:16,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:07:16,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:07:16,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-16 23:07:16,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:07:16,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978112221] [2025-03-16 23:07:16,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978112221] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:07:16,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436750605] [2025-03-16 23:07:16,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:07:16,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:07:16,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:07:16,410 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-16 23:07:16,414 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-16 23:07:16,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-16 23:07:16,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-16 23:07:16,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:07:16,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:07:16,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:07:16,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:07:16,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-16 23:07:16,624 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:07:16,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436750605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:07:16,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:07:16,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:07:16,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141943081] [2025-03-16 23:07:16,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:07:16,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:07:16,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:07:16,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:07:16,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:07:16,646 INFO L87 Difference]: Start difference. First operand has 65 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-16 23:07:16,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:07:16,667 INFO L93 Difference]: Finished difference Result 127 states and 230 transitions. [2025-03-16 23:07:16,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:07:16,669 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 156 [2025-03-16 23:07:16,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:07:16,675 INFO L225 Difference]: With dead ends: 127 [2025-03-16 23:07:16,676 INFO L226 Difference]: Without dead ends: 63 [2025-03-16 23:07:16,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 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-16 23:07:16,682 INFO L435 NwaCegarLoop]: 99 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, 99 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-16 23:07:16,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:07:16,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-16 23:07:16,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-16 23:07:16,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-16 23:07:16,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 99 transitions. [2025-03-16 23:07:16,710 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 99 transitions. Word has length 156 [2025-03-16 23:07:16,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:07:16,711 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 99 transitions. [2025-03-16 23:07:16,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-16 23:07:16,711 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 99 transitions. [2025-03-16 23:07:16,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-16 23:07:16,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:07:16,713 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:07:16,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 23:07:16,917 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-16 23:07:16,917 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:07:16,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:07:16,918 INFO L85 PathProgramCache]: Analyzing trace with hash -386221151, now seen corresponding path program 1 times [2025-03-16 23:07:16,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:07:16,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880501141] [2025-03-16 23:07:16,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:07:16,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:07:16,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-16 23:07:16,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-16 23:07:16,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:07:16,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:07:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-16 23:07:17,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:07:17,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880501141] [2025-03-16 23:07:17,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880501141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:07:17,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:07:17,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:07:17,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829178780] [2025-03-16 23:07:17,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:07:17,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:07:17,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:07:17,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:07:17,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:07:17,300 INFO L87 Difference]: Start difference. First operand 63 states and 99 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-16 23:07:17,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:07:17,353 INFO L93 Difference]: Finished difference Result 151 states and 235 transitions. [2025-03-16 23:07:17,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:07:17,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 156 [2025-03-16 23:07:17,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:07:17,357 INFO L225 Difference]: With dead ends: 151 [2025-03-16 23:07:17,359 INFO L226 Difference]: Without dead ends: 89 [2025-03-16 23:07:17,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:07:17,361 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 39 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:07:17,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 202 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:07:17,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-16 23:07:17,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2025-03-16 23:07:17,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 52 states have internal predecessors, (70), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-16 23:07:17,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 134 transitions. [2025-03-16 23:07:17,381 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 134 transitions. Word has length 156 [2025-03-16 23:07:17,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:07:17,382 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 134 transitions. [2025-03-16 23:07:17,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-16 23:07:17,383 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 134 transitions. [2025-03-16 23:07:17,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-16 23:07:17,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:07:17,385 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:07:17,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:07:17,385 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:07:17,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:07:17,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1356589184, now seen corresponding path program 1 times [2025-03-16 23:07:17,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:07:17,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584878931] [2025-03-16 23:07:17,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:07:17,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:07:17,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-16 23:07:17,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-16 23:07:17,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:07:17,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:07:17,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 63 proven. 12 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-16 23:07:17,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:07:17,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584878931] [2025-03-16 23:07:17,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584878931] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:07:17,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721631944] [2025-03-16 23:07:17,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:07:17,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:07:17,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:07:17,634 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-16 23:07:17,635 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-16 23:07:17,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-16 23:07:17,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-16 23:07:17,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:07:17,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:07:17,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 23:07:17,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:07:17,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 403 proven. 12 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2025-03-16 23:07:17,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:07:17,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 63 proven. 12 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-16 23:07:17,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721631944] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 23:07:17,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 23:07:17,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-16 23:07:17,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879085624] [2025-03-16 23:07:17,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 23:07:17,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 23:07:17,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:07:17,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 23:07:17,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 23:07:17,999 INFO L87 Difference]: Start difference. First operand 86 states and 134 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-16 23:07:18,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:07:18,250 INFO L93 Difference]: Finished difference Result 215 states and 331 transitions. [2025-03-16 23:07:18,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:07:18,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 156 [2025-03-16 23:07:18,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:07:18,255 INFO L225 Difference]: With dead ends: 215 [2025-03-16 23:07:18,256 INFO L226 Difference]: Without dead ends: 130 [2025-03-16 23:07:18,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 309 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:07:18,258 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 90 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:07:18,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 198 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 23:07:18,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-16 23:07:18,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 123. [2025-03-16 23:07:18,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 68 states have internal predecessors, (83), 53 states have call successors, (53), 3 states have call predecessors, (53), 3 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-16 23:07:18,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 189 transitions. [2025-03-16 23:07:18,282 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 189 transitions. Word has length 156 [2025-03-16 23:07:18,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:07:18,283 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 189 transitions. [2025-03-16 23:07:18,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-16 23:07:18,284 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 189 transitions. [2025-03-16 23:07:18,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-16 23:07:18,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:07:18,287 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:07:18,293 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-16 23:07:18,487 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,SelfDestructingSolverStorable2 [2025-03-16 23:07:18,487 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:07:18,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:07:18,488 INFO L85 PathProgramCache]: Analyzing trace with hash -922158618, now seen corresponding path program 1 times [2025-03-16 23:07:18,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:07:18,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296664555] [2025-03-16 23:07:18,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:07:18,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:07:18,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-16 23:07:18,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-16 23:07:18,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:07:18,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:07:18,563 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 23:07:18,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-16 23:07:18,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-16 23:07:18,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:07:18,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:07:18,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 23:07:18,672 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 23:07:18,673 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 23:07:18,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 23:07:18,677 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-16 23:07:18,764 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 23:07:18,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 11:07:18 BoogieIcfgContainer [2025-03-16 23:07:18,767 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 23:07:18,768 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 23:07:18,768 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 23:07:18,768 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 23:07:18,768 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:07:16" (3/4) ... [2025-03-16 23:07:18,771 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 23:07:18,772 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 23:07:18,773 INFO L158 Benchmark]: Toolchain (without parser) took 3279.23ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 73.2MB in the end (delta: 32.2MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. [2025-03-16 23:07:18,774 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:07:18,774 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.71ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 91.5MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:07:18,774 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.73ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 88.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:07:18,775 INFO L158 Benchmark]: Boogie Preprocessor took 42.51ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 83.1MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 23:07:18,775 INFO L158 Benchmark]: IcfgBuilder took 317.95ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 62.5MB in the end (delta: 20.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:07:18,775 INFO L158 Benchmark]: TraceAbstraction took 2686.61ms. Allocated memory is still 142.6MB. Free memory was 62.5MB in the beginning and 73.3MB in the end (delta: -10.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:07:18,775 INFO L158 Benchmark]: Witness Printer took 4.09ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 73.2MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:07:18,777 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.71ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 91.5MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.73ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 88.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.51ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 83.1MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 317.95ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 62.5MB in the end (delta: 20.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2686.61ms. Allocated memory is still 142.6MB. Free memory was 62.5MB in the beginning and 73.3MB in the end (delta: -10.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.09ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 73.2MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 57, overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryFLOATComparisonOperation at line 137, overapproximation of someBinaryFLOATComparisonOperation at line 129, overapproximation of someBinaryDOUBLEComparisonOperation at line 137, overapproximation of someBinaryArithmeticFLOAToperation at line 79. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 2; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = -25; [L25] unsigned char var_1_4 = 100; [L26] unsigned char var_1_5 = 2; [L27] unsigned char var_1_6 = 64; [L28] unsigned char var_1_7 = 32; [L29] unsigned char var_1_8 = 32; [L30] float var_1_9 = 100.5; [L31] unsigned char var_1_10 = 4; [L32] float var_1_11 = 0.8; [L33] float var_1_12 = 2.5; [L34] signed short int var_1_13 = -32; [L35] float var_1_14 = 3.2; [L36] unsigned char var_1_15 = 1; [L37] unsigned char var_1_16 = 0; [L38] unsigned char var_1_17 = 0; [L39] float var_1_18 = 0.25; [L40] float var_1_19 = 100000000.25; [L41] signed char var_1_20 = 0; [L42] signed char var_1_21 = 10; [L43] double var_1_22 = 1000000.5; [L44] unsigned long int var_1_23 = 256; [L45] unsigned long int var_1_24 = 50; [L141] isInitial = 1 [L142] FCALL initially() [L143] COND TRUE 1 [L144] FCALL updateLastVariables() [L145] CALL updateVariables() [L92] var_1_2 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_3=-25, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_3=-25, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L93] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_3=-25, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L94] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=-25, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=-25, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L94] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=-25, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L95] var_1_3 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L96] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L97] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L97] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L98] var_1_4 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_4 >= 95) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L99] RET assume_abort_if_not(var_1_4 >= 95) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L100] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L100] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L101] var_1_5 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L102] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L103] CALL assume_abort_if_not(var_1_5 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L103] RET assume_abort_if_not(var_1_5 <= 32) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L104] var_1_6 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_6 >= 64) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L105] RET assume_abort_if_not(var_1_6 >= 64) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L106] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L106] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L107] var_1_7 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_8=32, var_1_9=201/2] [L108] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_8=32, var_1_9=201/2] [L109] CALL assume_abort_if_not(var_1_7 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=32, var_1_9=201/2] [L109] RET assume_abort_if_not(var_1_7 <= 64) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=32, var_1_9=201/2] [L110] var_1_8 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_9=201/2] [L111] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_9=201/2] [L112] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L112] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L113] var_1_10 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L114] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L115] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L115] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L116] var_1_11 = __VERIFIER_nondet_float() [L117] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L117] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L118] var_1_12 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L119] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L120] var_1_14 = __VERIFIER_nondet_float() [L121] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L121] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L122] var_1_16 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L123] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L124] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L124] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L125] var_1_17 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L126] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L127] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L127] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L128] var_1_19 = __VERIFIER_nondet_float() [L129] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L129] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L130] var_1_21 = __VERIFIER_nondet_char() [L131] CALL assume_abort_if_not(var_1_21 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L131] RET assume_abort_if_not(var_1_21 >= -31) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L132] CALL assume_abort_if_not(var_1_21 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L132] RET assume_abort_if_not(var_1_21 <= 31) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L145] RET updateVariables() [L146] CALL step() [L49] COND TRUE -32 < var_1_3 [L50] var_1_1 = (((var_1_4 - var_1_5) + var_1_6) - (var_1_7 + ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=95, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L52] COND FALSE !((var_1_10 + ((((var_1_3) > (var_1_6)) ? (var_1_3) : (var_1_6)))) == var_1_5) [L55] var_1_9 = var_1_12 VAL [isInitial=1, var_1_10=0, var_1_12=100000005, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=95, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=100000005] [L57] COND FALSE !((var_1_12 * ((((var_1_9) < (var_1_11)) ? (var_1_9) : (var_1_11)))) > (- var_1_14)) VAL [isInitial=1, var_1_10=0, var_1_12=100000005, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=95, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=100000005] [L66] COND FALSE !(var_1_5 >= var_1_6) [L75] var_1_15 = var_1_17 VAL [isInitial=1, var_1_10=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=95, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=100000005] [L77] COND TRUE var_1_17 || var_1_15 VAL [isInitial=1, var_1_10=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=95, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=100000005] [L78] COND TRUE var_1_15 && var_1_2 [L79] var_1_18 = (var_1_11 + var_1_19) VAL [isInitial=1, var_1_10=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=95, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=100000005] [L84] COND TRUE var_1_11 == var_1_18 [L85] var_1_20 = ((var_1_5 + var_1_21) + var_1_8) VAL [isInitial=1, var_1_10=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=95, var_1_20=63, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=100000005] [L87] var_1_22 = var_1_12 [L88] var_1_23 = var_1_8 [L89] var_1_24 = var_1_6 [L146] RET step() [L147] CALL, EXPR property() [L137-L138] return (((((((((-32 < var_1_3) ? (var_1_1 == ((unsigned char) (((var_1_4 - var_1_5) + var_1_6) - (var_1_7 + ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))))) : 1) && (((var_1_10 + ((((var_1_3) > (var_1_6)) ? (var_1_3) : (var_1_6)))) == var_1_5) ? (var_1_9 == ((float) ((4.5f + var_1_11) - var_1_12))) : (var_1_9 == ((float) var_1_12)))) && (((var_1_12 * ((((var_1_9) < (var_1_11)) ? (var_1_9) : (var_1_11)))) > (- var_1_14)) ? ((var_1_6 <= var_1_8) ? (var_1_2 ? (var_1_13 == ((signed short int) var_1_8)) : (var_1_13 == ((signed short int) var_1_5))) : 1) : 1)) && ((var_1_5 >= var_1_6) ? ((var_1_13 <= var_1_10) ? (var_1_15 == ((unsigned char) var_1_16)) : ((var_1_2 || var_1_16) ? (var_1_15 == ((unsigned char) var_1_17)) : 1)) : (var_1_15 == ((unsigned char) var_1_17)))) && ((var_1_17 || var_1_15) ? ((var_1_15 && var_1_2) ? (var_1_18 == ((float) (var_1_11 + var_1_19))) : (var_1_18 == ((float) var_1_19))) : 1)) && ((var_1_11 == var_1_18) ? (var_1_20 == ((signed char) ((var_1_5 + var_1_21) + var_1_8))) : 1)) && (var_1_22 == ((double) var_1_12))) && (var_1_23 == ((unsigned long int) var_1_8))) && (var_1_24 == ((unsigned long int) var_1_6)) ; [L147] RET, EXPR property() [L147] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=95, var_1_20=63, var_1_21=31, var_1_22=100000005, var_1_23=0, var_1_24=64, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=100000005] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=95, var_1_20=63, var_1_21=31, var_1_22=100000005, var_1_23=0, var_1_24=64, var_1_2=1, var_1_3=64, var_1_4=-24449, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=100000005] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 129 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 4, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 150 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 499 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 175 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 234 IncrementalHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 324 mSDtfsCounter, 234 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 479 GetRequests, 468 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=3, InterpolantAutomatonStates: 14, 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, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 937 NumberOfCodeBlocks, 937 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 930 ConstructedInterpolants, 0 QuantifiedInterpolants, 1200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 717 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 7714/7800 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-16 23:07:18,797 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_codestructure_normal_file-32.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 a1cbd694c9eed06f1e9279ceeb8d61e9debe17c32801c70f5b1c8faace63fe8f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:07:20,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:07:20,653 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 23:07:20,657 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:07:20,658 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:07:20,683 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:07:20,685 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:07:20,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:07:20,685 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:07:20,686 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:07:20,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:07:20,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:07:20,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:07:20,687 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:07:20,687 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:07:20,687 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:07:20,687 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:07:20,687 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:07:20,687 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:07:20,687 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:07:20,687 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:07:20,688 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:07:20,688 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:07:20,688 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 23:07:20,688 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 23:07:20,688 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 23:07:20,688 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:07:20,688 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:07:20,688 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:07:20,689 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:07:20,689 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:07:20,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:07:20,689 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:07:20,689 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:07:20,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:07:20,690 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:07:20,690 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:07:20,690 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:07:20,690 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:07:20,690 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 23:07:20,690 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 23:07:20,690 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:07:20,690 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:07:20,690 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:07:20,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:07:20,691 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 -> a1cbd694c9eed06f1e9279ceeb8d61e9debe17c32801c70f5b1c8faace63fe8f [2025-03-16 23:07:20,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:07:20,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:07:20,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:07:20,928 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:07:20,928 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:07:20,929 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-32.i [2025-03-16 23:07:22,074 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de0b3988d/42f431bc10a04c25af9881b05fd4beba/FLAGf53e520fd [2025-03-16 23:07:22,254 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:07:22,254 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-32.i [2025-03-16 23:07:22,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de0b3988d/42f431bc10a04c25af9881b05fd4beba/FLAGf53e520fd [2025-03-16 23:07:22,279 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de0b3988d/42f431bc10a04c25af9881b05fd4beba [2025-03-16 23:07:22,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:07:22,282 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:07:22,283 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:07:22,283 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:07:22,286 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:07:22,287 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:07:22" (1/1) ... [2025-03-16 23:07:22,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fc6ba0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:22, skipping insertion in model container [2025-03-16 23:07:22,289 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:07:22" (1/1) ... [2025-03-16 23:07:22,303 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:07:22,405 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_codestructure_normal_file-32.i[913,926] [2025-03-16 23:07:22,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:07:22,479 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:07:22,486 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_codestructure_normal_file-32.i[913,926] [2025-03-16 23:07:22,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:07:22,518 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:07:22,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:22 WrapperNode [2025-03-16 23:07:22,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:07:22,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:07:22,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:07:22,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:07:22,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:22" (1/1) ... [2025-03-16 23:07:22,539 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:22" (1/1) ... [2025-03-16 23:07:22,564 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151 [2025-03-16 23:07:22,565 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:07:22,565 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:07:22,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:07:22,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:07:22,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:22" (1/1) ... [2025-03-16 23:07:22,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:22" (1/1) ... [2025-03-16 23:07:22,575 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:22" (1/1) ... [2025-03-16 23:07:22,591 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-16 23:07:22,595 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:22" (1/1) ... [2025-03-16 23:07:22,595 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:22" (1/1) ... [2025-03-16 23:07:22,605 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:22" (1/1) ... [2025-03-16 23:07:22,606 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:22" (1/1) ... [2025-03-16 23:07:22,610 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:22" (1/1) ... [2025-03-16 23:07:22,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:22" (1/1) ... [2025-03-16 23:07:22,614 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:07:22,619 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:07:22,619 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:07:22,619 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:07:22,620 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:22" (1/1) ... [2025-03-16 23:07:22,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:07:22,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:07:22,649 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-16 23:07:22,652 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-16 23:07:22,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:07:22,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 23:07:22,672 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:07:22,672 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:07:22,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:07:22,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:07:22,743 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:07:22,745 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:07:26,111 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 23:07:26,112 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:07:26,119 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:07:26,119 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:07:26,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:07:26 BoogieIcfgContainer [2025-03-16 23:07:26,119 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:07:26,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:07:26,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:07:26,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:07:26,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:07:22" (1/3) ... [2025-03-16 23:07:26,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e52d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:07:26, skipping insertion in model container [2025-03-16 23:07:26,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:22" (2/3) ... [2025-03-16 23:07:26,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e52d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:07:26, skipping insertion in model container [2025-03-16 23:07:26,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:07:26" (3/3) ... [2025-03-16 23:07:26,129 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-32.i [2025-03-16 23:07:26,139 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:07:26,141 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-32.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:07:26,182 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:07:26,191 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;@615729b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:07:26,191 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:07:26,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-16 23:07:26,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-16 23:07:26,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:07:26,208 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:07:26,208 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:07:26,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:07:26,212 INFO L85 PathProgramCache]: Analyzing trace with hash -89269563, now seen corresponding path program 1 times [2025-03-16 23:07:26,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:07:26,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449645206] [2025-03-16 23:07:26,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:07:26,221 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-16 23:07:26,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:07:26,225 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-16 23:07:26,226 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-16 23:07:26,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-16 23:07:26,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-16 23:07:26,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:07:26,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:07:26,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:07:26,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:07:26,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2025-03-16 23:07:26,551 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:07:26,551 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:07:26,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449645206] [2025-03-16 23:07:26,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449645206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:07:26,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:07:26,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:07:26,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28577124] [2025-03-16 23:07:26,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:07:26,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:07:26,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:07:26,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:07:26,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:07:26,571 INFO L87 Difference]: Start difference. First operand has 65 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-16 23:07:26,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:07:26,587 INFO L93 Difference]: Finished difference Result 127 states and 230 transitions. [2025-03-16 23:07:26,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:07:26,588 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 156 [2025-03-16 23:07:26,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:07:26,592 INFO L225 Difference]: With dead ends: 127 [2025-03-16 23:07:26,592 INFO L226 Difference]: Without dead ends: 63 [2025-03-16 23:07:26,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 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-16 23:07:26,596 INFO L435 NwaCegarLoop]: 99 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, 99 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-16 23:07:26,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:07:26,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-16 23:07:26,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-16 23:07:26,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-16 23:07:26,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 99 transitions. [2025-03-16 23:07:26,621 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 99 transitions. Word has length 156 [2025-03-16 23:07:26,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:07:26,621 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 99 transitions. [2025-03-16 23:07:26,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-16 23:07:26,622 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 99 transitions. [2025-03-16 23:07:26,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-16 23:07:26,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:07:26,626 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:07:26,640 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-16 23:07:26,826 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-16 23:07:26,826 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:07:26,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:07:26,827 INFO L85 PathProgramCache]: Analyzing trace with hash -386221151, now seen corresponding path program 1 times [2025-03-16 23:07:26,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:07:26,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233043111] [2025-03-16 23:07:26,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:07:26,828 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-16 23:07:26,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:07:26,830 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-16 23:07:26,832 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-16 23:07:26,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-16 23:07:27,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-16 23:07:27,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:07:27,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:07:27,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 23:07:27,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:07:27,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 403 proven. 12 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2025-03-16 23:07:27,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:07:27,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 63 proven. 12 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-16 23:07:27,550 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:07:27,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233043111] [2025-03-16 23:07:27,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [233043111] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 23:07:27,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 23:07:27,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-16 23:07:27,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875849392] [2025-03-16 23:07:27,551 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 23:07:27,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 23:07:27,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:07:27,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 23:07:27,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 23:07:27,553 INFO L87 Difference]: Start difference. First operand 63 states and 99 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-16 23:07:30,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:07:31,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:07:31,370 INFO L93 Difference]: Finished difference Result 167 states and 259 transitions. [2025-03-16 23:07:31,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:07:31,371 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 156 [2025-03-16 23:07:31,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:07:31,373 INFO L225 Difference]: With dead ends: 167 [2025-03-16 23:07:31,373 INFO L226 Difference]: Without dead ends: 105 [2025-03-16 23:07:31,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:07:31,374 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 91 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-16 23:07:31,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 212 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-16 23:07:31,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-16 23:07:31,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2025-03-16 23:07:31,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 50 states have (on average 1.22) internal successors, (61), 51 states have internal predecessors, (61), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-16 23:07:31,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 155 transitions. [2025-03-16 23:07:31,396 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 155 transitions. Word has length 156 [2025-03-16 23:07:31,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:07:31,397 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 155 transitions. [2025-03-16 23:07:31,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-16 23:07:31,397 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 155 transitions. [2025-03-16 23:07:31,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-16 23:07:31,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:07:31,399 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:07:31,408 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-16 23:07:31,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:07:31,603 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:07:31,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:07:31,603 INFO L85 PathProgramCache]: Analyzing trace with hash 885295845, now seen corresponding path program 1 times [2025-03-16 23:07:31,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:07:31,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323257072] [2025-03-16 23:07:31,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:07:31,605 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-16 23:07:31,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:07:31,608 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 23:07:31,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-16 23:07:31,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-16 23:07:31,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-16 23:07:31,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:07:31,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:07:31,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 23:07:31,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:07:33,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 585 proven. 144 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2025-03-16 23:07:33,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:07:33,191 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:07:33,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323257072] [2025-03-16 23:07:33,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1323257072] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:07:33,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [123234289] [2025-03-16 23:07:33,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:07:33,192 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-16 23:07:33,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-16 23:07:33,212 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-16 23:07:33,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-16 23:07:33,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-16 23:07:34,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-16 23:07:34,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:07:34,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:07:34,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-16 23:07:34,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:07:35,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 585 proven. 144 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2025-03-16 23:07:35,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:07:35,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [123234289] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:07:35,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 23:07:35,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2025-03-16 23:07:35,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546364272] [2025-03-16 23:07:35,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 23:07:35,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 23:07:35,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:07:35,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 23:07:35,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:07:35,158 INFO L87 Difference]: Start difference. First operand 100 states and 155 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (26), 4 states have call predecessors, (26), 5 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2025-03-16 23:07:37,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:07:37,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:07:37,715 INFO L93 Difference]: Finished difference Result 196 states and 277 transitions. [2025-03-16 23:07:37,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 23:07:37,735 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (26), 4 states have call predecessors, (26), 5 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) Word has length 157 [2025-03-16 23:07:37,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:07:37,737 INFO L225 Difference]: With dead ends: 196 [2025-03-16 23:07:37,738 INFO L226 Difference]: Without dead ends: 130 [2025-03-16 23:07:37,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2025-03-16 23:07:37,743 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 75 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 23:07:37,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 147 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 23:07:37,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-16 23:07:37,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2025-03-16 23:07:37,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 66 states have (on average 1.106060606060606) internal successors, (73), 67 states have internal predecessors, (73), 47 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-16 23:07:37,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 167 transitions. [2025-03-16 23:07:37,762 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 167 transitions. Word has length 157 [2025-03-16 23:07:37,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:07:37,763 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 167 transitions. [2025-03-16 23:07:37,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (26), 4 states have call predecessors, (26), 5 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2025-03-16 23:07:37,764 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 167 transitions. [2025-03-16 23:07:37,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-16 23:07:37,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:07:37,767 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:07:37,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-16 23:07:37,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-03-16 23:07:38,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-16 23:07:38,168 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:07:38,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:07:38,169 INFO L85 PathProgramCache]: Analyzing trace with hash -922158618, now seen corresponding path program 1 times [2025-03-16 23:07:38,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:07:38,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761912277] [2025-03-16 23:07:38,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:07:38,170 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-16 23:07:38,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:07:38,172 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-16 23:07:38,173 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-16 23:07:38,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-16 23:07:38,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-16 23:07:38,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:07:38,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:07:38,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-16 23:07:38,499 INFO L279 TraceCheckSpWp]: Computing forward predicates...