./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-99.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-99.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d1f2fd33e5d2eefab538c8e9509f9026512706d91745f186ee11fd8135485551 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:24:14,572 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:24:14,614 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:24:14,617 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:24:14,617 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:24:14,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:24:14,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:24:14,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:24:14,639 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:24:14,640 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:24:14,640 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:24:14,640 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:24:14,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:24:14,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:24:14,641 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:24:14,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:24:14,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:24:14,641 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:24:14,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:24:14,642 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:24:14,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:24:14,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:24:14,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:24:14,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:24:14,642 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:24:14,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:24:14,642 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:24:14,642 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:24:14,642 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:24:14,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:24:14,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:24:14,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:24:14,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:24:14,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:24:14,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:24:14,643 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:24:14,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:24:14,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:24:14,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:24:14,644 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:24:14,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:24:14,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:24:14,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:24:14,644 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d1f2fd33e5d2eefab538c8e9509f9026512706d91745f186ee11fd8135485551 [2025-03-17 03:24:14,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:24:14,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:24:14,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:24:14,858 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:24:14,858 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:24:14,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-99.i [2025-03-17 03:24:15,996 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c920be96f/1ecc060b69e8422cb9d1cdb0810edd05/FLAG5a2a625a4 [2025-03-17 03:24:16,259 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:24:16,260 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-99.i [2025-03-17 03:24:16,269 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c920be96f/1ecc060b69e8422cb9d1cdb0810edd05/FLAG5a2a625a4 [2025-03-17 03:24:16,558 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c920be96f/1ecc060b69e8422cb9d1cdb0810edd05 [2025-03-17 03:24:16,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:24:16,561 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:24:16,562 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:24:16,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:24:16,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:24:16,566 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:24:16" (1/1) ... [2025-03-17 03:24:16,567 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35249644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:16, skipping insertion in model container [2025-03-17 03:24:16,567 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:24:16" (1/1) ... [2025-03-17 03:24:16,588 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:24:16,694 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-99.i[916,929] [2025-03-17 03:24:16,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:24:16,766 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:24:16,772 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-99.i[916,929] [2025-03-17 03:24:16,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:24:16,820 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:24:16,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:16 WrapperNode [2025-03-17 03:24:16,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:24:16,822 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:24:16,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:24:16,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:24:16,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:16" (1/1) ... [2025-03-17 03:24:16,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:16" (1/1) ... [2025-03-17 03:24:16,868 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2025-03-17 03:24:16,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:24:16,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:24:16,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:24:16,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:24:16,875 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:16" (1/1) ... [2025-03-17 03:24:16,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:16" (1/1) ... [2025-03-17 03:24:16,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:16" (1/1) ... [2025-03-17 03:24:16,899 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:24:16,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:16" (1/1) ... [2025-03-17 03:24:16,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:16" (1/1) ... [2025-03-17 03:24:16,914 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:16" (1/1) ... [2025-03-17 03:24:16,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:16" (1/1) ... [2025-03-17 03:24:16,923 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:16" (1/1) ... [2025-03-17 03:24:16,925 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:16" (1/1) ... [2025-03-17 03:24:16,932 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:24:16,934 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:24:16,934 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:24:16,934 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:24:16,935 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:16" (1/1) ... [2025-03-17 03:24:16,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:24:16,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:24:16,960 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:24:16,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:24:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:24:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:24:16,980 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:24:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:24:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:24:16,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:24:17,052 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:24:17,053 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:24:17,406 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-17 03:24:17,406 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:24:17,418 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:24:17,418 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:24:17,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:24:17 BoogieIcfgContainer [2025-03-17 03:24:17,418 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:24:17,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:24:17,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:24:17,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:24:17,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:24:16" (1/3) ... [2025-03-17 03:24:17,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a7bda9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:24:17, skipping insertion in model container [2025-03-17 03:24:17,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:16" (2/3) ... [2025-03-17 03:24:17,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a7bda9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:24:17, skipping insertion in model container [2025-03-17 03:24:17,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:24:17" (3/3) ... [2025-03-17 03:24:17,428 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-99.i [2025-03-17 03:24:17,442 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:24:17,445 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-99.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:24:17,516 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:24:17,527 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;@7245af45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:24:17,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:24:17,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 55 states have (on average 1.509090909090909) internal successors, (83), 56 states have internal predecessors, (83), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 03:24:17,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 03:24:17,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:24:17,541 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:24:17,541 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:24:17,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:24:17,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1213695430, now seen corresponding path program 1 times [2025-03-17 03:24:17,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:24:17,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880078854] [2025-03-17 03:24:17,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:24:17,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:24:17,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 03:24:17,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 03:24:17,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:24:17,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:24:17,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-17 03:24:17,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:24:17,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880078854] [2025-03-17 03:24:17,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880078854] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:24:17,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471396199] [2025-03-17 03:24:17,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:24:17,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:24:17,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:24:17,782 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:24:17,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 03:24:17,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 03:24:17,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 03:24:17,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:24:17,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:24:17,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:24:17,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:24:17,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-17 03:24:17,968 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:24:17,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471396199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:24:17,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:24:17,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:24:17,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583126296] [2025-03-17 03:24:17,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:24:17,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:24:17,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:24:17,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:24:17,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:24:17,986 INFO L87 Difference]: Start difference. First operand has 83 states, 55 states have (on average 1.509090909090909) internal successors, (83), 56 states have internal predecessors, (83), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 03:24:18,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:24:18,002 INFO L93 Difference]: Finished difference Result 163 states and 289 transitions. [2025-03-17 03:24:18,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:24:18,004 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 161 [2025-03-17 03:24:18,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:24:18,008 INFO L225 Difference]: With dead ends: 163 [2025-03-17 03:24:18,008 INFO L226 Difference]: Without dead ends: 81 [2025-03-17 03:24:18,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:24:18,012 INFO L435 NwaCegarLoop]: 128 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, 128 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:24:18,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:24:18,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-17 03:24:18,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-17 03:24:18,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 03:24:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 128 transitions. [2025-03-17 03:24:18,039 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 128 transitions. Word has length 161 [2025-03-17 03:24:18,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:24:18,039 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 128 transitions. [2025-03-17 03:24:18,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 03:24:18,040 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 128 transitions. [2025-03-17 03:24:18,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-17 03:24:18,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:24:18,042 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:24:18,050 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-17 03:24:18,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 03:24:18,246 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:24:18,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:24:18,247 INFO L85 PathProgramCache]: Analyzing trace with hash -233466962, now seen corresponding path program 1 times [2025-03-17 03:24:18,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:24:18,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344005480] [2025-03-17 03:24:18,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:24:18,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:24:18,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-17 03:24:18,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-17 03:24:18,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:24:18,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:24:18,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 03:24:18,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:24:18,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344005480] [2025-03-17 03:24:18,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344005480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:24:18,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:24:18,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:24:18,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222674263] [2025-03-17 03:24:18,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:24:18,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:24:18,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:24:18,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:24:18,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:24:18,631 INFO L87 Difference]: Start difference. First operand 81 states and 128 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 03:24:18,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:24:18,695 INFO L93 Difference]: Finished difference Result 241 states and 382 transitions. [2025-03-17 03:24:18,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:24:18,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 162 [2025-03-17 03:24:18,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:24:18,715 INFO L225 Difference]: With dead ends: 241 [2025-03-17 03:24:18,715 INFO L226 Difference]: Without dead ends: 161 [2025-03-17 03:24:18,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:24:18,718 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 69 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:24:18,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 251 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:24:18,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-17 03:24:18,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2025-03-17 03:24:18,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 106 states have (on average 1.4339622641509433) internal successors, (152), 106 states have internal predecessors, (152), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 03:24:18,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 252 transitions. [2025-03-17 03:24:18,757 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 252 transitions. Word has length 162 [2025-03-17 03:24:18,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:24:18,757 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 252 transitions. [2025-03-17 03:24:18,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 03:24:18,758 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 252 transitions. [2025-03-17 03:24:18,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-17 03:24:18,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:24:18,759 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:24:18,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:24:18,760 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:24:18,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:24:18,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2131435580, now seen corresponding path program 1 times [2025-03-17 03:24:18,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:24:18,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657917961] [2025-03-17 03:24:18,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:24:18,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:24:18,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 03:24:18,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 03:24:18,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:24:18,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:24:19,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 03:24:19,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:24:19,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657917961] [2025-03-17 03:24:19,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657917961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:24:19,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:24:19,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:24:19,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405491295] [2025-03-17 03:24:19,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:24:19,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:24:19,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:24:19,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:24:19,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:24:19,258 INFO L87 Difference]: Start difference. First operand 159 states and 252 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 03:24:19,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:24:19,540 INFO L93 Difference]: Finished difference Result 419 states and 663 transitions. [2025-03-17 03:24:19,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:24:19,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 163 [2025-03-17 03:24:19,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:24:19,545 INFO L225 Difference]: With dead ends: 419 [2025-03-17 03:24:19,545 INFO L226 Difference]: Without dead ends: 261 [2025-03-17 03:24:19,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:24:19,547 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 98 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:24:19,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 436 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:24:19,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-17 03:24:19,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 205. [2025-03-17 03:24:19,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 126 states have (on average 1.3650793650793651) internal successors, (172), 126 states have internal predecessors, (172), 75 states have call successors, (75), 3 states have call predecessors, (75), 3 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-17 03:24:19,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 322 transitions. [2025-03-17 03:24:19,598 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 322 transitions. Word has length 163 [2025-03-17 03:24:19,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:24:19,600 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 322 transitions. [2025-03-17 03:24:19,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 03:24:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 322 transitions. [2025-03-17 03:24:19,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 03:24:19,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:24:19,604 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:24:19,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:24:19,605 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:24:19,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:24:19,605 INFO L85 PathProgramCache]: Analyzing trace with hash 2010325136, now seen corresponding path program 1 times [2025-03-17 03:24:19,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:24:19,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979493005] [2025-03-17 03:24:19,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:24:19,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:24:19,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 03:24:19,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 03:24:19,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:24:19,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:24:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 03:24:19,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:24:19,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979493005] [2025-03-17 03:24:19,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979493005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:24:19,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:24:19,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:24:19,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718559213] [2025-03-17 03:24:19,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:24:19,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:24:19,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:24:19,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:24:19,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:24:19,799 INFO L87 Difference]: Start difference. First operand 205 states and 322 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 03:24:19,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:24:19,950 INFO L93 Difference]: Finished difference Result 419 states and 662 transitions. [2025-03-17 03:24:19,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:24:19,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 164 [2025-03-17 03:24:19,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:24:19,953 INFO L225 Difference]: With dead ends: 419 [2025-03-17 03:24:19,954 INFO L226 Difference]: Without dead ends: 261 [2025-03-17 03:24:19,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:24:19,955 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 96 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:24:19,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 491 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:24:19,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-17 03:24:19,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 206. [2025-03-17 03:24:19,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 127 states have (on average 1.3622047244094488) internal successors, (173), 127 states have internal predecessors, (173), 75 states have call successors, (75), 3 states have call predecessors, (75), 3 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-17 03:24:20,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 323 transitions. [2025-03-17 03:24:20,003 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 323 transitions. Word has length 164 [2025-03-17 03:24:20,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:24:20,004 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 323 transitions. [2025-03-17 03:24:20,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 03:24:20,005 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 323 transitions. [2025-03-17 03:24:20,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-17 03:24:20,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:24:20,009 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:24:20,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:24:20,010 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:24:20,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:24:20,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1947945736, now seen corresponding path program 1 times [2025-03-17 03:24:20,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:24:20,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405990704] [2025-03-17 03:24:20,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:24:20,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:24:20,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 03:24:20,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 03:24:20,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:24:20,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:24:20,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 03:24:20,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:24:20,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405990704] [2025-03-17 03:24:20,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405990704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:24:20,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:24:20,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:24:20,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261128868] [2025-03-17 03:24:20,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:24:20,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:24:20,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:24:20,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:24:20,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:24:20,447 INFO L87 Difference]: Start difference. First operand 206 states and 323 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 03:24:20,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:24:20,641 INFO L93 Difference]: Finished difference Result 419 states and 661 transitions. [2025-03-17 03:24:20,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:24:20,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2025-03-17 03:24:20,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:24:20,644 INFO L225 Difference]: With dead ends: 419 [2025-03-17 03:24:20,644 INFO L226 Difference]: Without dead ends: 261 [2025-03-17 03:24:20,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:24:20,645 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 80 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:24:20,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 424 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:24:20,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-17 03:24:20,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 207. [2025-03-17 03:24:20,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 128 states have (on average 1.359375) internal successors, (174), 128 states have internal predecessors, (174), 75 states have call successors, (75), 3 states have call predecessors, (75), 3 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-17 03:24:20,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 324 transitions. [2025-03-17 03:24:20,678 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 324 transitions. Word has length 165 [2025-03-17 03:24:20,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:24:20,679 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 324 transitions. [2025-03-17 03:24:20,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 03:24:20,679 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 324 transitions. [2025-03-17 03:24:20,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-17 03:24:20,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:24:20,682 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:24:20,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 03:24:20,682 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:24:20,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:24:20,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1736594823, now seen corresponding path program 1 times [2025-03-17 03:24:20,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:24:20,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91993922] [2025-03-17 03:24:20,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:24:20,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:24:20,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 03:24:20,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 03:24:20,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:24:20,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:24:20,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 03:24:20,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:24:20,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91993922] [2025-03-17 03:24:20,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91993922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:24:20,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:24:20,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:24:20,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323415881] [2025-03-17 03:24:20,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:24:20,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:24:20,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:24:20,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:24:20,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:24:20,908 INFO L87 Difference]: Start difference. First operand 207 states and 324 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 03:24:20,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:24:20,954 INFO L93 Difference]: Finished difference Result 399 states and 625 transitions. [2025-03-17 03:24:20,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:24:20,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2025-03-17 03:24:20,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:24:20,961 INFO L225 Difference]: With dead ends: 399 [2025-03-17 03:24:20,961 INFO L226 Difference]: Without dead ends: 241 [2025-03-17 03:24:20,961 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-17 03:24:20,962 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 31 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:24:20,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 240 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:24:20,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-17 03:24:20,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 207. [2025-03-17 03:24:20,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 128 states have (on average 1.34375) internal successors, (172), 128 states have internal predecessors, (172), 75 states have call successors, (75), 3 states have call predecessors, (75), 3 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-17 03:24:20,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 322 transitions. [2025-03-17 03:24:20,984 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 322 transitions. Word has length 165 [2025-03-17 03:24:20,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:24:20,984 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 322 transitions. [2025-03-17 03:24:20,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 03:24:20,984 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 322 transitions. [2025-03-17 03:24:20,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-17 03:24:20,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:24:20,986 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:24:20,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 03:24:20,986 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:24:20,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:24:20,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1701134257, now seen corresponding path program 1 times [2025-03-17 03:24:20,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:24:20,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49032961] [2025-03-17 03:24:20,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:24:20,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:24:21,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-17 03:24:21,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-17 03:24:21,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:24:21,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:24:21,093 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:24:21,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-17 03:24:21,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-17 03:24:21,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:24:21,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:24:21,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:24:21,302 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:24:21,303 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:24:21,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 03:24:21,307 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:24:21,428 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:24:21,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:24:21 BoogieIcfgContainer [2025-03-17 03:24:21,431 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:24:21,431 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:24:21,431 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:24:21,432 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:24:21,433 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:24:17" (3/4) ... [2025-03-17 03:24:21,435 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:24:21,435 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:24:21,436 INFO L158 Benchmark]: Toolchain (without parser) took 4874.90ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 104.7MB in the beginning and 272.5MB in the end (delta: -167.8MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2025-03-17 03:24:21,436 INFO L158 Benchmark]: CDTParser took 0.77ms. Allocated memory is still 201.3MB. Free memory was 127.1MB in the beginning and 126.8MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:24:21,437 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.98ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 87.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:24:21,437 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.37ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 81.2MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:24:21,437 INFO L158 Benchmark]: Boogie Preprocessor took 63.65ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 71.3MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:24:21,437 INFO L158 Benchmark]: IcfgBuilder took 484.60ms. Allocated memory is still 142.6MB. Free memory was 70.2MB in the beginning and 39.3MB in the end (delta: 30.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 03:24:21,437 INFO L158 Benchmark]: TraceAbstraction took 4009.73ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 38.2MB in the beginning and 272.6MB in the end (delta: -234.4MB). Peak memory consumption was 132.9MB. Max. memory is 16.1GB. [2025-03-17 03:24:21,437 INFO L158 Benchmark]: Witness Printer took 4.36ms. Allocated memory is still 335.5MB. Free memory was 272.6MB in the beginning and 272.5MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:24:21,438 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.77ms. Allocated memory is still 201.3MB. Free memory was 127.1MB in the beginning and 126.8MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.98ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 87.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.37ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 81.2MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.65ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 71.3MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 484.60ms. Allocated memory is still 142.6MB. Free memory was 70.2MB in the beginning and 39.3MB in the end (delta: 30.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4009.73ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 38.2MB in the beginning and 272.6MB in the end (delta: -234.4MB). Peak memory consumption was 132.9MB. Max. memory is 16.1GB. * Witness Printer took 4.36ms. Allocated memory is still 335.5MB. Free memory was 272.6MB in the beginning and 272.5MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 184, overapproximation of someBinaryFLOATComparisonOperation at line 215, overapproximation of someBinaryFLOATComparisonOperation at line 190, overapproximation of someBinaryFLOATComparisonOperation at line 182, overapproximation of someBinaryFLOATComparisonOperation at line 186. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 8; [L23] unsigned char var_1_4 = 200; [L24] unsigned char var_1_5 = 0; [L25] unsigned long int var_1_6 = 1000000; [L26] signed short int var_1_7 = -1; [L27] unsigned char var_1_8 = 1; [L28] unsigned char var_1_9 = 0; [L29] signed short int var_1_10 = 128; [L30] unsigned char var_1_12 = 1; [L31] unsigned char var_1_14 = 128; [L32] unsigned char var_1_15 = 25; [L33] unsigned char var_1_16 = 1; [L34] float var_1_17 = 1.25; [L35] float var_1_18 = 3.5; [L36] float var_1_19 = 127.45; [L37] float var_1_20 = 1.5; [L38] float var_1_21 = 24.4; [L39] float var_1_22 = 0.8; [L40] unsigned char var_1_23 = 4; [L41] unsigned char var_1_24 = 0; [L42] unsigned char var_1_25 = 8; [L43] unsigned char var_1_26 = 64; [L44] signed short int var_1_27 = 256; [L45] unsigned char var_1_28 = 1; [L46] unsigned char var_1_30 = 0; [L47] unsigned char var_1_31 = 0; [L48] unsigned char last_1_var_1_1 = 8; [L49] unsigned long int last_1_var_1_6 = 1000000; [L50] signed short int last_1_var_1_7 = -1; [L51] unsigned char last_1_var_1_12 = 1; [L52] float last_1_var_1_17 = 1.25; [L53] unsigned char last_1_var_1_23 = 4; [L54] unsigned char last_1_var_1_25 = 8; [L55] unsigned char last_1_var_1_28 = 1; [L219] isInitial = 1 [L220] FCALL initially() [L221] COND TRUE 1 [L222] CALL updateLastVariables() [L205] last_1_var_1_1 = var_1_1 [L206] last_1_var_1_6 = var_1_6 [L207] last_1_var_1_7 = var_1_7 [L208] last_1_var_1_12 = var_1_12 [L209] last_1_var_1_17 = var_1_17 [L210] last_1_var_1_23 = var_1_23 [L211] last_1_var_1_25 = var_1_25 [L212] last_1_var_1_28 = var_1_28 [L222] RET updateLastVariables() [L223] CALL updateVariables() [L163] var_1_4 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_4 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L164] RET assume_abort_if_not(var_1_4 >= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L165] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L165] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L166] var_1_5 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L167] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L168] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L168] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L169] var_1_9 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1] [L170] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1] [L171] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L171] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L172] var_1_14 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_14 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L173] RET assume_abort_if_not(var_1_14 >= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L174] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L174] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L175] var_1_15 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L176] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L177] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L177] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L178] var_1_16 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L179] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L180] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L180] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L181] var_1_18 = __VERIFIER_nondet_float() [L182] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L182] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L183] var_1_19 = __VERIFIER_nondet_float() [L184] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L184] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L185] var_1_20 = __VERIFIER_nondet_float() [L186] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L186] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L187] var_1_21 = __VERIFIER_nondet_float() [L188] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L188] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L189] var_1_22 = __VERIFIER_nondet_float() [L190] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L190] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L191] var_1_24 = __VERIFIER_nondet_uchar() [L192] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L192] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L193] CALL assume_abort_if_not(var_1_24 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L193] RET assume_abort_if_not(var_1_24 <= 63) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L194] var_1_26 = __VERIFIER_nondet_uchar() [L195] CALL assume_abort_if_not(var_1_26 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=8, var_1_26=63, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=8, var_1_26=63, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L195] RET assume_abort_if_not(var_1_26 >= 63) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=8, var_1_26=63, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L196] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=8, var_1_26=63, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=8, var_1_26=63, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L196] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=8, var_1_26=63, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L197] var_1_30 = __VERIFIER_nondet_uchar() [L198] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=8, var_1_26=63, var_1_27=256, var_1_28=1, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=8, var_1_26=63, var_1_27=256, var_1_28=1, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L198] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=8, var_1_26=63, var_1_27=256, var_1_28=1, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L199] CALL assume_abort_if_not(var_1_30 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=8, var_1_26=63, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=8, var_1_26=63, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L199] RET assume_abort_if_not(var_1_30 <= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=8, var_1_26=63, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L200] var_1_31 = __VERIFIER_nondet_uchar() [L201] CALL assume_abort_if_not(var_1_31 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=8, var_1_26=63, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=8, var_1_26=63, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L201] RET assume_abort_if_not(var_1_31 >= 1) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=8, var_1_26=63, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L202] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=8, var_1_26=63, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=8, var_1_26=63, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L202] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=8, var_1_26=63, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L223] RET updateVariables() [L224] CALL step() [L59] signed long int stepLocal_5 = last_1_var_1_7; [L60] signed long int stepLocal_4 = last_1_var_1_7; [L61] signed long int stepLocal_3 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_3=8, stepLocal_4=-1, stepLocal_5=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=8, var_1_26=63, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L62] COND TRUE stepLocal_4 > last_1_var_1_6 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_3=8, stepLocal_5=-1, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=8, var_1_26=63, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L63] COND TRUE stepLocal_5 < last_1_var_1_25 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_3=8, var_1_10=128, var_1_12=1, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=8, var_1_26=63, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L64] COND FALSE !(stepLocal_3 <= last_1_var_1_12) [L67] var_1_12 = (((((var_1_5) < (var_1_15)) ? (var_1_5) : (var_1_15))) + var_1_16) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=127, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=8, var_1_26=63, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L73] COND FALSE !(last_1_var_1_25 < last_1_var_1_1) [L80] var_1_28 = var_1_31 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=127, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=8, var_1_26=63, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L82] COND FALSE !(var_1_21 != var_1_19) [L89] var_1_25 = (var_1_14 - (var_1_26 - var_1_24)) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=127, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=254, var_1_26=63, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L91] unsigned char stepLocal_0 = ! var_1_28; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_0=0, var_1_10=128, var_1_12=127, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=254, var_1_26=63, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L92] COND FALSE !(stepLocal_0 && var_1_28) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=127, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=-193, var_1_25=254, var_1_26=63, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L95] COND TRUE \read(var_1_28) [L96] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=127, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=127, var_1_23=4, var_1_24=-193, var_1_25=254, var_1_26=63, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L101] var_1_7 = var_1_5 [L102] unsigned char stepLocal_2 = var_1_12; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_2=127, var_1_10=128, var_1_12=127, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=127, var_1_23=4, var_1_24=-193, var_1_25=254, var_1_26=63, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=127, var_1_8=1, var_1_9=0] [L103] COND TRUE stepLocal_2 == ((((var_1_7) > (var_1_12)) ? (var_1_7) : (var_1_12))) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=127, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=127, var_1_23=4, var_1_24=-193, var_1_25=254, var_1_26=63, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=127, var_1_8=1, var_1_9=0] [L104] COND TRUE ! (var_1_12 > ((((var_1_7) < (var_1_4)) ? (var_1_7) : (var_1_4)))) [L105] var_1_8 = var_1_9 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=127, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=127, var_1_23=4, var_1_24=-193, var_1_25=254, var_1_26=63, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=127, var_1_8=0, var_1_9=0] [L108] COND FALSE !(var_1_12 < var_1_12) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=127, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=127, var_1_23=4, var_1_24=-193, var_1_25=254, var_1_26=63, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=127, var_1_8=0, var_1_9=0] [L111] COND TRUE \read(var_1_28) [L112] var_1_10 = var_1_4 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=127, var_1_12=127, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=127, var_1_23=4, var_1_24=-193, var_1_25=254, var_1_26=63, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=127, var_1_8=0, var_1_9=0] [L117] unsigned char stepLocal_10 = var_1_9; [L118] signed short int stepLocal_9 = var_1_10; [L119] unsigned char stepLocal_8 = var_1_15; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=0, stepLocal_8=-129, stepLocal_9=127, var_1_10=127, var_1_12=127, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=127, var_1_23=4, var_1_24=-193, var_1_25=254, var_1_26=63, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=127, var_1_8=0, var_1_9=0] [L120] COND TRUE \read(var_1_28) [L121] var_1_27 = var_1_5 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=0, stepLocal_8=-129, stepLocal_9=127, var_1_10=127, var_1_12=127, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=127, var_1_23=4, var_1_24=-193, var_1_25=254, var_1_26=63, var_1_27=127, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=127, var_1_8=0, var_1_9=0] [L135] unsigned char stepLocal_1 = var_1_4 > 2; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=0, stepLocal_1=1, stepLocal_8=-129, stepLocal_9=127, var_1_10=127, var_1_12=127, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=127, var_1_23=4, var_1_24=-193, var_1_25=254, var_1_26=63, var_1_27=127, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=1000000, var_1_7=127, var_1_8=0, var_1_9=0] [L136] COND TRUE \read(var_1_28) [L137] var_1_6 = (var_1_4 + var_1_27) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=0, stepLocal_1=1, stepLocal_8=-129, stepLocal_9=127, var_1_10=127, var_1_12=127, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=127, var_1_23=4, var_1_24=-193, var_1_25=254, var_1_26=63, var_1_27=127, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=254, var_1_7=127, var_1_8=0, var_1_9=0] [L143] signed short int stepLocal_7 = var_1_27; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=0, stepLocal_1=1, stepLocal_7=127, stepLocal_8=-129, stepLocal_9=127, var_1_10=127, var_1_12=127, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=127, var_1_23=4, var_1_24=-193, var_1_25=254, var_1_26=63, var_1_27=127, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=254, var_1_7=127, var_1_8=0, var_1_9=0] [L144] COND FALSE !(\read(var_1_8)) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=0, stepLocal_1=1, stepLocal_7=127, stepLocal_8=-129, stepLocal_9=127, var_1_10=127, var_1_12=127, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=127, var_1_23=4, var_1_24=-193, var_1_25=254, var_1_26=63, var_1_27=127, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=254, var_1_7=127, var_1_8=0, var_1_9=0] [L151] signed short int stepLocal_6 = var_1_10; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=0, stepLocal_1=1, stepLocal_6=127, stepLocal_7=127, stepLocal_8=-129, stepLocal_9=127, var_1_10=127, var_1_12=127, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=5/4, var_1_1=127, var_1_23=4, var_1_24=-193, var_1_25=254, var_1_26=63, var_1_27=127, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=254, var_1_7=127, var_1_8=0, var_1_9=0] [L152] COND FALSE !(\read(var_1_8)) [L159] var_1_17 = var_1_21 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=0, stepLocal_1=1, stepLocal_6=127, stepLocal_7=127, stepLocal_8=-129, stepLocal_9=127, var_1_10=127, var_1_12=127, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=1000005, var_1_1=127, var_1_21=1000005, var_1_23=4, var_1_24=-193, var_1_25=254, var_1_26=63, var_1_27=127, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=254, var_1_7=127, var_1_8=0, var_1_9=0] [L224] RET step() [L225] CALL, EXPR property() [L215-L216] return ((((((((((((! var_1_28) && var_1_28) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_28 ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) 1)))) && (var_1_28 ? (var_1_6 == ((unsigned long int) (var_1_4 + var_1_27))) : (((var_1_4 > 2) && var_1_8) ? (var_1_6 == ((unsigned long int) ((((var_1_27) > (var_1_4)) ? (var_1_27) : (var_1_4))))) : 1))) && (var_1_7 == ((signed short int) var_1_5))) && ((var_1_12 == ((((var_1_7) > (var_1_12)) ? (var_1_7) : (var_1_12)))) ? ((! (var_1_12 > ((((var_1_7) < (var_1_4)) ? (var_1_7) : (var_1_4))))) ? (var_1_8 == ((unsigned char) var_1_9)) : 1) : 1)) && ((var_1_12 < var_1_12) ? (var_1_10 == ((signed short int) (var_1_25 - ((((var_1_5) < (16)) ? (var_1_5) : (16)))))) : (var_1_28 ? (var_1_10 == ((signed short int) var_1_4)) : (var_1_10 == ((signed short int) var_1_25))))) && ((last_1_var_1_7 > last_1_var_1_6) ? ((last_1_var_1_7 < last_1_var_1_25) ? ((last_1_var_1_1 <= last_1_var_1_12) ? (var_1_12 == ((unsigned char) (((((var_1_4) < (var_1_14)) ? (var_1_4) : (var_1_14))) - var_1_5))) : (var_1_12 == ((unsigned char) (((((var_1_5) < (var_1_15)) ? (var_1_5) : (var_1_15))) + var_1_16)))) : (var_1_12 == ((unsigned char) var_1_16))) : 1)) && (var_1_8 ? ((var_1_10 <= var_1_23) ? (var_1_17 == ((float) ((((((1.0000000000000012E14f + var_1_18)) < (var_1_19)) ? ((1.0000000000000012E14f + var_1_18)) : (var_1_19))) + var_1_20))) : (var_1_17 == ((float) (var_1_21 - var_1_22)))) : (var_1_17 == ((float) var_1_21)))) && (var_1_8 ? ((var_1_27 <= last_1_var_1_23) ? (var_1_23 == ((unsigned char) 10)) : (var_1_23 == ((unsigned char) ((200 - var_1_24) - 64)))) : 1)) && ((var_1_21 != var_1_19) ? (var_1_28 ? (var_1_25 == ((unsigned char) ((((var_1_24) < (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) ? (var_1_24) : (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))))))) : (var_1_25 == ((unsigned char) ((((4) > (var_1_5)) ? (4) : (var_1_5)))))) : (var_1_25 == ((unsigned char) (var_1_14 - (var_1_26 - var_1_24)))))) && (var_1_28 ? (var_1_27 == ((signed short int) var_1_5)) : (var_1_28 ? ((var_1_10 <= var_1_15) ? (var_1_27 == ((signed short int) -10)) : 1) : ((var_1_10 <= (var_1_4 - var_1_5)) ? ((var_1_9 || (var_1_19 < var_1_20)) ? (var_1_27 == ((signed short int) (((((1) < (var_1_4)) ? (1) : (var_1_4))) + ((((var_1_14) > (var_1_10)) ? (var_1_14) : (var_1_10)))))) : 1) : 1)))) && ((last_1_var_1_25 < last_1_var_1_1) ? (((- last_1_var_1_17) < ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))) ? (var_1_28 == ((unsigned char) ((last_1_var_1_28 || var_1_9) && var_1_30))) : (var_1_28 == ((unsigned char) var_1_30))) : (var_1_28 == ((unsigned char) var_1_31))) ; [L225] RET, EXPR property() [L225] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=127, var_1_12=127, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=1000005, var_1_1=127, var_1_21=1000005, var_1_23=4, var_1_24=-193, var_1_25=254, var_1_26=63, var_1_27=127, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=254, var_1_7=127, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=127, var_1_12=127, var_1_14=-15618, var_1_15=-129, var_1_16=0, var_1_17=1000005, var_1_1=127, var_1_21=1000005, var_1_23=4, var_1_24=-193, var_1_25=254, var_1_26=63, var_1_27=127, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=127, var_1_6=254, var_1_7=127, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 83 locations, 158 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 7, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 374 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 374 mSDsluCounter, 1970 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1198 mSDsCounter, 234 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 217 IncrementalHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 234 mSolverCounterUnsat, 772 mSDtfsCounter, 217 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 194 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=5, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 201 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1307 NumberOfCodeBlocks, 1307 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1134 ConstructedInterpolants, 0 QuantifiedInterpolants, 2813 SizeOfPredicates, 0 NumberOfNonLiveVariables, 408 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 8352/8400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 03:24:21,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-99.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d1f2fd33e5d2eefab538c8e9509f9026512706d91745f186ee11fd8135485551 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:24:23,422 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:24:23,510 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:24:23,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:24:23,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:24:23,541 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:24:23,542 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:24:23,542 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:24:23,543 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:24:23,543 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:24:23,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:24:23,544 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:24:23,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:24:23,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:24:23,544 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:24:23,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:24:23,544 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:24:23,545 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:24:23,545 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:24:23,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:24:23,545 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:24:23,545 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:24:23,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:24:23,545 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:24:23,545 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:24:23,546 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:24:23,546 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:24:23,546 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:24:23,546 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:24:23,546 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:24:23,546 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:24:23,546 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:24:23,546 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:24:23,546 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:24:23,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:24:23,547 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:24:23,547 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:24:23,547 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:24:23,547 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:24:23,547 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:24:23,547 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:24:23,547 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:24:23,547 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:24:23,547 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:24:23,547 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:24:23,548 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d1f2fd33e5d2eefab538c8e9509f9026512706d91745f186ee11fd8135485551 [2025-03-17 03:24:23,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:24:23,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:24:23,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:24:23,807 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:24:23,807 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:24:23,808 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-99.i [2025-03-17 03:24:25,060 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07a0e0683/4b76bf1307d245a6b9cfcb2c106df2a6/FLAG540798d9b [2025-03-17 03:24:25,287 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:24:25,287 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-99.i [2025-03-17 03:24:25,298 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07a0e0683/4b76bf1307d245a6b9cfcb2c106df2a6/FLAG540798d9b [2025-03-17 03:24:25,631 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07a0e0683/4b76bf1307d245a6b9cfcb2c106df2a6 [2025-03-17 03:24:25,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:24:25,636 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:24:25,637 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:24:25,638 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:24:25,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:24:25,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:24:25" (1/1) ... [2025-03-17 03:24:25,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70589187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:25, skipping insertion in model container [2025-03-17 03:24:25,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:24:25" (1/1) ... [2025-03-17 03:24:25,663 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:24:25,766 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-99.i[916,929] [2025-03-17 03:24:25,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:24:25,833 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:24:25,841 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-99.i[916,929] [2025-03-17 03:24:25,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:24:25,891 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:24:25,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:25 WrapperNode [2025-03-17 03:24:25,893 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:24:25,894 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:24:25,894 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:24:25,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:24:25,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:25" (1/1) ... [2025-03-17 03:24:25,909 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:25" (1/1) ... [2025-03-17 03:24:25,935 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2025-03-17 03:24:25,935 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:24:25,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:24:25,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:24:25,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:24:25,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:25" (1/1) ... [2025-03-17 03:24:25,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:25" (1/1) ... [2025-03-17 03:24:25,949 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:25" (1/1) ... [2025-03-17 03:24:25,963 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:24:25,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:25" (1/1) ... [2025-03-17 03:24:25,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:25" (1/1) ... [2025-03-17 03:24:25,972 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:25" (1/1) ... [2025-03-17 03:24:25,976 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:25" (1/1) ... [2025-03-17 03:24:25,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:25" (1/1) ... [2025-03-17 03:24:25,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:25" (1/1) ... [2025-03-17 03:24:25,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:24:25,986 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:24:25,986 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:24:25,986 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:24:25,989 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:25" (1/1) ... [2025-03-17 03:24:25,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:24:26,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:24:26,018 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:24:26,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:24:26,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:24:26,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:24:26,044 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:24:26,044 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:24:26,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:24:26,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:24:26,119 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:24:26,121 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:24:27,238 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-17 03:24:27,239 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:24:27,247 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:24:27,248 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:24:27,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:24:27 BoogieIcfgContainer [2025-03-17 03:24:27,248 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:24:27,250 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:24:27,250 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:24:27,254 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:24:27,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:24:25" (1/3) ... [2025-03-17 03:24:27,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2965503a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:24:27, skipping insertion in model container [2025-03-17 03:24:27,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:25" (2/3) ... [2025-03-17 03:24:27,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2965503a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:24:27, skipping insertion in model container [2025-03-17 03:24:27,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:24:27" (3/3) ... [2025-03-17 03:24:27,259 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-99.i [2025-03-17 03:24:27,272 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:24:27,274 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-99.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:24:27,327 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:24:27,353 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;@1fe6a458, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:24:27,353 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:24:27,358 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 55 states have (on average 1.509090909090909) internal successors, (83), 56 states have internal predecessors, (83), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 03:24:27,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 03:24:27,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:24:27,370 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:24:27,370 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:24:27,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:24:27,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1213695430, now seen corresponding path program 1 times [2025-03-17 03:24:27,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:24:27,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433875213] [2025-03-17 03:24:27,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:24:27,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:24:27,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:24:27,393 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:24:27,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 03:24:27,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 03:24:27,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 03:24:27,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:24:27,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:24:27,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:24:27,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:24:27,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 624 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2025-03-17 03:24:27,759 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:24:27,759 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:24:27,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433875213] [2025-03-17 03:24:27,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433875213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:24:27,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:24:27,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:24:27,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107672571] [2025-03-17 03:24:27,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:24:27,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:24:27,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:24:27,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:24:27,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:24:27,778 INFO L87 Difference]: Start difference. First operand has 83 states, 55 states have (on average 1.509090909090909) internal successors, (83), 56 states have internal predecessors, (83), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 03:24:27,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:24:27,806 INFO L93 Difference]: Finished difference Result 163 states and 289 transitions. [2025-03-17 03:24:27,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:24:27,808 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 161 [2025-03-17 03:24:27,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:24:27,813 INFO L225 Difference]: With dead ends: 163 [2025-03-17 03:24:27,813 INFO L226 Difference]: Without dead ends: 81 [2025-03-17 03:24:27,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:24:27,817 INFO L435 NwaCegarLoop]: 128 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, 128 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:24:27,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:24:27,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-17 03:24:27,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-17 03:24:27,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 03:24:27,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 128 transitions. [2025-03-17 03:24:27,847 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 128 transitions. Word has length 161 [2025-03-17 03:24:27,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:24:27,847 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 128 transitions. [2025-03-17 03:24:27,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 03:24:27,848 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 128 transitions. [2025-03-17 03:24:27,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-17 03:24:27,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:24:27,851 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:24:27,862 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-17 03:24:28,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:24:28,052 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:24:28,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:24:28,053 INFO L85 PathProgramCache]: Analyzing trace with hash -233466962, now seen corresponding path program 1 times [2025-03-17 03:24:28,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:24:28,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528565016] [2025-03-17 03:24:28,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:24:28,053 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:24:28,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:24:28,057 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:24:28,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 03:24:28,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-17 03:24:28,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-17 03:24:28,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:24:28,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:24:28,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 03:24:28,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:24:29,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 03:24:29,290 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:24:29,290 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:24:29,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528565016] [2025-03-17 03:24:29,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528565016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:24:29,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:24:29,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:24:29,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394223994] [2025-03-17 03:24:29,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:24:29,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:24:29,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:24:29,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:24:29,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:24:29,292 INFO L87 Difference]: Start difference. First operand 81 states and 128 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 03:24:30,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:24:30,697 INFO L93 Difference]: Finished difference Result 242 states and 383 transitions. [2025-03-17 03:24:30,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:24:30,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 162 [2025-03-17 03:24:30,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:24:30,709 INFO L225 Difference]: With dead ends: 242 [2025-03-17 03:24:30,709 INFO L226 Difference]: Without dead ends: 162 [2025-03-17 03:24:30,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:24:30,710 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 95 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:24:30,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 436 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 03:24:30,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-17 03:24:30,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 127. [2025-03-17 03:24:30,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 74 states have internal predecessors, (98), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 03:24:30,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 198 transitions. [2025-03-17 03:24:30,744 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 198 transitions. Word has length 162 [2025-03-17 03:24:30,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:24:30,745 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 198 transitions. [2025-03-17 03:24:30,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 03:24:30,745 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 198 transitions. [2025-03-17 03:24:30,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-17 03:24:30,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:24:30,747 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:24:30,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-17 03:24:30,947 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-17 03:24:30,947 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:24:30,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:24:30,948 INFO L85 PathProgramCache]: Analyzing trace with hash 316815578, now seen corresponding path program 1 times [2025-03-17 03:24:30,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:24:30,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1417837978] [2025-03-17 03:24:30,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:24:30,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:24:30,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:24:30,950 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-17 03:24:30,952 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-17 03:24:30,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 03:24:31,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 03:24:31,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:24:31,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:24:31,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 03:24:31,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:24:31,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 03:24:31,522 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:24:31,522 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:24:31,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1417837978] [2025-03-17 03:24:31,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1417837978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:24:31,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:24:31,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:24:31,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840660046] [2025-03-17 03:24:31,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:24:31,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:24:31,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:24:31,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:24:31,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:24:31,524 INFO L87 Difference]: Start difference. First operand 127 states and 198 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 03:24:32,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:24:32,618 INFO L93 Difference]: Finished difference Result 242 states and 382 transitions. [2025-03-17 03:24:32,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:24:32,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 163 [2025-03-17 03:24:32,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:24:32,633 INFO L225 Difference]: With dead ends: 242 [2025-03-17 03:24:32,633 INFO L226 Difference]: Without dead ends: 162 [2025-03-17 03:24:32,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:24:32,634 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 93 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:24:32,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 491 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 03:24:32,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-17 03:24:32,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 128. [2025-03-17 03:24:32,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 75 states have (on average 1.32) internal successors, (99), 75 states have internal predecessors, (99), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 03:24:32,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 199 transitions. [2025-03-17 03:24:32,672 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 199 transitions. Word has length 163 [2025-03-17 03:24:32,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:24:32,673 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 199 transitions. [2025-03-17 03:24:32,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 03:24:32,674 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 199 transitions. [2025-03-17 03:24:32,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 03:24:32,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:24:32,677 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:24:32,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-17 03:24:32,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:24:32,877 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:24:32,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:24:32,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1436055410, now seen corresponding path program 1 times [2025-03-17 03:24:32,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:24:32,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581371957] [2025-03-17 03:24:32,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:24:32,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:24:32,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:24:32,885 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:24:32,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 03:24:32,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 03:24:33,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 03:24:33,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:24:33,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:24:33,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 03:24:33,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:24:33,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 03:24:33,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:24:33,678 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:24:33,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581371957] [2025-03-17 03:24:33,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581371957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:24:33,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:24:33,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:24:33,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514163097] [2025-03-17 03:24:33,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:24:33,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:24:33,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:24:33,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:24:33,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:24:33,681 INFO L87 Difference]: Start difference. First operand 128 states and 199 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 03:24:34,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:24:34,810 INFO L93 Difference]: Finished difference Result 242 states and 381 transitions. [2025-03-17 03:24:34,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:24:34,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 164 [2025-03-17 03:24:34,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:24:34,822 INFO L225 Difference]: With dead ends: 242 [2025-03-17 03:24:34,822 INFO L226 Difference]: Without dead ends: 162 [2025-03-17 03:24:34,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:24:34,823 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 77 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:24:34,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 423 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 03:24:34,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-17 03:24:34,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 129. [2025-03-17 03:24:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 76 states have internal predecessors, (100), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 03:24:34,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 200 transitions. [2025-03-17 03:24:34,849 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 200 transitions. Word has length 164 [2025-03-17 03:24:34,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:24:34,849 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 200 transitions. [2025-03-17 03:24:34,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 03:24:34,850 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 200 transitions. [2025-03-17 03:24:34,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 03:24:34,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:24:34,852 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:24:34,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-03-17 03:24:35,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:24:35,053 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:24:35,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:24:35,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1027231185, now seen corresponding path program 1 times [2025-03-17 03:24:35,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:24:35,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061309177] [2025-03-17 03:24:35,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:24:35,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:24:35,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:24:35,056 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-17 03:24:35,057 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-17 03:24:35,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 03:24:35,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 03:24:35,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:24:35,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:24:35,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 03:24:35,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:24:35,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-17 03:24:35,461 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:24:35,461 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:24:35,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061309177] [2025-03-17 03:24:35,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061309177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:24:35,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:24:35,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 03:24:35,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81060325] [2025-03-17 03:24:35,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:24:35,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 03:24:35,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:24:35,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 03:24:35,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:24:35,465 INFO L87 Difference]: Start difference. First operand 129 states and 200 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 03:24:37,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:24:37,073 INFO L93 Difference]: Finished difference Result 310 states and 465 transitions. [2025-03-17 03:24:37,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 03:24:37,073 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) Word has length 164 [2025-03-17 03:24:37,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:24:37,075 INFO L225 Difference]: With dead ends: 310 [2025-03-17 03:24:37,075 INFO L226 Difference]: Without dead ends: 230 [2025-03-17 03:24:37,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2025-03-17 03:24:37,076 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 236 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:24:37,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 661 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 03:24:37,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-17 03:24:37,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 155. [2025-03-17 03:24:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 99 states have (on average 1.2727272727272727) internal successors, (126), 99 states have internal predecessors, (126), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 03:24:37,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 226 transitions. [2025-03-17 03:24:37,094 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 226 transitions. Word has length 164 [2025-03-17 03:24:37,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:24:37,095 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 226 transitions. [2025-03-17 03:24:37,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 03:24:37,095 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 226 transitions. [2025-03-17 03:24:37,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-17 03:24:37,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:24:37,098 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:24:37,107 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 (6)] Ended with exit code 0 [2025-03-17 03:24:37,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:24:37,299 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:24:37,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:24:37,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1494273639, now seen corresponding path program 1 times [2025-03-17 03:24:37,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:24:37,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875087204] [2025-03-17 03:24:37,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:24:37,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:24:37,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:24:37,302 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:24:37,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-17 03:24:37,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 03:24:37,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 03:24:37,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:24:37,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:24:37,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 03:24:37,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:24:37,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 03:24:37,818 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:24:37,818 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:24:37,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [875087204] [2025-03-17 03:24:37,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [875087204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:24:37,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:24:37,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:24:37,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563703919] [2025-03-17 03:24:37,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:24:37,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:24:37,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:24:37,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:24:37,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:24:37,820 INFO L87 Difference]: Start difference. First operand 155 states and 226 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 03:24:38,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:24:38,299 INFO L93 Difference]: Finished difference Result 359 states and 526 transitions. [2025-03-17 03:24:38,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:24:38,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2025-03-17 03:24:38,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:24:38,311 INFO L225 Difference]: With dead ends: 359 [2025-03-17 03:24:38,312 INFO L226 Difference]: Without dead ends: 257 [2025-03-17 03:24:38,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 163 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-17 03:24:38,312 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 38 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 03:24:38,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 254 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 03:24:38,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-17 03:24:38,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2025-03-17 03:24:38,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 171 states have (on average 1.304093567251462) internal successors, (223), 171 states have internal predecessors, (223), 75 states have call successors, (75), 8 states have call predecessors, (75), 8 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-17 03:24:38,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 373 transitions. [2025-03-17 03:24:38,340 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 373 transitions. Word has length 165 [2025-03-17 03:24:38,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:24:38,340 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 373 transitions. [2025-03-17 03:24:38,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 03:24:38,340 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 373 transitions. [2025-03-17 03:24:38,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-17 03:24:38,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:24:38,341 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:24:38,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-17 03:24:38,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:24:38,542 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:24:38,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:24:38,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1701134257, now seen corresponding path program 1 times [2025-03-17 03:24:38,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:24:38,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326222468] [2025-03-17 03:24:38,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:24:38,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:24:38,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:24:38,545 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:24:38,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-17 03:24:38,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-17 03:24:38,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-17 03:24:38,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:24:38,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:24:38,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 03:24:38,788 INFO L279 TraceCheckSpWp]: Computing forward predicates...