./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-25.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 1799988bc1da19f433fa78a6cf8f051cf9c819a53eeb0215caf4dadecf0228ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:44:02,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:44:02,644 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:44:02,650 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:44:02,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:44:02,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:44:02,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:44:02,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:44:02,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:44:02,670 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:44:02,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:44:02,671 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:44:02,671 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:44:02,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:44:02,671 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:44:02,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:44:02,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:44:02,672 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:44:02,672 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:44:02,672 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:44:02,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:44:02,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:44:02,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:44:02,673 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:44:02,673 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:44:02,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:44:02,673 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:44:02,673 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:44:02,673 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:44:02,673 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:44:02,673 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:44:02,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:44:02,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:44:02,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:44:02,674 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:44:02,674 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:44:02,674 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:44:02,674 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:44:02,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:44:02,674 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:44:02,674 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:44:02,674 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:44:02,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:44:02,674 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 -> 1799988bc1da19f433fa78a6cf8f051cf9c819a53eeb0215caf4dadecf0228ae [2025-03-03 22:44:02,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:44:02,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:44:02,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:44:02,903 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:44:02,903 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:44:02,905 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-25.i [2025-03-03 22:44:04,089 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/201ddbf99/fbbb6e36332446e9ab84b48d440610b5/FLAG1bf404ca1 [2025-03-03 22:44:04,334 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:44:04,335 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-25.i [2025-03-03 22:44:04,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/201ddbf99/fbbb6e36332446e9ab84b48d440610b5/FLAG1bf404ca1 [2025-03-03 22:44:04,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/201ddbf99/fbbb6e36332446e9ab84b48d440610b5 [2025-03-03 22:44:04,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:44:04,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:44:04,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:44:04,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:44:04,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:44:04,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:44:04" (1/1) ... [2025-03-03 22:44:04,372 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@605ef515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:04, skipping insertion in model container [2025-03-03 22:44:04,372 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:44:04" (1/1) ... [2025-03-03 22:44:04,389 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:44:04,477 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-25.i[916,929] [2025-03-03 22:44:04,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:44:04,533 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:44:04,540 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-25.i[916,929] [2025-03-03 22:44:04,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:44:04,581 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:44:04,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:04 WrapperNode [2025-03-03 22:44:04,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:44:04,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:44:04,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:44:04,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:44:04,586 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:44:04" (1/1) ... [2025-03-03 22:44:04,592 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:44:04" (1/1) ... [2025-03-03 22:44:04,619 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203 [2025-03-03 22:44:04,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:44:04,620 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:44:04,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:44:04,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:44:04,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:04" (1/1) ... [2025-03-03 22:44:04,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:04" (1/1) ... [2025-03-03 22:44:04,634 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:04" (1/1) ... [2025-03-03 22:44:04,646 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:44:04,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:04" (1/1) ... [2025-03-03 22:44:04,647 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:04" (1/1) ... [2025-03-03 22:44:04,652 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:04" (1/1) ... [2025-03-03 22:44:04,656 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:04" (1/1) ... [2025-03-03 22:44:04,657 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:04" (1/1) ... [2025-03-03 22:44:04,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:04" (1/1) ... [2025-03-03 22:44:04,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:44:04,665 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:44:04,665 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:44:04,665 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:44:04,666 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:04" (1/1) ... [2025-03-03 22:44:04,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:44:04,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:44:04,689 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:44:04,691 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:44:04,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:44:04,706 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:44:04,706 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:44:04,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:44:04,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:44:04,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:44:04,764 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:44:04,765 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:44:05,116 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-03-03 22:44:05,116 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:44:05,126 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:44:05,127 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:44:05,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:44:05 BoogieIcfgContainer [2025-03-03 22:44:05,128 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:44:05,129 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:44:05,129 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:44:05,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:44:05,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:44:04" (1/3) ... [2025-03-03 22:44:05,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e7c888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:44:05, skipping insertion in model container [2025-03-03 22:44:05,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:04" (2/3) ... [2025-03-03 22:44:05,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e7c888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:44:05, skipping insertion in model container [2025-03-03 22:44:05,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:44:05" (3/3) ... [2025-03-03 22:44:05,136 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-25.i [2025-03-03 22:44:05,145 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:44:05,146 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-25.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:44:05,180 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:44:05,188 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;@51b7051e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:44:05,188 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:44:05,191 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 57 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 22:44:05,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 22:44:05,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:44:05,201 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:05,201 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:44:05,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:44:05,205 INFO L85 PathProgramCache]: Analyzing trace with hash 796266895, now seen corresponding path program 1 times [2025-03-03 22:44:05,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:44:05,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439906464] [2025-03-03 22:44:05,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:44:05,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:44:05,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 22:44:05,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 22:44:05,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:44:05,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:44:05,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-03 22:44:05,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:44:05,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439906464] [2025-03-03 22:44:05,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439906464] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:44:05,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053694779] [2025-03-03 22:44:05,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:44:05,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:44:05,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:44:05,540 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:44:05,542 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:44:05,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 22:44:05,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 22:44:05,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:44:05,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:44:05,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:44:05,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:44:05,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-03 22:44:05,740 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:44:05,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053694779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:44:05,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:44:05,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:44:05,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537996529] [2025-03-03 22:44:05,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:44:05,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:44:05,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:44:05,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:44:05,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:44:05,762 INFO L87 Difference]: Start difference. First operand has 83 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 57 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 22:44:05,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:44:05,780 INFO L93 Difference]: Finished difference Result 163 states and 273 transitions. [2025-03-03 22:44:05,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:44:05,781 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 164 [2025-03-03 22:44:05,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:44:05,786 INFO L225 Difference]: With dead ends: 163 [2025-03-03 22:44:05,788 INFO L226 Difference]: Without dead ends: 80 [2025-03-03 22:44:05,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 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:44:05,794 INFO L435 NwaCegarLoop]: 124 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, 124 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:44:05,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:44:05,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-03 22:44:05,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-03 22:44:05,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 22:44:05,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 121 transitions. [2025-03-03 22:44:05,830 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 121 transitions. Word has length 164 [2025-03-03 22:44:05,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:44:05,831 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 121 transitions. [2025-03-03 22:44:05,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 22:44:05,831 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 121 transitions. [2025-03-03 22:44:05,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 22:44:05,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:44:05,833 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:05,840 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:44:06,034 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:44:06,034 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:44:06,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:44:06,035 INFO L85 PathProgramCache]: Analyzing trace with hash -675309101, now seen corresponding path program 1 times [2025-03-03 22:44:06,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:44:06,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267630695] [2025-03-03 22:44:06,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:44:06,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:44:06,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 22:44:06,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 22:44:06,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:44:06,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:44:06,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:44:06,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:44:06,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267630695] [2025-03-03 22:44:06,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267630695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:44:06,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:44:06,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:44:06,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240065077] [2025-03-03 22:44:06,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:44:06,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:44:06,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:44:06,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:44:06,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:44:06,270 INFO L87 Difference]: Start difference. First operand 80 states and 121 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:44:06,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:44:06,309 INFO L93 Difference]: Finished difference Result 188 states and 285 transitions. [2025-03-03 22:44:06,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:44:06,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 164 [2025-03-03 22:44:06,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:44:06,312 INFO L225 Difference]: With dead ends: 188 [2025-03-03 22:44:06,312 INFO L226 Difference]: Without dead ends: 111 [2025-03-03 22:44:06,312 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:44:06,313 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 36 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:44:06,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 231 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:44:06,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-03 22:44:06,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2025-03-03 22:44:06,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 76 states have internal predecessors, (107), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 22:44:06,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2025-03-03 22:44:06,330 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 164 [2025-03-03 22:44:06,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:44:06,331 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2025-03-03 22:44:06,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:44:06,331 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2025-03-03 22:44:06,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 22:44:06,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:44:06,333 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:06,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:44:06,333 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:44:06,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:44:06,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1889471889, now seen corresponding path program 1 times [2025-03-03 22:44:06,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:44:06,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94239873] [2025-03-03 22:44:06,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:44:06,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:44:06,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 22:44:06,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 22:44:06,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:44:06,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:44:09,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:44:09,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:44:09,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94239873] [2025-03-03 22:44:09,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94239873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:44:09,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:44:09,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:44:09,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854084533] [2025-03-03 22:44:09,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:44:09,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:44:09,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:44:09,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:44:09,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:44:09,220 INFO L87 Difference]: Start difference. First operand 102 states and 155 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:44:09,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:44:09,753 INFO L93 Difference]: Finished difference Result 365 states and 554 transitions. [2025-03-03 22:44:09,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 22:44:09,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-03-03 22:44:09,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:44:09,755 INFO L225 Difference]: With dead ends: 365 [2025-03-03 22:44:09,755 INFO L226 Difference]: Without dead ends: 266 [2025-03-03 22:44:09,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:44:09,757 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 171 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 22:44:09,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 419 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 22:44:09,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-03 22:44:09,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 168. [2025-03-03 22:44:09,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 117 states have (on average 1.3675213675213675) internal successors, (160), 117 states have internal predecessors, (160), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 22:44:09,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2025-03-03 22:44:09,776 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 165 [2025-03-03 22:44:09,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:44:09,776 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2025-03-03 22:44:09,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:44:09,776 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2025-03-03 22:44:09,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 22:44:09,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:44:09,778 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:09,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:44:09,778 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:44:09,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:44:09,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1405927024, now seen corresponding path program 1 times [2025-03-03 22:44:09,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:44:09,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206295401] [2025-03-03 22:44:09,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:44:09,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:44:09,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 22:44:09,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 22:44:09,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:44:09,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:44:12,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:44:12,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:44:12,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206295401] [2025-03-03 22:44:12,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206295401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:44:12,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:44:12,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 22:44:12,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337063428] [2025-03-03 22:44:12,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:44:12,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:44:12,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:44:12,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:44:12,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:44:12,565 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:44:13,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:44:13,417 INFO L93 Difference]: Finished difference Result 365 states and 552 transitions. [2025-03-03 22:44:13,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 22:44:13,418 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-03-03 22:44:13,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:44:13,421 INFO L225 Difference]: With dead ends: 365 [2025-03-03 22:44:13,421 INFO L226 Difference]: Without dead ends: 266 [2025-03-03 22:44:13,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:44:13,422 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 186 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 22:44:13,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 472 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 22:44:13,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-03 22:44:13,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 170. [2025-03-03 22:44:13,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 119 states have (on average 1.361344537815126) internal successors, (162), 119 states have internal predecessors, (162), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 22:44:13,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 258 transitions. [2025-03-03 22:44:13,442 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 258 transitions. Word has length 165 [2025-03-03 22:44:13,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:44:13,443 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 258 transitions. [2025-03-03 22:44:13,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:44:13,443 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 258 transitions. [2025-03-03 22:44:13,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 22:44:13,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:44:13,446 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:13,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 22:44:13,447 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:44:13,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:44:13,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1081585809, now seen corresponding path program 1 times [2025-03-03 22:44:13,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:44:13,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431930299] [2025-03-03 22:44:13,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:44:13,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:44:13,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 22:44:13,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 22:44:13,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:44:13,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:44:13,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:44:13,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:44:13,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431930299] [2025-03-03 22:44:13,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431930299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:44:13,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:44:13,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:44:13,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265713136] [2025-03-03 22:44:13,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:44:13,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:44:13,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:44:13,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:44:13,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:44:13,754 INFO L87 Difference]: Start difference. First operand 170 states and 258 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:44:13,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:44:13,787 INFO L93 Difference]: Finished difference Result 355 states and 534 transitions. [2025-03-03 22:44:13,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:44:13,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-03-03 22:44:13,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:44:13,790 INFO L225 Difference]: With dead ends: 355 [2025-03-03 22:44:13,790 INFO L226 Difference]: Without dead ends: 238 [2025-03-03 22:44:13,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:44:13,791 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 42 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:44:13,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 284 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:44:13,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-03 22:44:13,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 224. [2025-03-03 22:44:13,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 169 states have (on average 1.3727810650887573) internal successors, (232), 170 states have internal predecessors, (232), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 22:44:13,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 332 transitions. [2025-03-03 22:44:13,816 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 332 transitions. Word has length 165 [2025-03-03 22:44:13,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:44:13,818 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 332 transitions. [2025-03-03 22:44:13,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:44:13,818 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 332 transitions. [2025-03-03 22:44:13,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 22:44:13,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:44:13,820 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:13,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 22:44:13,821 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:44:13,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:44:13,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1899936782, now seen corresponding path program 1 times [2025-03-03 22:44:13,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:44:13,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061242185] [2025-03-03 22:44:13,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:44:13,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:44:13,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 22:44:13,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 22:44:13,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:44:13,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:44:14,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:44:14,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:44:14,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061242185] [2025-03-03 22:44:14,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061242185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:44:14,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:44:14,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:44:14,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097404689] [2025-03-03 22:44:14,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:44:14,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:44:14,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:44:14,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:44:14,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:44:14,041 INFO L87 Difference]: Start difference. First operand 224 states and 332 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:44:14,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:44:14,259 INFO L93 Difference]: Finished difference Result 507 states and 752 transitions. [2025-03-03 22:44:14,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:44:14,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-03-03 22:44:14,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:44:14,264 INFO L225 Difference]: With dead ends: 507 [2025-03-03 22:44:14,264 INFO L226 Difference]: Without dead ends: 364 [2025-03-03 22:44:14,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:44:14,266 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 216 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:44:14,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 386 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:44:14,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-03 22:44:14,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 282. [2025-03-03 22:44:14,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 227 states have (on average 1.4008810572687225) internal successors, (318), 228 states have internal predecessors, (318), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 22:44:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 418 transitions. [2025-03-03 22:44:14,286 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 418 transitions. Word has length 165 [2025-03-03 22:44:14,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:44:14,287 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 418 transitions. [2025-03-03 22:44:14,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:44:14,290 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 418 transitions. [2025-03-03 22:44:14,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 22:44:14,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:44:14,291 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:14,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 22:44:14,291 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:44:14,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:44:14,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1911485649, now seen corresponding path program 1 times [2025-03-03 22:44:14,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:44:14,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232563694] [2025-03-03 22:44:14,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:44:14,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:44:14,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 22:44:14,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 22:44:14,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:44:14,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:44:14,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:44:14,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:44:14,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232563694] [2025-03-03 22:44:14,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232563694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:44:14,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:44:14,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 22:44:14,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258543157] [2025-03-03 22:44:14,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:44:14,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:44:14,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:44:14,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:44:14,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:44:14,489 INFO L87 Difference]: Start difference. First operand 282 states and 418 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:44:14,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:44:14,747 INFO L93 Difference]: Finished difference Result 507 states and 749 transitions. [2025-03-03 22:44:14,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:44:14,749 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-03-03 22:44:14,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:44:14,752 INFO L225 Difference]: With dead ends: 507 [2025-03-03 22:44:14,753 INFO L226 Difference]: Without dead ends: 364 [2025-03-03 22:44:14,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:44:14,754 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 175 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:44:14,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 619 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:44:14,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-03 22:44:14,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 258. [2025-03-03 22:44:14,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 203 states have (on average 1.3793103448275863) internal successors, (280), 204 states have internal predecessors, (280), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 22:44:14,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 380 transitions. [2025-03-03 22:44:14,773 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 380 transitions. Word has length 165 [2025-03-03 22:44:14,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:44:14,775 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 380 transitions. [2025-03-03 22:44:14,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:44:14,775 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 380 transitions. [2025-03-03 22:44:14,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 22:44:14,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:44:14,776 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:14,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 22:44:14,777 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:44:14,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:44:14,777 INFO L85 PathProgramCache]: Analyzing trace with hash 576027184, now seen corresponding path program 1 times [2025-03-03 22:44:14,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:44:14,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778370547] [2025-03-03 22:44:14,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:44:14,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:44:14,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 22:44:14,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 22:44:14,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:44:14,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:44:14,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1718026064] [2025-03-03 22:44:14,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:44:14,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:44:14,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:44:14,990 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:44:14,991 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:44:15,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 22:44:15,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 22:44:15,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:44:15,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:44:15,193 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:44:15,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 22:44:15,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 22:44:15,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:44:15,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:44:15,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:44:15,348 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:44:15,348 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:44:15,362 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:44:15,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-03 22:44:15,554 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:44:15,645 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:44:15,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:44:15 BoogieIcfgContainer [2025-03-03 22:44:15,650 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:44:15,650 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:44:15,650 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:44:15,651 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:44:15,651 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:44:05" (3/4) ... [2025-03-03 22:44:15,652 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:44:15,653 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:44:15,653 INFO L158 Benchmark]: Toolchain (without parser) took 11288.03ms. Allocated memory was 142.6MB in the beginning and 436.2MB in the end (delta: 293.6MB). Free memory was 105.5MB in the beginning and 293.4MB in the end (delta: -187.9MB). Peak memory consumption was 105.6MB. Max. memory is 16.1GB. [2025-03-03 22:44:15,654 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:44:15,654 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.35ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 89.3MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:44:15,654 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.87ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 85.6MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:44:15,654 INFO L158 Benchmark]: Boogie Preprocessor took 44.78ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 80.1MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:44:15,654 INFO L158 Benchmark]: IcfgBuilder took 462.89ms. Allocated memory is still 142.6MB. Free memory was 80.1MB in the beginning and 52.8MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 22:44:15,654 INFO L158 Benchmark]: TraceAbstraction took 10520.65ms. Allocated memory was 142.6MB in the beginning and 436.2MB in the end (delta: 293.6MB). Free memory was 52.1MB in the beginning and 293.5MB in the end (delta: -241.5MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. [2025-03-03 22:44:15,654 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 436.2MB. Free memory was 293.5MB in the beginning and 293.4MB in the end (delta: 90.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:44:15,655 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.35ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.35ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 89.3MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.87ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 85.6MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.78ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 80.1MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 462.89ms. Allocated memory is still 142.6MB. Free memory was 80.1MB in the beginning and 52.8MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10520.65ms. Allocated memory was 142.6MB in the beginning and 436.2MB in the end (delta: 293.6MB). Free memory was 52.1MB in the beginning and 293.5MB in the end (delta: -241.5MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 436.2MB. Free memory was 293.5MB in the beginning and 293.4MB in the end (delta: 90.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 128, overapproximation of someBinaryDOUBLEComparisonOperation at line 150, overapproximation of someBinaryDOUBLEComparisonOperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 152, overapproximation of someBinaryDOUBLEComparisonOperation at line 170, overapproximation of someBinaryDOUBLEComparisonOperation at line 193, overapproximation of someBinaryDOUBLEComparisonOperation at line 165, overapproximation of someBinaryDOUBLEComparisonOperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 172. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] signed short int var_1_4 = -256; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 1; [L26] double var_1_7 = 256.25; [L27] double var_1_8 = 127.8; [L28] signed short int var_1_10 = -2; [L29] signed short int var_1_11 = 5; [L30] signed short int var_1_12 = 16; [L31] unsigned long int var_1_13 = 1000000000; [L32] signed long int var_1_14 = -100000000; [L33] double var_1_16 = 50.8; [L34] double var_1_17 = 2.2; [L35] double var_1_18 = 2.675; [L36] double var_1_19 = 100.5; [L37] unsigned short int var_1_20 = 46250; [L38] double var_1_21 = 99999999999.75; [L39] double var_1_22 = 32.4; [L40] double var_1_23 = 15.25; [L41] signed short int var_1_24 = -100; [L42] signed char var_1_25 = -1; [L43] unsigned short int var_1_26 = 128; [L44] unsigned long int var_1_27 = 8; [L45] signed short int var_1_28 = -4; [L46] unsigned long int var_1_29 = 100; [L47] unsigned long int var_1_30 = 100; [L48] unsigned long int var_1_31 = 1000000000; [L49] double var_1_32 = 0.0; [L50] signed long int last_1_var_1_1 = -64; [L51] signed long int last_1_var_1_14 = -100000000; [L52] double last_1_var_1_16 = 50.8; [L53] signed short int last_1_var_1_24 = -100; [L54] signed short int last_1_var_1_28 = -4; [L55] unsigned long int last_1_var_1_29 = 100; [L56] unsigned long int last_1_var_1_30 = 100; VAL [isInitial=0, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=1, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L197] isInitial = 1 [L198] FCALL initially() [L199] int k_loop; [L200] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=1, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L200] COND TRUE k_loop < 1 [L201] CALL updateLastVariables() [L184] last_1_var_1_1 = var_1_1 [L185] last_1_var_1_14 = var_1_14 [L186] last_1_var_1_16 = var_1_16 [L187] last_1_var_1_24 = var_1_24 [L188] last_1_var_1_28 = var_1_28 [L189] last_1_var_1_29 = var_1_29 [L190] last_1_var_1_30 = var_1_30 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=1, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L201] RET updateLastVariables() [L202] CALL updateVariables() [L143] var_1_5 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L144] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L145] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L145] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L146] var_1_6 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_7=1025/4, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_7=1025/4, var_1_8=639/5] [L147] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_7=1025/4, var_1_8=639/5] [L148] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_7=1025/4, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_7=1025/4, var_1_8=639/5] [L148] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_7=1025/4, var_1_8=639/5] [L149] var_1_7 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_8=639/5] [L150] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_8=639/5] [L151] var_1_8 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L152] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L153] var_1_10 = __VERIFIER_nondet_short() [L154] CALL assume_abort_if_not(var_1_10 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L154] RET assume_abort_if_not(var_1_10 >= -16383) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L155] CALL assume_abort_if_not(var_1_10 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L155] RET assume_abort_if_not(var_1_10 <= 16383) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L156] var_1_11 = __VERIFIER_nondet_short() [L157] CALL assume_abort_if_not(var_1_11 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L157] RET assume_abort_if_not(var_1_11 >= -1) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L158] CALL assume_abort_if_not(var_1_11 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L158] RET assume_abort_if_not(var_1_11 <= 32766) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L159] var_1_12 = __VERIFIER_nondet_short() [L160] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L160] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L161] CALL assume_abort_if_not(var_1_12 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L161] RET assume_abort_if_not(var_1_12 <= 32766) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L162] var_1_17 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L163] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L164] var_1_18 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L165] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L166] var_1_20 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_20 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L167] RET assume_abort_if_not(var_1_20 >= 32767) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L168] CALL assume_abort_if_not(var_1_20 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L168] RET assume_abort_if_not(var_1_20 <= 65535) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L169] var_1_21 = __VERIFIER_nondet_double() [L170] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L170] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L171] var_1_22 = __VERIFIER_nondet_double() [L172] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L172] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L173] var_1_23 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L174] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L175] var_1_25 = __VERIFIER_nondet_char() [L176] CALL assume_abort_if_not(var_1_25 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_24=-100, var_1_25=126, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_24=-100, var_1_25=126, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L176] RET assume_abort_if_not(var_1_25 >= -128) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_24=-100, var_1_25=126, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L177] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_24=-100, var_1_25=126, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_24=-100, var_1_25=126, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L177] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_24=-100, var_1_25=126, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L178] CALL assume_abort_if_not(var_1_25 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_24=-100, var_1_25=126, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_24=-100, var_1_25=126, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L178] RET assume_abort_if_not(var_1_25 != 0) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_24=-100, var_1_25=126, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L179] var_1_31 = __VERIFIER_nondet_ulong() [L180] CALL assume_abort_if_not(var_1_31 >= 536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_24=-100, var_1_25=126, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=-3758096384, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_24=-100, var_1_25=126, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=-3758096384, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L180] RET assume_abort_if_not(var_1_31 >= 536870912) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_24=-100, var_1_25=126, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=-3758096384, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L181] CALL assume_abort_if_not(var_1_31 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_24=-100, var_1_25=126, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=-3758096384, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_24=-100, var_1_25=126, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=-3758096384, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L181] RET assume_abort_if_not(var_1_31 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_24=-100, var_1_25=126, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=-3758096384, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L202] RET updateVariables() [L203] CALL step() [L60] unsigned char stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_2=0, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_24=-100, var_1_25=126, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=-3758096384, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L61] COND FALSE !(var_1_5 && stepLocal_2) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_24=-100, var_1_25=126, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=-3758096384, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L64] COND TRUE (var_1_7 - var_1_8) > last_1_var_1_16 [L65] var_1_4 = ((((((last_1_var_1_30 - last_1_var_1_24) + var_1_10)) > ((((((var_1_11 - var_1_12)) > (4)) ? ((var_1_11 - var_1_12)) : (4))))) ? (((last_1_var_1_30 - last_1_var_1_24) + var_1_10)) : ((((((var_1_11 - var_1_12)) > (4)) ? ((var_1_11 - var_1_12)) : (4)))))) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_24=-100, var_1_25=126, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=-3758096384, var_1_32=0, var_1_4=-4, var_1_5=0, var_1_6=0] [L70] unsigned char stepLocal_6 = (var_1_12 / var_1_25) != (last_1_var_1_1 * 16); VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_6=1, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_24=-100, var_1_25=126, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=-3758096384, var_1_32=0, var_1_4=-4, var_1_5=0, var_1_6=0] [L71] COND FALSE !(stepLocal_6 && var_1_6) [L78] var_1_26 = last_1_var_1_29 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_24=-100, var_1_25=126, var_1_26=100, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=-3758096384, var_1_32=0, var_1_4=-4, var_1_5=0, var_1_6=0] [L80] signed long int stepLocal_5 = var_1_20 / var_1_25; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_5=260, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_24=-100, var_1_25=126, var_1_26=100, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=-3758096384, var_1_32=0, var_1_4=-4, var_1_5=0, var_1_6=0] [L81] COND TRUE stepLocal_5 > var_1_26 [L82] var_1_24 = var_1_11 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_24=100, var_1_25=126, var_1_26=100, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=-3758096384, var_1_32=0, var_1_4=-4, var_1_5=0, var_1_6=0] [L84] unsigned short int stepLocal_7 = var_1_26; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_7=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_24=100, var_1_25=126, var_1_26=100, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=-3758096384, var_1_32=0, var_1_4=-4, var_1_5=0, var_1_6=0] [L85] COND TRUE (last_1_var_1_28 + (- var_1_10)) > stepLocal_7 [L86] var_1_28 = (((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) - var_1_26) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_24=100, var_1_25=126, var_1_26=100, var_1_27=8, var_1_28=0, var_1_29=100, var_1_30=100, var_1_31=-3758096384, var_1_32=0, var_1_4=-4, var_1_5=0, var_1_6=0] [L88] signed long int stepLocal_4 = 128; [L89] signed short int stepLocal_3 = var_1_4; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_3=-4, stepLocal_4=128, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=-32769, var_1_24=100, var_1_25=126, var_1_26=100, var_1_27=8, var_1_28=0, var_1_29=100, var_1_30=100, var_1_31=-3758096384, var_1_32=0, var_1_4=-4, var_1_5=0, var_1_6=0] [L90] COND FALSE !(var_1_26 <= stepLocal_3) [L97] var_1_19 = var_1_22 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_4=128, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=2, var_1_1=-64, var_1_20=-32769, var_1_22=2, var_1_24=100, var_1_25=126, var_1_26=100, var_1_27=8, var_1_28=0, var_1_29=100, var_1_30=100, var_1_31=-3758096384, var_1_32=0, var_1_4=-4, var_1_5=0, var_1_6=0] [L99] COND TRUE (~ var_1_11) >= (~ var_1_20) [L100] var_1_32 = var_1_17 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_4=128, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=-32769, var_1_22=2, var_1_24=100, var_1_25=126, var_1_26=100, var_1_27=8, var_1_28=0, var_1_29=100, var_1_30=100, var_1_31=-3758096384, var_1_32=3, var_1_4=-4, var_1_5=0, var_1_6=0] [L102] COND FALSE !(\read(var_1_6)) [L105] var_1_14 = (((((var_1_4) > (var_1_12)) ? (var_1_4) : (var_1_12))) - (last_1_var_1_14 + var_1_26)) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_4=128, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=1000000000, var_1_14=100000002, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=-32769, var_1_22=2, var_1_24=100, var_1_25=126, var_1_26=100, var_1_27=8, var_1_28=0, var_1_29=100, var_1_30=100, var_1_31=-3758096384, var_1_32=3, var_1_4=-4, var_1_5=0, var_1_6=0] [L107] var_1_13 = (var_1_14 + var_1_12) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_4=128, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=100000104, var_1_14=100000002, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=-32769, var_1_22=2, var_1_24=100, var_1_25=126, var_1_26=100, var_1_27=8, var_1_28=0, var_1_29=100, var_1_30=100, var_1_31=-3758096384, var_1_32=3, var_1_4=-4, var_1_5=0, var_1_6=0] [L108] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_4=128, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=100000104, var_1_14=100000002, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=-32769, var_1_22=2, var_1_24=100, var_1_25=126, var_1_26=100, var_1_27=8, var_1_28=0, var_1_29=100, var_1_30=100, var_1_31=-3758096384, var_1_32=3, var_1_4=-4, var_1_5=0, var_1_6=0] [L113] signed long int stepLocal_1 = var_1_14; [L114] signed long int stepLocal_0 = var_1_14; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=100000002, stepLocal_1=100000002, stepLocal_4=128, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=100000104, var_1_14=100000002, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=-32769, var_1_22=2, var_1_24=100, var_1_25=126, var_1_26=100, var_1_27=8, var_1_28=0, var_1_29=100, var_1_30=100, var_1_31=-3758096384, var_1_32=3, var_1_4=-4, var_1_5=0, var_1_6=0] [L115] COND FALSE !(! (var_1_14 >= var_1_4)) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=100000002, stepLocal_1=100000002, stepLocal_4=128, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=100000104, var_1_14=100000002, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=-32769, var_1_22=2, var_1_24=100, var_1_25=126, var_1_26=100, var_1_27=8, var_1_28=0, var_1_29=100, var_1_30=100, var_1_31=-3758096384, var_1_32=3, var_1_4=-4, var_1_5=0, var_1_6=0] [L120] COND FALSE !(var_1_4 >= stepLocal_1) [L123] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=100000002, stepLocal_4=128, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=100000104, var_1_14=100000002, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-4, var_1_20=-32769, var_1_22=2, var_1_24=100, var_1_25=126, var_1_26=100, var_1_27=8, var_1_28=0, var_1_29=100, var_1_30=100, var_1_31=-3758096384, var_1_32=3, var_1_4=-4, var_1_5=0, var_1_6=0] [L126] var_1_29 = (var_1_1 + 4u) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=100000002, stepLocal_4=128, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=100000104, var_1_14=100000002, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-4, var_1_20=-32769, var_1_22=2, var_1_24=100, var_1_25=126, var_1_26=100, var_1_27=8, var_1_28=0, var_1_29=0, var_1_30=100, var_1_31=-3758096384, var_1_32=3, var_1_4=-4, var_1_5=0, var_1_6=0] [L127] COND TRUE (var_1_28 + (var_1_29 + var_1_26)) < var_1_4 [L128] var_1_16 = ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=100000002, stepLocal_4=128, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=100000104, var_1_14=100000002, var_1_16=3, var_1_17=3, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=-32769, var_1_22=2, var_1_24=100, var_1_25=126, var_1_26=100, var_1_27=8, var_1_28=0, var_1_29=0, var_1_30=100, var_1_31=-3758096384, var_1_32=3, var_1_4=-4, var_1_5=0, var_1_6=0] [L130] unsigned long int stepLocal_9 = var_1_20 - ((((var_1_29) > (var_1_12)) ? (var_1_29) : (var_1_12))); [L131] unsigned char stepLocal_8 = var_1_6; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=100000002, stepLocal_4=128, stepLocal_8=0, stepLocal_9=32665, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=100000104, var_1_14=100000002, var_1_16=3, var_1_17=3, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=-32769, var_1_22=2, var_1_24=100, var_1_25=126, var_1_26=100, var_1_27=8, var_1_28=0, var_1_29=0, var_1_30=100, var_1_31=-3758096384, var_1_32=3, var_1_4=-4, var_1_5=0, var_1_6=0] [L132] COND FALSE !(stepLocal_8 || var_1_5) [L139] var_1_30 = ((((var_1_26) > (var_1_29)) ? (var_1_26) : (var_1_29))) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=100000002, stepLocal_4=128, stepLocal_9=32665, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=100000104, var_1_14=100000002, var_1_16=3, var_1_17=3, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=-32769, var_1_22=2, var_1_24=100, var_1_25=126, var_1_26=100, var_1_27=8, var_1_28=0, var_1_29=0, var_1_30=100, var_1_31=-3758096384, var_1_32=3, var_1_4=-4, var_1_5=0, var_1_6=0] [L203] RET step() [L204] CALL, EXPR property() [L193-L194] return (((((((((((((! (var_1_14 >= var_1_4)) ? ((256 != var_1_14) ? (var_1_1 == ((signed long int) (var_1_4 + var_1_14))) : 1) : ((var_1_4 >= var_1_14) ? (var_1_1 == ((signed long int) var_1_14)) : (var_1_1 == ((signed long int) var_1_4)))) && ((var_1_5 && var_1_6) ? (var_1_4 == ((signed short int) ((((last_1_var_1_24) < (-100)) ? (last_1_var_1_24) : (-100))))) : (((var_1_7 - var_1_8) > last_1_var_1_16) ? (var_1_4 == ((signed short int) ((((((last_1_var_1_30 - last_1_var_1_24) + var_1_10)) > ((((((var_1_11 - var_1_12)) > (4)) ? ((var_1_11 - var_1_12)) : (4))))) ? (((last_1_var_1_30 - last_1_var_1_24) + var_1_10)) : ((((((var_1_11 - var_1_12)) > (4)) ? ((var_1_11 - var_1_12)) : (4)))))))) : (var_1_4 == ((signed short int) (last_1_var_1_30 + ((((var_1_10) > (last_1_var_1_24)) ? (var_1_10) : (last_1_var_1_24))))))))) && (var_1_13 == ((unsigned long int) (var_1_14 + var_1_12)))) && (var_1_6 ? (var_1_14 == ((signed long int) (var_1_4 - last_1_var_1_14))) : (var_1_14 == ((signed long int) (((((var_1_4) > (var_1_12)) ? (var_1_4) : (var_1_12))) - (last_1_var_1_14 + var_1_26)))))) && (((var_1_28 + (var_1_29 + var_1_26)) < var_1_4) ? (var_1_16 == ((double) ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))))) : 1)) && ((var_1_26 <= var_1_4) ? (((var_1_26 / (var_1_20 - 25)) >= 128) ? (var_1_19 == ((double) (((((15.25 - var_1_21) < 0 ) ? -(15.25 - var_1_21) : (15.25 - var_1_21))) - (var_1_22 + var_1_23)))) : (var_1_19 == ((double) var_1_22))) : (var_1_19 == ((double) var_1_22)))) && (((var_1_20 / var_1_25) > var_1_26) ? (var_1_24 == ((signed short int) var_1_11)) : 1)) && ((((var_1_12 / var_1_25) != (last_1_var_1_1 * 16)) && var_1_6) ? (var_1_6 ? (var_1_26 == ((unsigned short int) var_1_12)) : (var_1_26 == ((unsigned short int) last_1_var_1_29))) : (var_1_26 == ((unsigned short int) last_1_var_1_29)))) && (var_1_5 ? (((var_1_12 * var_1_13) >= var_1_11) ? (var_1_27 == ((unsigned long int) var_1_26)) : 1) : 1)) && (((last_1_var_1_28 + (- var_1_10)) > var_1_26) ? (var_1_28 == ((signed short int) (((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) - var_1_26))) : 1)) && (var_1_29 == ((unsigned long int) (var_1_1 + 4u)))) && ((var_1_6 || var_1_5) ? (((var_1_20 - ((((var_1_29) > (var_1_12)) ? (var_1_29) : (var_1_12)))) >= var_1_11) ? (var_1_30 == ((unsigned long int) var_1_29)) : (var_1_30 == ((unsigned long int) (((((var_1_20) > (var_1_4)) ? (var_1_20) : (var_1_4))) + ((1000000000u + var_1_31) - var_1_29))))) : (var_1_30 == ((unsigned long int) ((((var_1_26) > (var_1_29)) ? (var_1_26) : (var_1_29))))))) && (((~ var_1_11) >= (~ var_1_20)) ? (var_1_32 == ((double) var_1_17)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=100000104, var_1_14=100000002, var_1_16=3, var_1_17=3, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=-32769, var_1_22=2, var_1_24=100, var_1_25=126, var_1_26=100, var_1_27=8, var_1_28=0, var_1_29=0, var_1_30=100, var_1_31=-3758096384, var_1_32=3, var_1_4=-4, var_1_5=0, var_1_6=0] [L204] RET, EXPR property() [L204] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=100000104, var_1_14=100000002, var_1_16=3, var_1_17=3, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=-32769, var_1_22=2, var_1_24=100, var_1_25=126, var_1_26=100, var_1_27=8, var_1_28=0, var_1_29=0, var_1_30=100, var_1_31=-3758096384, var_1_32=3, var_1_4=-4, var_1_5=0, var_1_6=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-204, var_1_11=100, var_1_12=102, var_1_13=100000104, var_1_14=100000002, var_1_16=3, var_1_17=3, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=-32769, var_1_22=2, var_1_24=100, var_1_25=126, var_1_26=100, var_1_27=8, var_1_28=0, var_1_29=0, var_1_30=100, var_1_31=-3758096384, var_1_32=3, var_1_4=-4, var_1_5=0, var_1_6=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 8, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 826 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 826 mSDsluCounter, 2535 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1531 mSDsCounter, 326 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 870 IncrementalHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 326 mSolverCounterUnsat, 1004 mSDtfsCounter, 870 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=282occurred in iteration=6, InterpolantAutomatonStates: 35, 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, 7 MinimizatonAttempts, 405 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 1647 NumberOfCodeBlocks, 1647 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1309 ConstructedInterpolants, 0 QuantifiedInterpolants, 19543 SizeOfPredicates, 0 NumberOfNonLiveVariables, 421 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 8786/8832 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:44:15,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-25.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 1799988bc1da19f433fa78a6cf8f051cf9c819a53eeb0215caf4dadecf0228ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:44:17,483 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:44:17,553 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:44:17,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:44:17,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:44:17,581 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:44:17,582 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:44:17,582 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:44:17,582 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:44:17,582 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:44:17,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:44:17,583 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:44:17,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:44:17,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:44:17,583 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:44:17,583 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:44:17,583 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:44:17,583 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:44:17,583 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:44:17,584 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:44:17,584 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:44:17,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:44:17,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:44:17,584 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:44:17,584 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:44:17,584 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:44:17,584 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:44:17,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:44:17,584 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:44:17,584 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:44:17,585 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:44:17,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:44:17,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:44:17,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:44:17,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:44:17,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:44:17,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:44:17,585 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:44:17,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:44:17,585 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:44:17,585 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:44:17,585 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:44:17,585 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:44:17,585 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:44:17,585 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:44:17,585 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 -> 1799988bc1da19f433fa78a6cf8f051cf9c819a53eeb0215caf4dadecf0228ae [2025-03-03 22:44:17,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:44:17,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:44:17,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:44:17,816 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:44:17,817 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:44:17,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-25.i [2025-03-03 22:44:19,030 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ddc9bdd4/284896b79d04403185174efcefa03c9d/FLAG230297a13 [2025-03-03 22:44:19,229 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:44:19,229 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-25.i [2025-03-03 22:44:19,244 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ddc9bdd4/284896b79d04403185174efcefa03c9d/FLAG230297a13 [2025-03-03 22:44:19,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ddc9bdd4/284896b79d04403185174efcefa03c9d [2025-03-03 22:44:19,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:44:19,583 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:44:19,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:44:19,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:44:19,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:44:19,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:44:19" (1/1) ... [2025-03-03 22:44:19,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32c9f2b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:19, skipping insertion in model container [2025-03-03 22:44:19,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:44:19" (1/1) ... [2025-03-03 22:44:19,601 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:44:19,705 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-25.i[916,929] [2025-03-03 22:44:19,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:44:19,793 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:44:19,802 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-25.i[916,929] [2025-03-03 22:44:19,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:44:19,861 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:44:19,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:19 WrapperNode [2025-03-03 22:44:19,862 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:44:19,863 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:44:19,863 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:44:19,863 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:44:19,867 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:44:19" (1/1) ... [2025-03-03 22:44:19,874 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:44:19" (1/1) ... [2025-03-03 22:44:19,896 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2025-03-03 22:44:19,897 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:44:19,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:44:19,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:44:19,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:44:19,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:19" (1/1) ... [2025-03-03 22:44:19,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:19" (1/1) ... [2025-03-03 22:44:19,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:19" (1/1) ... [2025-03-03 22:44:19,918 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:44:19,918 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:19" (1/1) ... [2025-03-03 22:44:19,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:19" (1/1) ... [2025-03-03 22:44:19,925 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:19" (1/1) ... [2025-03-03 22:44:19,926 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:19" (1/1) ... [2025-03-03 22:44:19,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:19" (1/1) ... [2025-03-03 22:44:19,928 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:19" (1/1) ... [2025-03-03 22:44:19,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:44:19,931 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:44:19,931 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:44:19,931 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:44:19,931 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:19" (1/1) ... [2025-03-03 22:44:19,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:44:19,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:44:19,962 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:44:19,964 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:44:19,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:44:19,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:44:19,979 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:44:19,979 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:44:19,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:44:19,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:44:20,051 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:44:20,053 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:44:27,770 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-03-03 22:44:27,770 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:44:27,777 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:44:27,777 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:44:27,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:44:27 BoogieIcfgContainer [2025-03-03 22:44:27,778 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:44:27,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:44:27,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:44:27,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:44:27,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:44:19" (1/3) ... [2025-03-03 22:44:27,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11042d9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:44:27, skipping insertion in model container [2025-03-03 22:44:27,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:19" (2/3) ... [2025-03-03 22:44:27,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11042d9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:44:27, skipping insertion in model container [2025-03-03 22:44:27,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:44:27" (3/3) ... [2025-03-03 22:44:27,785 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-25.i [2025-03-03 22:44:27,795 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:44:27,796 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-25.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:44:27,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:44:27,837 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;@24a0176e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:44:27,837 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:44:27,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 57 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 22:44:27,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 22:44:27,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:44:27,865 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:27,865 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:44:27,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:44:27,868 INFO L85 PathProgramCache]: Analyzing trace with hash 796266895, now seen corresponding path program 1 times [2025-03-03 22:44:27,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:44:27,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [675619345] [2025-03-03 22:44:27,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:44:27,876 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:44:27,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:44:27,878 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:44:27,879 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:44:27,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 22:44:28,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 22:44:28,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:44:28,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:44:28,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:44:28,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:44:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 406 proven. 0 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2025-03-03 22:44:28,374 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:44:28,374 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:44:28,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [675619345] [2025-03-03 22:44:28,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [675619345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:44:28,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:44:28,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:44:28,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634308061] [2025-03-03 22:44:28,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:44:28,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:44:28,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:44:28,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:44:28,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:44:28,392 INFO L87 Difference]: Start difference. First operand has 83 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 57 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 22:44:28,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:44:28,412 INFO L93 Difference]: Finished difference Result 163 states and 273 transitions. [2025-03-03 22:44:28,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:44:28,413 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 164 [2025-03-03 22:44:28,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:44:28,417 INFO L225 Difference]: With dead ends: 163 [2025-03-03 22:44:28,417 INFO L226 Difference]: Without dead ends: 80 [2025-03-03 22:44:28,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 163 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:44:28,421 INFO L435 NwaCegarLoop]: 124 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, 124 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:44:28,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:44:28,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-03 22:44:28,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-03 22:44:28,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 22:44:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 121 transitions. [2025-03-03 22:44:28,455 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 121 transitions. Word has length 164 [2025-03-03 22:44:28,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:44:28,456 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 121 transitions. [2025-03-03 22:44:28,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 22:44:28,456 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 121 transitions. [2025-03-03 22:44:28,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 22:44:28,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:44:28,458 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:28,473 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:44:28,662 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:44:28,662 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:44:28,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:44:28,663 INFO L85 PathProgramCache]: Analyzing trace with hash -675309101, now seen corresponding path program 1 times [2025-03-03 22:44:28,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:44:28,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [592167457] [2025-03-03 22:44:28,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:44:28,663 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:44:28,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:44:28,665 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:44:28,666 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:44:28,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 22:44:29,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 22:44:29,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:44:29,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:44:29,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 22:44:29,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:44:29,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:44:29,286 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:44:29,286 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:44:29,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [592167457] [2025-03-03 22:44:29,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [592167457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:44:29,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:44:29,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:44:29,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724126174] [2025-03-03 22:44:29,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:44:29,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:44:29,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:44:29,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:44:29,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:44:29,288 INFO L87 Difference]: Start difference. First operand 80 states and 121 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:44:33,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:44:33,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:44:33,121 INFO L93 Difference]: Finished difference Result 188 states and 285 transitions. [2025-03-03 22:44:33,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:44:33,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 164 [2025-03-03 22:44:33,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:44:33,164 INFO L225 Difference]: With dead ends: 188 [2025-03-03 22:44:33,164 INFO L226 Difference]: Without dead ends: 111 [2025-03-03 22:44:33,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 162 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:44:33,165 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 36 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-03 22:44:33,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 230 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-03 22:44:33,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-03 22:44:33,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2025-03-03 22:44:33,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 76 states have internal predecessors, (107), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 22:44:33,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2025-03-03 22:44:33,178 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 164 [2025-03-03 22:44:33,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:44:33,178 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2025-03-03 22:44:33,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:44:33,179 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2025-03-03 22:44:33,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 22:44:33,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:44:33,184 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:33,201 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:44:33,384 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:44:33,385 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:44:33,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:44:33,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1889471889, now seen corresponding path program 1 times [2025-03-03 22:44:33,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:44:33,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97946168] [2025-03-03 22:44:33,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:44:33,387 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:44:33,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:44:33,389 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:44:33,389 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:44:33,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 22:44:33,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 22:44:33,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:44:33,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:44:33,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 22:44:33,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:44:35,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 269 proven. 60 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2025-03-03 22:44:35,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:44:36,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:44:36,399 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:44:36,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97946168] [2025-03-03 22:44:36,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97946168] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 22:44:36,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:44:36,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-03 22:44:36,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791418753] [2025-03-03 22:44:36,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:44:36,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:44:36,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:44:36,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:44:36,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:44:36,401 INFO L87 Difference]: Start difference. First operand 102 states and 155 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:44:40,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:44:40,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:44:40,248 INFO L93 Difference]: Finished difference Result 256 states and 387 transitions. [2025-03-03 22:44:40,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:44:40,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-03-03 22:44:40,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:44:40,292 INFO L225 Difference]: With dead ends: 256 [2025-03-03 22:44:40,292 INFO L226 Difference]: Without dead ends: 157 [2025-03-03 22:44:40,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:44:40,293 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 43 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-03 22:44:40,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 373 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-03 22:44:40,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-03 22:44:40,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 146. [2025-03-03 22:44:40,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 118 states have internal predecessors, (164), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 22:44:40,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 216 transitions. [2025-03-03 22:44:40,303 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 216 transitions. Word has length 165 [2025-03-03 22:44:40,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:44:40,303 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 216 transitions. [2025-03-03 22:44:40,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:44:40,304 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 216 transitions. [2025-03-03 22:44:40,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 22:44:40,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:44:40,305 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:40,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-03 22:44:40,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:44:40,506 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:44:40,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:44:40,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1899936782, now seen corresponding path program 1 times [2025-03-03 22:44:40,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:44:40,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176030419] [2025-03-03 22:44:40,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:44:40,507 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:44:40,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:44:40,512 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:44:40,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 22:44:40,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 22:44:40,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 22:44:40,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:44:40,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:44:40,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 22:44:40,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:44:44,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-03-03 22:44:44,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:44:45,873 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:44:45,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176030419] [2025-03-03 22:44:45,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176030419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:44:45,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1152753482] [2025-03-03 22:44:45,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:44:45,873 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 22:44:45,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 22:44:45,893 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 22:44:45,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-03 22:44:45,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 22:44:48,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 22:44:48,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:44:48,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:44:48,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 22:44:48,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:44:50,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-03-03 22:44:50,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:44:51,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1152753482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:44:51,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 22:44:51,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2025-03-03 22:44:51,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802698123] [2025-03-03 22:44:51,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 22:44:51,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 22:44:51,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:44:51,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 22:44:51,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:44:51,576 INFO L87 Difference]: Start difference. First operand 146 states and 216 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 22:44:58,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 22:45:03,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 22:45:04,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 22:45:09,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:45:12,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:45:16,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 22:45:17,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:45:17,274 INFO L93 Difference]: Finished difference Result 505 states and 746 transitions. [2025-03-03 22:45:17,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 22:45:17,275 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 165 [2025-03-03 22:45:17,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:45:17,278 INFO L225 Difference]: With dead ends: 505 [2025-03-03 22:45:17,278 INFO L226 Difference]: Without dead ends: 362 [2025-03-03 22:45:17,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-03-03 22:45:17,280 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 205 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 76 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:45:17,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 967 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 440 Invalid, 4 Unknown, 0 Unchecked, 25.0s Time] [2025-03-03 22:45:17,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-03 22:45:17,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 232. [2025-03-03 22:45:17,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 176 states have (on average 1.3693181818181819) internal successors, (241), 177 states have internal predecessors, (241), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 22:45:17,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 341 transitions. [2025-03-03 22:45:17,307 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 341 transitions. Word has length 165 [2025-03-03 22:45:17,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:45:17,308 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 341 transitions. [2025-03-03 22:45:17,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 22:45:17,308 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 341 transitions. [2025-03-03 22:45:17,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 22:45:17,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:45:17,309 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:17,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-03 22:45:17,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2025-03-03 22:45:17,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-03 22:45:17,710 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:45:17,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:45:17,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1911485649, now seen corresponding path program 1 times [2025-03-03 22:45:17,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:45:17,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687195915] [2025-03-03 22:45:17,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:45:17,711 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:45:17,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:45:17,713 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:45:17,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-03 22:45:17,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 22:45:18,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 22:45:18,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:45:18,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:45:18,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 22:45:18,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:45:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-03-03 22:45:21,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:45:23,604 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:45:23,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687195915] [2025-03-03 22:45:23,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687195915] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:45:23,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [245903668] [2025-03-03 22:45:23,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:45:23,605 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 22:45:23,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 22:45:23,607 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 22:45:23,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-03-03 22:45:23,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 22:45:25,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 22:45:25,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:45:25,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:45:25,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 22:45:25,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:45:28,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-03-03 22:45:28,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:45:29,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [245903668] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:45:29,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 22:45:29,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2025-03-03 22:45:29,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737271459] [2025-03-03 22:45:29,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 22:45:29,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 22:45:29,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:45:29,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 22:45:29,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-03 22:45:29,930 INFO L87 Difference]: Start difference. First operand 232 states and 341 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 22:45:36,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]