./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-12.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 b91ebd1689e4194b5d79759535cd76cf95d0d89593ded7ad5125fdaefe13f43a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:54:13,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:54:13,526 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:54:13,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:54:13,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:54:13,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:54:13,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:54:13,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:54:13,551 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:54:13,551 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:54:13,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:54:13,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:54:13,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:54:13,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:54:13,553 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:54:13,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:54:13,553 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:54:13,553 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:54:13,554 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:54:13,554 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:54:13,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:54:13,554 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:54:13,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:54:13,554 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:54:13,554 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:54:13,554 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:54:13,554 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:54:13,554 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:54:13,554 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:54:13,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:54:13,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:54:13,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:54:13,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:54:13,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:54:13,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:54:13,555 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:54:13,555 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:54:13,555 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:54:13,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:54:13,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:54:13,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:54:13,556 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:54:13,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:54:13,556 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 -> b91ebd1689e4194b5d79759535cd76cf95d0d89593ded7ad5125fdaefe13f43a [2025-03-03 22:54:13,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:54:13,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:54:13,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:54:13,779 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:54:13,780 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:54:13,781 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-12.i [2025-03-03 22:54:14,889 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c235f7ac/7bdb22b582314376803d4473f9235a30/FLAGf031dd05e [2025-03-03 22:54:15,165 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:54:15,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-12.i [2025-03-03 22:54:15,176 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c235f7ac/7bdb22b582314376803d4473f9235a30/FLAGf031dd05e [2025-03-03 22:54:15,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c235f7ac/7bdb22b582314376803d4473f9235a30 [2025-03-03 22:54:15,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:54:15,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:54:15,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:54:15,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:54:15,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:54:15,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:54:15" (1/1) ... [2025-03-03 22:54:15,465 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 03.03 10:54:15, skipping insertion in model container [2025-03-03 22:54:15,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:54:15" (1/1) ... [2025-03-03 22:54:15,480 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:54:15,577 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-12.i[916,929] [2025-03-03 22:54:15,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:54:15,663 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:54:15,672 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-12.i[916,929] [2025-03-03 22:54:15,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:54:15,718 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:54:15,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:15 WrapperNode [2025-03-03 22:54:15,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:54:15,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:54:15,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:54:15,719 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:54:15,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:15" (1/1) ... [2025-03-03 22:54:15,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:15" (1/1) ... [2025-03-03 22:54:15,754 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2025-03-03 22:54:15,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:54:15,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:54:15,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:54:15,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:54:15,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:15" (1/1) ... [2025-03-03 22:54:15,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:15" (1/1) ... [2025-03-03 22:54:15,765 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:15" (1/1) ... [2025-03-03 22:54:15,785 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:54:15,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:15" (1/1) ... [2025-03-03 22:54:15,789 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:15" (1/1) ... [2025-03-03 22:54:15,802 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:15" (1/1) ... [2025-03-03 22:54:15,804 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:15" (1/1) ... [2025-03-03 22:54:15,809 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:15" (1/1) ... [2025-03-03 22:54:15,810 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:15" (1/1) ... [2025-03-03 22:54:15,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:54:15,817 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:54:15,817 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:54:15,817 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:54:15,818 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:15" (1/1) ... [2025-03-03 22:54:15,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:54:15,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:54:15,842 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:54:15,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:54:15,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:54:15,862 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:54:15,862 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:54:15,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:54:15,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:54:15,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:54:15,922 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:54:15,923 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:54:16,187 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L190: havoc property_#t~bitwise17#1;havoc property_#t~short18#1; [2025-03-03 22:54:16,215 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 22:54:16,215 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:54:16,231 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:54:16,231 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:54:16,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:54:16 BoogieIcfgContainer [2025-03-03 22:54:16,232 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:54:16,235 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:54:16,235 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:54:16,239 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:54:16,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:54:15" (1/3) ... [2025-03-03 22:54:16,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634861b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:54:16, skipping insertion in model container [2025-03-03 22:54:16,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:15" (2/3) ... [2025-03-03 22:54:16,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634861b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:54:16, skipping insertion in model container [2025-03-03 22:54:16,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:54:16" (3/3) ... [2025-03-03 22:54:16,241 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-12.i [2025-03-03 22:54:16,252 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:54:16,254 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-12.i that has 2 procedures, 82 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:54:16,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:54:16,301 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;@191c43e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:54:16,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:54:16,304 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 59 states have internal predecessors, (86), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 22:54:16,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 22:54:16,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:16,313 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:54:16,314 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:16,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:16,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1575000491, now seen corresponding path program 1 times [2025-03-03 22:54:16,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:54:16,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248904282] [2025-03-03 22:54:16,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:16,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:54:16,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 22:54:16,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 22:54:16,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:16,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:16,546 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-03 22:54:16,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:54:16,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248904282] [2025-03-03 22:54:16,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248904282] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:54:16,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977221273] [2025-03-03 22:54:16,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:16,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:54:16,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:54:16,549 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:54:16,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 22:54:16,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 22:54:16,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 22:54:16,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:16,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:16,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:54:16,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:54:16,711 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-03 22:54:16,712 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:54:16,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977221273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:54:16,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:54:16,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:54:16,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47621321] [2025-03-03 22:54:16,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:54:16,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:54:16,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:54:16,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:54:16,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:54:16,734 INFO L87 Difference]: Start difference. First operand has 82 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 59 states have internal predecessors, (86), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 22:54:16,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:54:16,761 INFO L93 Difference]: Finished difference Result 158 states and 272 transitions. [2025-03-03 22:54:16,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:54:16,763 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 142 [2025-03-03 22:54:16,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:54:16,767 INFO L225 Difference]: With dead ends: 158 [2025-03-03 22:54:16,767 INFO L226 Difference]: Without dead ends: 79 [2025-03-03 22:54:16,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:54:16,771 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:54:16,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:54:16,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-03 22:54:16,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-03 22:54:16,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 56 states have internal predecessors, (81), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 22:54:16,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 123 transitions. [2025-03-03 22:54:16,798 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 123 transitions. Word has length 142 [2025-03-03 22:54:16,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:54:16,799 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 123 transitions. [2025-03-03 22:54:16,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 22:54:16,799 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 123 transitions. [2025-03-03 22:54:16,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 22:54:16,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:16,801 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:54:16,809 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-03 22:54:17,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 22:54:17,002 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:17,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:17,003 INFO L85 PathProgramCache]: Analyzing trace with hash -5572010, now seen corresponding path program 1 times [2025-03-03 22:54:17,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:54:17,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038887335] [2025-03-03 22:54:17,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:17,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:54:17,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 22:54:17,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 22:54:17,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:17,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:17,203 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-03 22:54:17,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:54:17,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038887335] [2025-03-03 22:54:17,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038887335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:54:17,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:54:17,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:54:17,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352641636] [2025-03-03 22:54:17,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:54:17,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:54:17,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:54:17,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:54:17,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:54:17,207 INFO L87 Difference]: Start difference. First operand 79 states and 123 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 22:54:17,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:54:17,256 INFO L93 Difference]: Finished difference Result 184 states and 289 transitions. [2025-03-03 22:54:17,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:54:17,259 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 142 [2025-03-03 22:54:17,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:54:17,261 INFO L225 Difference]: With dead ends: 184 [2025-03-03 22:54:17,261 INFO L226 Difference]: Without dead ends: 108 [2025-03-03 22:54:17,262 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-03 22:54:17,262 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 43 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 229 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-03 22:54:17,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 229 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:54:17,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-03 22:54:17,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 85. [2025-03-03 22:54:17,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 62 states have internal predecessors, (92), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 22:54:17,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 134 transitions. [2025-03-03 22:54:17,271 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 134 transitions. Word has length 142 [2025-03-03 22:54:17,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:54:17,272 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 134 transitions. [2025-03-03 22:54:17,272 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 22:54:17,272 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 134 transitions. [2025-03-03 22:54:17,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 22:54:17,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:17,273 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:54:17,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:54:17,274 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:17,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:17,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1802523369, now seen corresponding path program 1 times [2025-03-03 22:54:17,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:54:17,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897087992] [2025-03-03 22:54:17,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:17,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:54:17,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 22:54:17,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 22:54:17,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:17,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:17,436 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-03 22:54:17,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:54:17,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897087992] [2025-03-03 22:54:17,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897087992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:54:17,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:54:17,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:54:17,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613165486] [2025-03-03 22:54:17,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:54:17,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:54:17,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:54:17,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:54:17,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:54:17,441 INFO L87 Difference]: Start difference. First operand 85 states and 134 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 22:54:17,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:54:17,502 INFO L93 Difference]: Finished difference Result 207 states and 322 transitions. [2025-03-03 22:54:17,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:54:17,504 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 142 [2025-03-03 22:54:17,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:54:17,506 INFO L225 Difference]: With dead ends: 207 [2025-03-03 22:54:17,506 INFO L226 Difference]: Without dead ends: 125 [2025-03-03 22:54:17,506 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-03 22:54:17,507 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 49 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:54:17,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 235 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:54:17,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-03 22:54:17,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2025-03-03 22:54:17,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 85 states have (on average 1.3764705882352941) internal successors, (117), 86 states have internal predecessors, (117), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 22:54:17,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 179 transitions. [2025-03-03 22:54:17,523 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 179 transitions. Word has length 142 [2025-03-03 22:54:17,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:54:17,524 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 179 transitions. [2025-03-03 22:54:17,524 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 22:54:17,524 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 179 transitions. [2025-03-03 22:54:17,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 22:54:17,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:17,528 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:54:17,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:54:17,528 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:17,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:17,528 INFO L85 PathProgramCache]: Analyzing trace with hash -643062951, now seen corresponding path program 1 times [2025-03-03 22:54:17,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:54:17,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558917622] [2025-03-03 22:54:17,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:17,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:54:17,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 22:54:17,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 22:54:17,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:17,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:18,126 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-03 22:54:18,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:54:18,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558917622] [2025-03-03 22:54:18,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558917622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:54:18,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:54:18,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:54:18,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576774880] [2025-03-03 22:54:18,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:54:18,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:54:18,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:54:18,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:54:18,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:54:18,129 INFO L87 Difference]: Start difference. First operand 119 states and 179 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 22:54:18,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:54:18,207 INFO L93 Difference]: Finished difference Result 236 states and 356 transitions. [2025-03-03 22:54:18,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:54:18,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 143 [2025-03-03 22:54:18,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:54:18,212 INFO L225 Difference]: With dead ends: 236 [2025-03-03 22:54:18,214 INFO L226 Difference]: Without dead ends: 120 [2025-03-03 22:54:18,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:54:18,217 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 37 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:54:18,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 489 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:54:18,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-03 22:54:18,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2025-03-03 22:54:18,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 86 states have internal predecessors, (115), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 22:54:18,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 177 transitions. [2025-03-03 22:54:18,236 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 177 transitions. Word has length 143 [2025-03-03 22:54:18,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:54:18,236 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 177 transitions. [2025-03-03 22:54:18,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 22:54:18,237 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 177 transitions. [2025-03-03 22:54:18,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 22:54:18,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:18,241 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:54:18,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 22:54:18,241 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:18,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:18,241 INFO L85 PathProgramCache]: Analyzing trace with hash -334604521, now seen corresponding path program 1 times [2025-03-03 22:54:18,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:54:18,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356726619] [2025-03-03 22:54:18,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:18,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:54:18,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 22:54:18,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 22:54:18,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:18,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:54:18,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [526399261] [2025-03-03 22:54:18,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:18,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:54:18,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:54:18,397 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:54:18,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 22:54:18,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 22:54:18,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 22:54:18,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:18,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:18,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 22:54:18,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:54:18,914 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-03 22:54:18,915 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:54:18,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:54:18,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356726619] [2025-03-03 22:54:18,915 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 22:54:18,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526399261] [2025-03-03 22:54:18,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526399261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:54:18,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:54:18,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:54:18,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252469351] [2025-03-03 22:54:18,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:54:18,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:54:18,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:54:18,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:54:18,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:54:18,918 INFO L87 Difference]: Start difference. First operand 119 states and 177 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 22:54:19,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:54:19,056 INFO L93 Difference]: Finished difference Result 345 states and 517 transitions. [2025-03-03 22:54:19,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:54:19,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 145 [2025-03-03 22:54:19,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:54:19,059 INFO L225 Difference]: With dead ends: 345 [2025-03-03 22:54:19,060 INFO L226 Difference]: Without dead ends: 229 [2025-03-03 22:54:19,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:54:19,062 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 114 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:54:19,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 311 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:54:19,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-03-03 22:54:19,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 159. [2025-03-03 22:54:19,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 103 states have (on average 1.2912621359223302) internal successors, (133), 104 states have internal predecessors, (133), 52 states have call successors, (52), 3 states have call predecessors, (52), 3 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 22:54:19,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 237 transitions. [2025-03-03 22:54:19,089 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 237 transitions. Word has length 145 [2025-03-03 22:54:19,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:54:19,089 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 237 transitions. [2025-03-03 22:54:19,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 22:54:19,089 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 237 transitions. [2025-03-03 22:54:19,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 22:54:19,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:19,090 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:54:19,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 22:54:19,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:54:19,291 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:19,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:19,291 INFO L85 PathProgramCache]: Analyzing trace with hash 910159960, now seen corresponding path program 1 times [2025-03-03 22:54:19,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:54:19,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394565050] [2025-03-03 22:54:19,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:19,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:54:19,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 22:54:19,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 22:54:19,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:19,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:54:19,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1475843755] [2025-03-03 22:54:19,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:19,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:54:19,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:54:19,402 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:54:19,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 22:54:19,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 22:54:19,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 22:54:19,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:19,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:54:19,553 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:54:19,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 22:54:19,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 22:54:19,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:19,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:54:19,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:54:19,657 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:54:19,657 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:54:19,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 22:54:19,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:54:19,861 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-03 22:54:19,948 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:54:19,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:54:19 BoogieIcfgContainer [2025-03-03 22:54:19,952 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:54:19,953 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:54:19,953 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:54:19,953 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:54:19,954 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:54:16" (3/4) ... [2025-03-03 22:54:19,955 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:54:19,956 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:54:19,957 INFO L158 Benchmark]: Toolchain (without parser) took 4497.38ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 112.0MB in the beginning and 232.2MB in the end (delta: -120.2MB). Peak memory consumption was 140.0MB. Max. memory is 16.1GB. [2025-03-03 22:54:19,958 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:54:19,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.68ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 95.9MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:54:19,958 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.97ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 91.7MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:54:19,958 INFO L158 Benchmark]: Boogie Preprocessor took 60.90ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 85.6MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:54:19,959 INFO L158 Benchmark]: IcfgBuilder took 414.95ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 56.4MB in the end (delta: 29.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 22:54:19,959 INFO L158 Benchmark]: TraceAbstraction took 3717.30ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 55.9MB in the beginning and 232.3MB in the end (delta: -176.4MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. [2025-03-03 22:54:19,959 INFO L158 Benchmark]: Witness Printer took 3.31ms. Allocated memory is still 402.7MB. Free memory was 232.3MB in the beginning and 232.2MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:54:19,960 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.26ms. Allocated memory is still 201.3MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.68ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 95.9MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.97ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 91.7MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.90ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 85.6MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 414.95ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 56.4MB in the end (delta: 29.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3717.30ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 55.9MB in the beginning and 232.3MB in the end (delta: -176.4MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. * Witness Printer took 3.31ms. Allocated memory is still 402.7MB. Free memory was 232.3MB in the beginning and 232.2MB in the end (delta: 78.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 someBinaryArithmeticDOUBLEoperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 164, overapproximation of someBinaryDOUBLEComparisonOperation at line 168, overapproximation of someBinaryDOUBLEComparisonOperation at line 173, overapproximation of someBinaryDOUBLEComparisonOperation at line 190, overapproximation of someBinaryDOUBLEComparisonOperation at line 155, overapproximation of someBinaryDOUBLEComparisonOperation at line 166, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 190. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 100; [L23] unsigned char var_1_5 = 0; [L24] double var_1_6 = 4.5; [L25] unsigned char var_1_7 = 2; [L26] unsigned char var_1_8 = 2; [L27] double var_1_12 = 16.4; [L28] signed long int var_1_13 = 32; [L29] signed short int var_1_15 = -10; [L30] signed long int var_1_16 = -5; [L31] unsigned char var_1_17 = 1; [L32] signed short int var_1_18 = 500; [L33] double var_1_19 = 32.5; [L34] signed char var_1_20 = 0; [L35] double var_1_21 = 2.5; [L36] double var_1_22 = 0.0; [L37] double var_1_23 = 9.6; [L38] unsigned char var_1_24 = 64; [L39] unsigned char var_1_25 = 0; [L40] unsigned short int var_1_26 = 8; [L41] unsigned short int var_1_28 = 16; [L42] double var_1_29 = 200.5; [L43] unsigned short int var_1_30 = 20701; [L44] double last_1_var_1_6 = 4.5; [L45] signed long int last_1_var_1_16 = -5; [L46] signed short int last_1_var_1_18 = 500; [L47] signed char last_1_var_1_20 = 0; [L48] double last_1_var_1_21 = 2.5; [L49] unsigned char last_1_var_1_24 = 64; [L50] unsigned short int last_1_var_1_26 = 8; [L51] unsigned short int last_1_var_1_28 = 16; VAL [isInitial=0, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L194] isInitial = 1 [L195] FCALL initially() [L196] COND TRUE 1 [L197] CALL updateLastVariables() [L180] last_1_var_1_6 = var_1_6 [L181] last_1_var_1_16 = var_1_16 [L182] last_1_var_1_18 = var_1_18 [L183] last_1_var_1_20 = var_1_20 [L184] last_1_var_1_21 = var_1_21 [L185] last_1_var_1_24 = var_1_24 [L186] last_1_var_1_26 = var_1_26 [L187] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L197] RET updateLastVariables() [L198] CALL updateVariables() [L145] var_1_5 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_6=9/2, var_1_7=2, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_6=9/2, var_1_7=2, var_1_8=2] [L146] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_6=9/2, var_1_7=2, var_1_8=2] [L147] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L147] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L148] var_1_7 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_8=2] [L149] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_8=2] [L150] CALL assume_abort_if_not(var_1_7 <= 23) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L150] RET assume_abort_if_not(var_1_7 <= 23) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L151] var_1_8 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2] [L152] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2] [L153] CALL assume_abort_if_not(var_1_8 <= 23) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L153] RET assume_abort_if_not(var_1_8 <= 23) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L154] var_1_12 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L155] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L156] var_1_15 = __VERIFIER_nondet_short() [L157] CALL assume_abort_if_not(var_1_15 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L157] RET assume_abort_if_not(var_1_15 >= -32768) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L158] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L158] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L159] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L159] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L160] var_1_17 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L161] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L162] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L162] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L163] var_1_19 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854776000e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L164] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854776000e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L165] var_1_22 = __VERIFIER_nondet_double() [L166] CALL assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && 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_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L166] RET assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && 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_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L167] var_1_23 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L168] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L169] var_1_25 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L170] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L171] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L171] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L172] var_1_29 = __VERIFIER_nondet_double() [L173] CALL assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L173] RET assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L174] CALL assume_abort_if_not(var_1_29 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L174] RET assume_abort_if_not(var_1_29 != 0.0F) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L175] var_1_30 = __VERIFIER_nondet_ushort() [L176] CALL assume_abort_if_not(var_1_30 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L176] RET assume_abort_if_not(var_1_30 >= 16383) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L177] CALL assume_abort_if_not(var_1_30 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L177] RET assume_abort_if_not(var_1_30 <= 32767) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L198] RET updateVariables() [L199] CALL step() [L55] unsigned char stepLocal_0 = ! var_1_5; VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_0=1, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L56] COND FALSE !(((last_1_var_1_26 * last_1_var_1_20) >= last_1_var_1_28) && stepLocal_0) [L59] var_1_1 = last_1_var_1_26 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L61] EXPR (last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L61] signed long int stepLocal_1 = (last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))); [L62] COND FALSE !(last_1_var_1_18 <= stepLocal_1) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L69] signed long int stepLocal_3 = last_1_var_1_26 + var_1_8; VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L70] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L81] COND TRUE ! (last_1_var_1_18 <= (var_1_7 / var_1_15)) [L82] var_1_21 = ((((((var_1_22 - 7.5) - var_1_23)) > (var_1_12)) ? (((var_1_22 - 7.5) - var_1_23)) : (var_1_12))) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_12=0, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L86] COND FALSE !(var_1_17 || (var_1_8 >= last_1_var_1_24)) [L91] var_1_24 = var_1_7 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_12=0, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L93] COND FALSE !(var_1_19 == var_1_21) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_12=0, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L100] COND FALSE !(var_1_5 && var_1_17) [L103] var_1_16 = (var_1_8 - var_1_7) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_12=0, var_1_13=32, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L105] unsigned char stepLocal_2 = var_1_24; VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_2=2, stepLocal_3=8, var_1_12=0, var_1_13=32, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L106] COND TRUE var_1_21 > var_1_21 [L107] var_1_13 = (var_1_7 - var_1_24) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_2=2, stepLocal_3=8, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L115] COND FALSE !(\read(var_1_17)) [L122] var_1_28 = var_1_1 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_2=2, stepLocal_3=8, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L124] COND TRUE ! var_1_17 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_2=2, stepLocal_3=8, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L125] COND FALSE !(\read(var_1_17)) [L138] var_1_26 = var_1_18 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_2=2, stepLocal_3=8, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L199] RET step() [L200] CALL, EXPR property() [L190] EXPR ((((last_1_var_1_26 * last_1_var_1_20) >= last_1_var_1_28) && (! var_1_5)) ? (var_1_1 == ((signed short int) last_1_var_1_26)) : (var_1_1 == ((signed short int) last_1_var_1_26))) && ((last_1_var_1_18 <= ((last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) ? (((- last_1_var_1_21) > (last_1_var_1_6 + (- last_1_var_1_21))) ? (var_1_6 == ((double) var_1_12)) : (var_1_6 == ((double) var_1_12))) : 1) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L190] EXPR (last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L190] EXPR ((((last_1_var_1_26 * last_1_var_1_20) >= last_1_var_1_28) && (! var_1_5)) ? (var_1_1 == ((signed short int) last_1_var_1_26)) : (var_1_1 == ((signed short int) last_1_var_1_26))) && ((last_1_var_1_18 <= ((last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) ? (((- last_1_var_1_21) > (last_1_var_1_6 + (- last_1_var_1_21))) ? (var_1_6 == ((double) var_1_12)) : (var_1_6 == ((double) var_1_12))) : 1) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L190-L191] return ((((((((((((last_1_var_1_26 * last_1_var_1_20) >= last_1_var_1_28) && (! var_1_5)) ? (var_1_1 == ((signed short int) last_1_var_1_26)) : (var_1_1 == ((signed short int) last_1_var_1_26))) && ((last_1_var_1_18 <= ((last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) ? (((- last_1_var_1_21) > (last_1_var_1_6 + (- last_1_var_1_21))) ? (var_1_6 == ((double) var_1_12)) : (var_1_6 == ((double) var_1_12))) : 1)) && ((var_1_21 > var_1_21) ? (var_1_13 == ((signed long int) (var_1_7 - var_1_24))) : (((var_1_16 / var_1_15) < var_1_24) ? (var_1_13 == ((signed long int) var_1_7)) : (var_1_13 == ((signed long int) var_1_15))))) && ((var_1_5 && var_1_17) ? (var_1_16 == ((signed long int) ((((last_1_var_1_16) > (var_1_15)) ? (last_1_var_1_16) : (var_1_15))))) : (var_1_16 == ((signed long int) (var_1_8 - var_1_7))))) && (var_1_5 ? ((((((last_1_var_1_6) < ((1.0000000075E8 - var_1_19))) ? (last_1_var_1_6) : ((1.0000000075E8 - var_1_19)))) > var_1_12) ? (((last_1_var_1_26 + var_1_8) >= last_1_var_1_24) ? (var_1_18 == ((signed short int) var_1_7)) : (var_1_18 == ((signed short int) last_1_var_1_24))) : (var_1_18 == ((signed short int) var_1_8))) : 1)) && ((var_1_19 == var_1_21) ? ((! var_1_17) ? (var_1_20 == ((signed char) ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) : (var_1_20 == ((signed char) var_1_7))) : 1)) && ((! (last_1_var_1_18 <= (var_1_7 / var_1_15))) ? (var_1_21 == ((double) ((((((var_1_22 - 7.5) - var_1_23)) > (var_1_12)) ? (((var_1_22 - 7.5) - var_1_23)) : (var_1_12))))) : (var_1_21 == ((double) var_1_22)))) && ((var_1_17 || (var_1_8 >= last_1_var_1_24)) ? ((var_1_17 && (var_1_21 != var_1_23)) ? (var_1_24 == ((unsigned char) ((((var_1_7) < (var_1_25)) ? (var_1_7) : (var_1_25))))) : 1) : (var_1_24 == ((unsigned char) var_1_7)))) && ((! var_1_17) ? (var_1_17 ? ((var_1_6 <= ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))) ? ((var_1_19 <= ((var_1_12 + var_1_6) / var_1_22)) ? (((~ var_1_24) > var_1_1) ? (var_1_26 == ((unsigned short int) var_1_13)) : (var_1_26 == ((unsigned short int) var_1_7))) : 1) : (var_1_26 == ((unsigned short int) var_1_18))) : (var_1_26 == ((unsigned short int) var_1_18))) : (var_1_26 == ((unsigned short int) var_1_8)))) && (var_1_17 ? ((var_1_21 <= ((var_1_6 / var_1_22) + (var_1_21 / var_1_29))) ? (var_1_28 == ((unsigned short int) ((59265 - ((((var_1_8) > (var_1_18)) ? (var_1_8) : (var_1_18)))) - (var_1_30 - var_1_13)))) : (var_1_28 == ((unsigned short int) var_1_13))) : (var_1_28 == ((unsigned short int) var_1_1))) ; [L200] RET, EXPR property() [L200] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 6, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 243 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 243 mSDsluCounter, 1385 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 791 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 103 IncrementalHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 594 mSDtfsCounter, 103 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=5, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 100 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1291 NumberOfCodeBlocks, 1291 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 850 ConstructedInterpolants, 0 QuantifiedInterpolants, 1988 SizeOfPredicates, 5 NumberOfNonLiveVariables, 726 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 5000/5040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 22:54:19,976 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-12.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 b91ebd1689e4194b5d79759535cd76cf95d0d89593ded7ad5125fdaefe13f43a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:54:21,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:54:21,930 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:54:21,936 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:54:21,936 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:54:21,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:54:21,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:54:21,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:54:21,951 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:54:21,951 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:54:21,951 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:54:21,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:54:21,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:54:21,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:54:21,952 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:54:21,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:54:21,952 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:54:21,952 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:54:21,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:54:21,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:54:21,952 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:54:21,952 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:54:21,952 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:54:21,952 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:54:21,952 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:54:21,952 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:54:21,952 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:54:21,952 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:54:21,952 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:54:21,952 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:54:21,952 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:54:21,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:54:21,953 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:54:21,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:54:21,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:54:21,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:54:21,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:54:21,953 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:54:21,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:54:21,953 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:54:21,953 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:54:21,953 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:54:21,953 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:54:21,953 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:54:21,953 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:54:21,953 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b91ebd1689e4194b5d79759535cd76cf95d0d89593ded7ad5125fdaefe13f43a [2025-03-03 22:54:22,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:54:22,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:54:22,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:54:22,197 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:54:22,197 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:54:22,198 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-12.i [2025-03-03 22:54:23,376 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f197036ad/bc41dec513dd488388071935067a5bd8/FLAG246878b68 [2025-03-03 22:54:23,578 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:54:23,581 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-12.i [2025-03-03 22:54:23,589 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f197036ad/bc41dec513dd488388071935067a5bd8/FLAG246878b68 [2025-03-03 22:54:23,602 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f197036ad/bc41dec513dd488388071935067a5bd8 [2025-03-03 22:54:23,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:54:23,605 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:54:23,606 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:54:23,607 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:54:23,610 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:54:23,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:54:23" (1/1) ... [2025-03-03 22:54:23,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61698d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:23, skipping insertion in model container [2025-03-03 22:54:23,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:54:23" (1/1) ... [2025-03-03 22:54:23,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:54:23,748 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-12.i[916,929] [2025-03-03 22:54:23,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:54:23,823 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:54:23,832 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-12.i[916,929] [2025-03-03 22:54:23,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:54:23,894 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:54:23,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:23 WrapperNode [2025-03-03 22:54:23,897 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:54:23,897 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:54:23,898 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:54:23,898 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:54:23,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:23" (1/1) ... [2025-03-03 22:54:23,916 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:23" (1/1) ... [2025-03-03 22:54:23,940 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2025-03-03 22:54:23,945 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:54:23,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:54:23,946 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:54:23,946 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:54:23,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:23" (1/1) ... [2025-03-03 22:54:23,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:23" (1/1) ... [2025-03-03 22:54:23,957 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:23" (1/1) ... [2025-03-03 22:54:23,974 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:54:23,978 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:23" (1/1) ... [2025-03-03 22:54:23,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:23" (1/1) ... [2025-03-03 22:54:23,990 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:23" (1/1) ... [2025-03-03 22:54:23,991 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:23" (1/1) ... [2025-03-03 22:54:23,992 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:23" (1/1) ... [2025-03-03 22:54:23,993 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:23" (1/1) ... [2025-03-03 22:54:24,000 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:54:24,001 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:54:24,001 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:54:24,001 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:54:24,002 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:23" (1/1) ... [2025-03-03 22:54:24,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:54:24,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:54:24,028 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:54:24,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:54:24,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:54:24,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:54:24,046 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:54:24,046 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:54:24,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:54:24,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:54:24,103 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:54:24,105 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:54:49,032 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 22:54:49,034 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:54:49,042 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:54:49,042 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:54:49,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:54:49 BoogieIcfgContainer [2025-03-03 22:54:49,042 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:54:49,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:54:49,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:54:49,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:54:49,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:54:23" (1/3) ... [2025-03-03 22:54:49,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d969aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:54:49, skipping insertion in model container [2025-03-03 22:54:49,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:23" (2/3) ... [2025-03-03 22:54:49,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d969aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:54:49, skipping insertion in model container [2025-03-03 22:54:49,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:54:49" (3/3) ... [2025-03-03 22:54:49,052 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-12.i [2025-03-03 22:54:49,061 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:54:49,062 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-12.i that has 2 procedures, 75 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:54:49,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:54:49,103 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;@573f0f3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:54:49,103 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:54:49,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 52 states have internal predecessors, (76), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 22:54:49,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 22:54:49,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:49,116 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:54:49,116 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:49,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:49,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1437092757, now seen corresponding path program 1 times [2025-03-03 22:54:49,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:54:49,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091980580] [2025-03-03 22:54:49,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:49,132 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:54:49,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:54:49,135 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:54:49,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 22:54:49,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 22:54:50,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 22:54:50,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:50,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:50,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:54:50,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:54:50,644 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2025-03-03 22:54:50,644 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:54:50,644 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:54:50,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091980580] [2025-03-03 22:54:50,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091980580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:54:50,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:54:50,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:54:50,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808409659] [2025-03-03 22:54:50,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:54:50,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:54:50,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:54:50,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:54:50,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:54:50,661 INFO L87 Difference]: Start difference. First operand has 75 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 52 states have internal predecessors, (76), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 22:54:50,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:54:50,677 INFO L93 Difference]: Finished difference Result 144 states and 252 transitions. [2025-03-03 22:54:50,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:54:50,679 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2025-03-03 22:54:50,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:54:50,683 INFO L225 Difference]: With dead ends: 144 [2025-03-03 22:54:50,683 INFO L226 Difference]: Without dead ends: 72 [2025-03-03 22:54:50,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:54:50,687 INFO L435 NwaCegarLoop]: 112 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, 112 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:54:50,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:54:50,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-03 22:54:50,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-03 22:54:50,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 22:54:50,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 112 transitions. [2025-03-03 22:54:50,738 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 112 transitions. Word has length 139 [2025-03-03 22:54:50,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:54:50,739 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 112 transitions. [2025-03-03 22:54:50,739 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 22:54:50,739 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 112 transitions. [2025-03-03 22:54:50,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 22:54:50,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:50,741 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:54:50,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 22:54:50,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:54:50,943 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:50,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:50,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1128454634, now seen corresponding path program 1 times [2025-03-03 22:54:50,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:54:50,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212381029] [2025-03-03 22:54:50,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:50,944 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:54:50,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:54:50,946 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:54:50,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 22:54:51,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 22:54:52,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 22:54:52,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:52,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:52,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 22:54:52,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:55:05,492 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-03 22:55:05,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:55:05,493 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:55:05,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212381029] [2025-03-03 22:55:05,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212381029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:55:05,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:55:05,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:55:05,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268567834] [2025-03-03 22:55:05,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:55:05,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:55:05,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:55:05,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:55:05,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:55:05,495 INFO L87 Difference]: Start difference. First operand 72 states and 112 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 22:55:10,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:55:15,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.50s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:55:19,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.49s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:55:24,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.52s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:55:28,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.79s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:55:32,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:55:37,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:55:42,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.50s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:55:46,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.78s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:55:50,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:55:50,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:55:50,936 INFO L93 Difference]: Finished difference Result 217 states and 341 transitions. [2025-03-03 22:55:51,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:55:51,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 140 [2025-03-03 22:55:51,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:55:51,206 INFO L225 Difference]: With dead ends: 217 [2025-03-03 22:55:51,206 INFO L226 Difference]: Without dead ends: 148 [2025-03-03 22:55:51,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:55:51,207 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 106 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 43 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:55:51,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 315 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 11 Invalid, 10 Unknown, 0 Unchecked, 45.1s Time] [2025-03-03 22:55:51,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-03 22:55:51,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 112. [2025-03-03 22:55:51,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 22:55:51,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 172 transitions. [2025-03-03 22:55:51,236 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 172 transitions. Word has length 140 [2025-03-03 22:55:51,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:55:51,237 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 172 transitions. [2025-03-03 22:55:51,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 22:55:51,237 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 172 transitions. [2025-03-03 22:55:51,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 22:55:51,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:55:51,238 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:55:51,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 22:55:51,438 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-03 22:55:51,439 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:55:51,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:55:51,439 INFO L85 PathProgramCache]: Analyzing trace with hash -2125526987, now seen corresponding path program 1 times [2025-03-03 22:55:51,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:55:51,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1807127458] [2025-03-03 22:55:51,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:55:51,440 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:55:51,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:55:51,442 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-03 22:55:51,442 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-03 22:55:51,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 22:55:52,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 22:55:52,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:55:52,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:55:52,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 22:55:52,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:55:53,441 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-03 22:55:53,442 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:55:53,442 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:55:53,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1807127458] [2025-03-03 22:55:53,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1807127458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:55:53,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:55:53,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:55:53,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761917144] [2025-03-03 22:55:53,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:55:53,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:55:53,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:55:53,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:55:53,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:55:53,444 INFO L87 Difference]: Start difference. First operand 112 states and 172 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 22:55:58,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.62s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []