./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-77.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-77.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 0cbe4eb7aae73c01b831078f0e738c68709fa97155cdb7dce934011117170926 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:02:23,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:02:23,725 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:02:23,728 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:02:23,729 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:02:23,749 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:02:23,750 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:02:23,750 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:02:23,750 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:02:23,750 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:02:23,750 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:02:23,750 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:02:23,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:02:23,750 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:02:23,750 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:02:23,750 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:02:23,750 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:02:23,751 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:02:23,751 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:02:23,751 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:02:23,751 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:02:23,751 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:02:23,751 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:02:23,751 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:02:23,751 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:02:23,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:02:23,751 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:02:23,751 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:02:23,751 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:02:23,751 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:02:23,751 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:02:23,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:02:23,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:02:23,752 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:02:23,752 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:02:23,752 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:02:23,752 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:02:23,752 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:02:23,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:02:23,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:02:23,752 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:02:23,752 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:02:23,753 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:02:23,753 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 -> 0cbe4eb7aae73c01b831078f0e738c68709fa97155cdb7dce934011117170926 [2025-03-08 14:02:23,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:02:24,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:02:24,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:02:24,007 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:02:24,008 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:02:24,009 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-77.i [2025-03-08 14:02:25,167 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f9716d27/2228c7717bcc427ea81768e2bc9a7774/FLAGb130098cb [2025-03-08 14:02:25,374 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:02:25,375 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-77.i [2025-03-08 14:02:25,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f9716d27/2228c7717bcc427ea81768e2bc9a7774/FLAGb130098cb [2025-03-08 14:02:25,412 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f9716d27/2228c7717bcc427ea81768e2bc9a7774 [2025-03-08 14:02:25,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:02:25,415 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:02:25,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:02:25,416 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:02:25,418 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:02:25,419 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:02:25" (1/1) ... [2025-03-08 14:02:25,420 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33fcb07e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:25, skipping insertion in model container [2025-03-08 14:02:25,420 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:02:25" (1/1) ... [2025-03-08 14:02:25,435 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:02:25,528 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-77.i[916,929] [2025-03-08 14:02:25,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:02:25,583 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:02:25,589 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-77.i[916,929] [2025-03-08 14:02:25,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:02:25,638 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:02:25,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:25 WrapperNode [2025-03-08 14:02:25,639 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:02:25,640 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:02:25,640 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:02:25,640 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:02:25,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:25" (1/1) ... [2025-03-08 14:02:25,656 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:25" (1/1) ... [2025-03-08 14:02:25,684 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 212 [2025-03-08 14:02:25,687 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:02:25,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:02:25,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:02:25,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:02:25,699 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:25" (1/1) ... [2025-03-08 14:02:25,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:25" (1/1) ... [2025-03-08 14:02:25,701 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:25" (1/1) ... [2025-03-08 14:02:25,715 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-08 14:02:25,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:25" (1/1) ... [2025-03-08 14:02:25,719 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:25" (1/1) ... [2025-03-08 14:02:25,728 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:25" (1/1) ... [2025-03-08 14:02:25,729 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:25" (1/1) ... [2025-03-08 14:02:25,731 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:25" (1/1) ... [2025-03-08 14:02:25,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:25" (1/1) ... [2025-03-08 14:02:25,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:02:25,737 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:02:25,739 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:02:25,739 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:02:25,740 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:25" (1/1) ... [2025-03-08 14:02:25,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:02:25,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:02:25,769 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-08 14:02:25,775 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-08 14:02:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:02:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:02:25,790 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:02:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:02:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:02:25,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:02:25,867 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:02:25,870 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:02:26,125 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-08 14:02:26,125 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:02:26,134 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:02:26,135 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:02:26,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:02:26 BoogieIcfgContainer [2025-03-08 14:02:26,136 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:02:26,138 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:02:26,138 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:02:26,142 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:02:26,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:02:25" (1/3) ... [2025-03-08 14:02:26,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f41f14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:02:26, skipping insertion in model container [2025-03-08 14:02:26,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:25" (2/3) ... [2025-03-08 14:02:26,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f41f14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:02:26, skipping insertion in model container [2025-03-08 14:02:26,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:02:26" (3/3) ... [2025-03-08 14:02:26,144 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-77.i [2025-03-08 14:02:26,154 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:02:26,157 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-77.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:02:26,192 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:02:26,205 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;@27ec3ae3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:02:26,205 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:02:26,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 14:02:26,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 14:02:26,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:02:26,217 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:02:26,218 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:02:26,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:02:26,223 INFO L85 PathProgramCache]: Analyzing trace with hash 477050143, now seen corresponding path program 1 times [2025-03-08 14:02:26,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:02:26,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162016303] [2025-03-08 14:02:26,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:02:26,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:02:26,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 14:02:26,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 14:02:26,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:02:26,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:02:26,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-08 14:02:26,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:02:26,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162016303] [2025-03-08 14:02:26,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162016303] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:02:26,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062918986] [2025-03-08 14:02:26,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:02:26,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:02:26,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:02:26,508 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-08 14:02:26,509 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-08 14:02:26,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 14:02:26,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 14:02:26,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:02:26,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:02:26,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:02:26,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:02:26,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-08 14:02:26,733 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:02:26,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062918986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:02:26,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:02:26,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:02:26,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875336250] [2025-03-08 14:02:26,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:02:26,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:02:26,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:02:26,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:02:26,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:02:26,756 INFO L87 Difference]: Start difference. First operand has 83 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 14:02:26,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:02:26,781 INFO L93 Difference]: Finished difference Result 163 states and 278 transitions. [2025-03-08 14:02:26,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:02:26,783 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 168 [2025-03-08 14:02:26,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:02:26,787 INFO L225 Difference]: With dead ends: 163 [2025-03-08 14:02:26,787 INFO L226 Difference]: Without dead ends: 80 [2025-03-08 14:02:26,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 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-08 14:02:26,791 INFO L435 NwaCegarLoop]: 126 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, 126 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-08 14:02:26,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:02:26,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-08 14:02:26,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-08 14:02:26,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 53 states have internal predecessors, (73), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 14:02:26,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 123 transitions. [2025-03-08 14:02:26,820 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 123 transitions. Word has length 168 [2025-03-08 14:02:26,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:02:26,821 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 123 transitions. [2025-03-08 14:02:26,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 14:02:26,821 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 123 transitions. [2025-03-08 14:02:26,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 14:02:26,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:02:26,824 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:02:26,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 14:02:27,025 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-08 14:02:27,025 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:02:27,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:02:27,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1791799686, now seen corresponding path program 1 times [2025-03-08 14:02:27,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:02:27,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151110281] [2025-03-08 14:02:27,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:02:27,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:02:27,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 14:02:27,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 14:02:27,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:02:27,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:02:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 14:02:27,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:02:27,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151110281] [2025-03-08 14:02:27,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151110281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:02:27,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:02:27,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:02:27,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023385169] [2025-03-08 14:02:27,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:02:27,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 14:02:27,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:02:27,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 14:02:27,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:02:27,328 INFO L87 Difference]: Start difference. First operand 80 states and 123 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 14:02:27,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:02:27,508 INFO L93 Difference]: Finished difference Result 234 states and 363 transitions. [2025-03-08 14:02:27,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:02:27,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 168 [2025-03-08 14:02:27,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:02:27,511 INFO L225 Difference]: With dead ends: 234 [2025-03-08 14:02:27,511 INFO L226 Difference]: Without dead ends: 157 [2025-03-08 14:02:27,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:02:27,513 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 66 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:02:27,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 318 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:02:27,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-08 14:02:27,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2025-03-08 14:02:27,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 101 states have (on average 1.3762376237623761) internal successors, (139), 101 states have internal predecessors, (139), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 14:02:27,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 239 transitions. [2025-03-08 14:02:27,540 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 239 transitions. Word has length 168 [2025-03-08 14:02:27,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:02:27,540 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 239 transitions. [2025-03-08 14:02:27,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 14:02:27,541 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 239 transitions. [2025-03-08 14:02:27,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 14:02:27,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:02:27,542 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:02:27,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:02:27,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:02:27,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:02:27,543 INFO L85 PathProgramCache]: Analyzing trace with hash -255333731, now seen corresponding path program 1 times [2025-03-08 14:02:27,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:02:27,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422741742] [2025-03-08 14:02:27,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:02:27,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:02:27,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 14:02:27,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 14:02:27,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:02:27,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:02:28,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-08 14:02:28,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:02:28,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422741742] [2025-03-08 14:02:28,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422741742] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:02:28,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103893981] [2025-03-08 14:02:28,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:02:28,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:02:28,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:02:28,097 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-08 14:02:28,099 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-08 14:02:28,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 14:02:28,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 14:02:28,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:02:28,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:02:28,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 14:02:28,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:02:28,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 582 proven. 45 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2025-03-08 14:02:28,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:02:28,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-08 14:02:28,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103893981] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:02:28,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 14:02:28,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-08 14:02:28,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911063104] [2025-03-08 14:02:28,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 14:02:28,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 14:02:28,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:02:28,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 14:02:28,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 14:02:28,680 INFO L87 Difference]: Start difference. First operand 154 states and 239 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-08 14:02:28,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:02:28,900 INFO L93 Difference]: Finished difference Result 317 states and 485 transitions. [2025-03-08 14:02:28,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 14:02:28,901 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 169 [2025-03-08 14:02:28,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:02:28,904 INFO L225 Difference]: With dead ends: 317 [2025-03-08 14:02:28,905 INFO L226 Difference]: Without dead ends: 166 [2025-03-08 14:02:28,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 336 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-08 14:02:28,906 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 243 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:02:28,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 206 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 14:02:28,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-08 14:02:28,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2025-03-08 14:02:28,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 107 states have internal predecessors, (139), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 14:02:28,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 239 transitions. [2025-03-08 14:02:28,931 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 239 transitions. Word has length 169 [2025-03-08 14:02:28,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:02:28,932 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 239 transitions. [2025-03-08 14:02:28,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-08 14:02:28,932 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 239 transitions. [2025-03-08 14:02:28,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 14:02:28,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:02:28,934 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:02:28,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 14:02:29,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 14:02:29,134 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:02:29,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:02:29,135 INFO L85 PathProgramCache]: Analyzing trace with hash -742693306, now seen corresponding path program 1 times [2025-03-08 14:02:29,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:02:29,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53996652] [2025-03-08 14:02:29,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:02:29,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:02:29,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 14:02:29,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 14:02:29,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:02:29,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:02:29,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 14:02:29,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:02:29,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53996652] [2025-03-08 14:02:29,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53996652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:02:29,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:02:29,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 14:02:29,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959093545] [2025-03-08 14:02:29,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:02:29,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 14:02:29,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:02:29,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 14:02:29,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 14:02:29,848 INFO L87 Difference]: Start difference. First operand 162 states and 239 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 14:02:30,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:02:30,028 INFO L93 Difference]: Finished difference Result 469 states and 670 transitions. [2025-03-08 14:02:30,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 14:02:30,028 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2025-03-08 14:02:30,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:02:30,030 INFO L225 Difference]: With dead ends: 469 [2025-03-08 14:02:30,030 INFO L226 Difference]: Without dead ends: 310 [2025-03-08 14:02:30,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-08 14:02:30,031 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 92 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:02:30,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 524 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:02:30,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-08 14:02:30,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 246. [2025-03-08 14:02:30,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 173 states have (on average 1.2716763005780347) internal successors, (220), 175 states have internal predecessors, (220), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 14:02:30,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 352 transitions. [2025-03-08 14:02:30,067 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 352 transitions. Word has length 170 [2025-03-08 14:02:30,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:02:30,068 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 352 transitions. [2025-03-08 14:02:30,068 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 14:02:30,068 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 352 transitions. [2025-03-08 14:02:30,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 14:02:30,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:02:30,072 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:02:30,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 14:02:30,072 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:02:30,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:02:30,073 INFO L85 PathProgramCache]: Analyzing trace with hash 144810375, now seen corresponding path program 1 times [2025-03-08 14:02:30,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:02:30,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410819474] [2025-03-08 14:02:30,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:02:30,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:02:30,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 14:02:30,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 14:02:30,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:02:30,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:02:30,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [715683303] [2025-03-08 14:02:30,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:02:30,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:02:30,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:02:30,145 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:02:30,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 14:02:30,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 14:02:30,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 14:02:30,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:02:30,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:02:30,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 14:02:30,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:02:31,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 767 proven. 72 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-03-08 14:02:31,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:02:32,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:02:32,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410819474] [2025-03-08 14:02:32,499 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 14:02:32,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715683303] [2025-03-08 14:02:32,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715683303] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:02:32,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:02:32,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2025-03-08 14:02:32,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138736468] [2025-03-08 14:02:32,500 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 14:02:32,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 14:02:32,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:02:32,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 14:02:32,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2025-03-08 14:02:32,501 INFO L87 Difference]: Start difference. First operand 246 states and 352 transitions. Second operand has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-03-08 14:02:34,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:02:34,091 INFO L93 Difference]: Finished difference Result 912 states and 1279 transitions. [2025-03-08 14:02:34,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 14:02:34,092 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 170 [2025-03-08 14:02:34,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:02:34,098 INFO L225 Difference]: With dead ends: 912 [2025-03-08 14:02:34,100 INFO L226 Difference]: Without dead ends: 789 [2025-03-08 14:02:34,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=405, Invalid=1575, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 14:02:34,104 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 950 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:02:34,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 1137 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 14:02:34,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-03-08 14:02:34,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 409. [2025-03-08 14:02:34,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 279 states have (on average 1.2724014336917562) internal successors, (355), 282 states have internal predecessors, (355), 116 states have call successors, (116), 13 states have call predecessors, (116), 13 states have return successors, (116), 113 states have call predecessors, (116), 116 states have call successors, (116) [2025-03-08 14:02:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 587 transitions. [2025-03-08 14:02:34,162 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 587 transitions. Word has length 170 [2025-03-08 14:02:34,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:02:34,162 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 587 transitions. [2025-03-08 14:02:34,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-03-08 14:02:34,162 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 587 transitions. [2025-03-08 14:02:34,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 14:02:34,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:02:34,164 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:02:34,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 14:02:34,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:02:34,368 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:02:34,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:02:34,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1755322631, now seen corresponding path program 1 times [2025-03-08 14:02:34,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:02:34,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331395601] [2025-03-08 14:02:34,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:02:34,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:02:34,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 14:02:34,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 14:02:34,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:02:34,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:02:34,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [885011281] [2025-03-08 14:02:34,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:02:34,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:02:34,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:02:34,472 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:02:34,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 14:02:34,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 14:02:34,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 14:02:34,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:02:34,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:02:34,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 14:02:34,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:02:35,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 14:02:35,016 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:02:35,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:02:35,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331395601] [2025-03-08 14:02:35,016 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 14:02:35,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885011281] [2025-03-08 14:02:35,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885011281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:02:35,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:02:35,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 14:02:35,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117365435] [2025-03-08 14:02:35,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:02:35,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 14:02:35,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:02:35,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 14:02:35,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 14:02:35,018 INFO L87 Difference]: Start difference. First operand 409 states and 587 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 14:02:35,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:02:35,551 INFO L93 Difference]: Finished difference Result 987 states and 1421 transitions. [2025-03-08 14:02:35,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 14:02:35,551 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2025-03-08 14:02:35,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:02:35,559 INFO L225 Difference]: With dead ends: 987 [2025-03-08 14:02:35,560 INFO L226 Difference]: Without dead ends: 864 [2025-03-08 14:02:35,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 14:02:35,561 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 340 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 14:02:35,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 737 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 14:02:35,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-03-08 14:02:35,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 607. [2025-03-08 14:02:35,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 413 states have (on average 1.2663438256658595) internal successors, (523), 418 states have internal predecessors, (523), 174 states have call successors, (174), 19 states have call predecessors, (174), 19 states have return successors, (174), 169 states have call predecessors, (174), 174 states have call successors, (174) [2025-03-08 14:02:35,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 871 transitions. [2025-03-08 14:02:35,638 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 871 transitions. Word has length 170 [2025-03-08 14:02:35,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:02:35,639 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 871 transitions. [2025-03-08 14:02:35,639 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 14:02:35,639 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 871 transitions. [2025-03-08 14:02:35,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 14:02:35,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:02:35,640 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:02:35,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 14:02:35,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:02:35,843 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:02:35,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:02:35,843 INFO L85 PathProgramCache]: Analyzing trace with hash 698465028, now seen corresponding path program 1 times [2025-03-08 14:02:35,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:02:35,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772545648] [2025-03-08 14:02:35,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:02:35,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:02:35,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 14:02:35,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 14:02:35,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:02:35,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:02:35,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1236625455] [2025-03-08 14:02:35,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:02:35,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:02:35,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:02:35,909 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:02:35,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 14:02:35,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 14:02:36,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 14:02:36,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:02:36,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:02:36,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 14:02:36,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:02:37,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 582 proven. 45 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2025-03-08 14:02:37,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:02:44,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:02:44,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772545648] [2025-03-08 14:02:44,302 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 14:02:44,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236625455] [2025-03-08 14:02:44,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236625455] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:02:44,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:02:44,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-03-08 14:02:44,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607657402] [2025-03-08 14:02:44,302 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 14:02:44,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 14:02:44,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:02:44,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 14:02:44,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=257, Unknown=3, NotChecked=0, Total=306 [2025-03-08 14:02:44,303 INFO L87 Difference]: Start difference. First operand 607 states and 871 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 14:02:45,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:02:45,300 INFO L93 Difference]: Finished difference Result 1154 states and 1649 transitions. [2025-03-08 14:02:45,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 14:02:45,303 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 170 [2025-03-08 14:02:45,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:02:45,308 INFO L225 Difference]: With dead ends: 1154 [2025-03-08 14:02:45,309 INFO L226 Difference]: Without dead ends: 781 [2025-03-08 14:02:45,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=181, Invalid=808, Unknown=3, NotChecked=0, Total=992 [2025-03-08 14:02:45,310 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 319 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 14:02:45,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1056 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 14:02:45,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2025-03-08 14:02:45,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 682. [2025-03-08 14:02:45,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 460 states have (on average 1.2521739130434784) internal successors, (576), 466 states have internal predecessors, (576), 199 states have call successors, (199), 22 states have call predecessors, (199), 22 states have return successors, (199), 193 states have call predecessors, (199), 199 states have call successors, (199) [2025-03-08 14:02:45,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 974 transitions. [2025-03-08 14:02:45,384 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 974 transitions. Word has length 170 [2025-03-08 14:02:45,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:02:45,385 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 974 transitions. [2025-03-08 14:02:45,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 14:02:45,385 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 974 transitions. [2025-03-08 14:02:45,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 14:02:45,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:02:45,386 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:02:45,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 14:02:45,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:02:45,587 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:02:45,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:02:45,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1985990012, now seen corresponding path program 1 times [2025-03-08 14:02:45,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:02:45,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143241351] [2025-03-08 14:02:45,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:02:45,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:02:45,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 14:02:45,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 14:02:45,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:02:45,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:02:45,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [64367627] [2025-03-08 14:02:45,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:02:45,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:02:45,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:02:45,652 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:02:45,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 14:02:45,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 14:02:45,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 14:02:45,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:02:45,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:02:45,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 14:02:45,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:02:45,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 14:02:45,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:02:45,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:02:45,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143241351] [2025-03-08 14:02:45,973 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 14:02:45,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64367627] [2025-03-08 14:02:45,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64367627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:02:45,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:02:45,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:02:45,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222094194] [2025-03-08 14:02:45,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:02:45,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 14:02:45,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:02:45,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 14:02:45,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:02:45,974 INFO L87 Difference]: Start difference. First operand 682 states and 974 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 14:02:46,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:02:46,149 INFO L93 Difference]: Finished difference Result 1069 states and 1537 transitions. [2025-03-08 14:02:46,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 14:02:46,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2025-03-08 14:02:46,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:02:46,157 INFO L225 Difference]: With dead ends: 1069 [2025-03-08 14:02:46,158 INFO L226 Difference]: Without dead ends: 696 [2025-03-08 14:02:46,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 14:02:46,160 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 105 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:02:46,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 574 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:02:46,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-03-08 14:02:46,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 682. [2025-03-08 14:02:46,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 460 states have (on average 1.2478260869565216) internal successors, (574), 466 states have internal predecessors, (574), 199 states have call successors, (199), 22 states have call predecessors, (199), 22 states have return successors, (199), 193 states have call predecessors, (199), 199 states have call successors, (199) [2025-03-08 14:02:46,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 972 transitions. [2025-03-08 14:02:46,222 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 972 transitions. Word has length 170 [2025-03-08 14:02:46,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:02:46,222 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 972 transitions. [2025-03-08 14:02:46,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 14:02:46,222 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 972 transitions. [2025-03-08 14:02:46,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 14:02:46,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:02:46,226 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:02:46,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 14:02:46,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:02:46,427 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:02:46,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:02:46,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1470544088, now seen corresponding path program 1 times [2025-03-08 14:02:46,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:02:46,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274371010] [2025-03-08 14:02:46,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:02:46,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:02:46,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 14:02:46,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 14:02:46,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:02:46,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:02:46,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 14:02:46,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:02:46,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274371010] [2025-03-08 14:02:46,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274371010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:02:46,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:02:46,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 14:02:46,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493029765] [2025-03-08 14:02:46,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:02:46,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 14:02:46,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:02:46,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 14:02:46,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:02:46,512 INFO L87 Difference]: Start difference. First operand 682 states and 972 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 14:02:46,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:02:46,752 INFO L93 Difference]: Finished difference Result 1912 states and 2698 transitions. [2025-03-08 14:02:46,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 14:02:46,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2025-03-08 14:02:46,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:02:46,761 INFO L225 Difference]: With dead ends: 1912 [2025-03-08 14:02:46,761 INFO L226 Difference]: Without dead ends: 1442 [2025-03-08 14:02:46,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 14:02:46,765 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 207 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:02:46,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 428 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:02:46,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2025-03-08 14:02:46,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1244. [2025-03-08 14:02:46,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 830 states have (on average 1.2289156626506024) internal successors, (1020), 842 states have internal predecessors, (1020), 373 states have call successors, (373), 40 states have call predecessors, (373), 40 states have return successors, (373), 361 states have call predecessors, (373), 373 states have call successors, (373) [2025-03-08 14:02:46,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1766 transitions. [2025-03-08 14:02:46,894 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1766 transitions. Word has length 170 [2025-03-08 14:02:46,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:02:46,894 INFO L471 AbstractCegarLoop]: Abstraction has 1244 states and 1766 transitions. [2025-03-08 14:02:46,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 14:02:46,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1766 transitions. [2025-03-08 14:02:46,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 14:02:46,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:02:46,898 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:02:46,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 14:02:46,899 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:02:46,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:02:46,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1259193175, now seen corresponding path program 1 times [2025-03-08 14:02:46,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:02:46,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355491556] [2025-03-08 14:02:46,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:02:46,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:02:46,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 14:02:46,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 14:02:46,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:02:46,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:02:47,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 14:02:47,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:02:47,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355491556] [2025-03-08 14:02:47,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355491556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:02:47,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:02:47,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 14:02:47,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671565172] [2025-03-08 14:02:47,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:02:47,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 14:02:47,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:02:47,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 14:02:47,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 14:02:47,362 INFO L87 Difference]: Start difference. First operand 1244 states and 1766 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 14:02:48,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:02:48,399 INFO L93 Difference]: Finished difference Result 2451 states and 3415 transitions. [2025-03-08 14:02:48,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 14:02:48,401 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 170 [2025-03-08 14:02:48,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:02:48,409 INFO L225 Difference]: With dead ends: 2451 [2025-03-08 14:02:48,409 INFO L226 Difference]: Without dead ends: 1948 [2025-03-08 14:02:48,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2025-03-08 14:02:48,412 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 583 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 14:02:48,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 936 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 14:02:48,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2025-03-08 14:02:48,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1596. [2025-03-08 14:02:48,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1059 states have (on average 1.2058545797922569) internal successors, (1277), 1077 states have internal predecessors, (1277), 475 states have call successors, (475), 61 states have call predecessors, (475), 61 states have return successors, (475), 457 states have call predecessors, (475), 475 states have call successors, (475) [2025-03-08 14:02:48,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 2227 transitions. [2025-03-08 14:02:48,552 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 2227 transitions. Word has length 170 [2025-03-08 14:02:48,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:02:48,553 INFO L471 AbstractCegarLoop]: Abstraction has 1596 states and 2227 transitions. [2025-03-08 14:02:48,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 14:02:48,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2227 transitions. [2025-03-08 14:02:48,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 14:02:48,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:02:48,555 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:02:48,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 14:02:48,555 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:02:48,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:02:48,556 INFO L85 PathProgramCache]: Analyzing trace with hash 351319081, now seen corresponding path program 1 times [2025-03-08 14:02:48,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:02:48,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229036005] [2025-03-08 14:02:48,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:02:48,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:02:48,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 14:02:48,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 14:02:48,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:02:48,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:02:48,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [379769420] [2025-03-08 14:02:48,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:02:48,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:02:48,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:02:48,595 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:02:48,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 14:02:48,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 14:02:48,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 14:02:48,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:02:48,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:02:48,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 14:02:48,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:02:49,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 318 proven. 9 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2025-03-08 14:02:49,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:02:49,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:02:49,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229036005] [2025-03-08 14:02:49,238 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 14:02:49,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379769420] [2025-03-08 14:02:49,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379769420] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:02:49,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:02:49,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-08 14:02:49,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43137296] [2025-03-08 14:02:49,238 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 14:02:49,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 14:02:49,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:02:49,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 14:02:49,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-08 14:02:49,239 INFO L87 Difference]: Start difference. First operand 1596 states and 2227 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, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 14:02:49,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:02:49,845 INFO L93 Difference]: Finished difference Result 3286 states and 4554 transitions. [2025-03-08 14:02:49,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 14:02:49,848 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 170 [2025-03-08 14:02:49,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:02:49,857 INFO L225 Difference]: With dead ends: 3286 [2025-03-08 14:02:49,858 INFO L226 Difference]: Without dead ends: 2146 [2025-03-08 14:02:49,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2025-03-08 14:02:49,862 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 307 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 14:02:49,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 817 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 14:02:49,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2025-03-08 14:02:50,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 1941. [2025-03-08 14:02:50,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1941 states, 1307 states have (on average 1.1996939556235655) internal successors, (1568), 1333 states have internal predecessors, (1568), 559 states have call successors, (559), 74 states have call predecessors, (559), 74 states have return successors, (559), 533 states have call predecessors, (559), 559 states have call successors, (559) [2025-03-08 14:02:50,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2686 transitions. [2025-03-08 14:02:50,042 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2686 transitions. Word has length 170 [2025-03-08 14:02:50,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:02:50,042 INFO L471 AbstractCegarLoop]: Abstraction has 1941 states and 2686 transitions. [2025-03-08 14:02:50,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 14:02:50,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2686 transitions. [2025-03-08 14:02:50,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 14:02:50,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:02:50,046 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:02:50,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 14:02:50,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:02:50,246 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:02:50,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:02:50,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1704628778, now seen corresponding path program 1 times [2025-03-08 14:02:50,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:02:50,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470276997] [2025-03-08 14:02:50,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:02:50,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:02:50,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 14:02:50,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 14:02:50,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:02:50,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:02:50,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [678195683] [2025-03-08 14:02:50,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:02:50,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:02:50,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:02:50,305 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:02:50,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 14:02:50,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 14:02:50,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 14:02:50,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:02:50,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:02:50,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 14:02:50,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:02:50,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 14:02:50,947 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:02:50,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:02:50,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470276997] [2025-03-08 14:02:50,947 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 14:02:50,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678195683] [2025-03-08 14:02:50,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678195683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:02:50,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:02:50,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 14:02:50,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133919358] [2025-03-08 14:02:50,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:02:50,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 14:02:50,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:02:50,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 14:02:50,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 14:02:50,948 INFO L87 Difference]: Start difference. First operand 1941 states and 2686 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 14:02:51,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:02:51,452 INFO L93 Difference]: Finished difference Result 3210 states and 4471 transitions. [2025-03-08 14:02:51,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 14:02:51,453 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2025-03-08 14:02:51,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:02:51,463 INFO L225 Difference]: With dead ends: 3210 [2025-03-08 14:02:51,463 INFO L226 Difference]: Without dead ends: 2408 [2025-03-08 14:02:51,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-03-08 14:02:51,466 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 389 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 14:02:51,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1030 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 14:02:51,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2025-03-08 14:02:51,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 2183. [2025-03-08 14:02:51,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2183 states, 1477 states have (on average 1.2044685172647258) internal successors, (1779), 1505 states have internal predecessors, (1779), 625 states have call successors, (625), 80 states have call predecessors, (625), 80 states have return successors, (625), 597 states have call predecessors, (625), 625 states have call successors, (625) [2025-03-08 14:02:51,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 3029 transitions. [2025-03-08 14:02:51,731 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 3029 transitions. Word has length 170 [2025-03-08 14:02:51,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:02:51,732 INFO L471 AbstractCegarLoop]: Abstraction has 2183 states and 3029 transitions. [2025-03-08 14:02:51,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 14:02:51,733 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 3029 transitions. [2025-03-08 14:02:51,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-08 14:02:51,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:02:51,736 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:02:51,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 14:02:51,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 14:02:51,936 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:02:51,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:02:51,937 INFO L85 PathProgramCache]: Analyzing trace with hash 2108785115, now seen corresponding path program 1 times [2025-03-08 14:02:51,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:02:51,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047858348] [2025-03-08 14:02:51,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:02:51,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:02:51,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 14:02:51,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 14:02:51,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:02:51,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:02:51,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1995369322] [2025-03-08 14:02:51,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:02:51,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:02:51,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:02:51,994 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:02:51,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 14:02:52,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 14:02:52,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 14:02:52,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:02:52,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:02:52,170 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:02:52,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 14:02:52,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 14:02:52,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:02:52,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:02:52,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:02:52,298 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:02:52,298 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:02:52,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 14:02:52,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 14:02:52,503 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:02:52,592 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:02:52,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:02:52 BoogieIcfgContainer [2025-03-08 14:02:52,595 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:02:52,596 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:02:52,596 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:02:52,596 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:02:52,597 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:02:26" (3/4) ... [2025-03-08 14:02:52,598 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:02:52,599 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:02:52,600 INFO L158 Benchmark]: Toolchain (without parser) took 27185.16ms. Allocated memory was 167.8MB in the beginning and 637.5MB in the end (delta: 469.8MB). Free memory was 122.8MB in the beginning and 419.7MB in the end (delta: -296.9MB). Peak memory consumption was 176.8MB. Max. memory is 16.1GB. [2025-03-08 14:02:52,600 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:02:52,601 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.10ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 107.1MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:02:52,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.40ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 104.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:02:52,601 INFO L158 Benchmark]: Boogie Preprocessor took 47.60ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 100.7MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:02:52,601 INFO L158 Benchmark]: IcfgBuilder took 398.76ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 77.2MB in the end (delta: 23.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:02:52,602 INFO L158 Benchmark]: TraceAbstraction took 26456.93ms. Allocated memory was 167.8MB in the beginning and 637.5MB in the end (delta: 469.8MB). Free memory was 77.2MB in the beginning and 419.7MB in the end (delta: -342.5MB). Peak memory consumption was 134.9MB. Max. memory is 16.1GB. [2025-03-08 14:02:52,602 INFO L158 Benchmark]: Witness Printer took 3.16ms. Allocated memory is still 637.5MB. Free memory is still 419.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:02:52,603 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.43ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.10ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 107.1MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.40ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 104.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.60ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 100.7MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 398.76ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 77.2MB in the end (delta: 23.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 26456.93ms. Allocated memory was 167.8MB in the beginning and 637.5MB in the end (delta: 469.8MB). Free memory was 77.2MB in the beginning and 419.7MB in the end (delta: -342.5MB). Peak memory consumption was 134.9MB. Max. memory is 16.1GB. * Witness Printer took 3.16ms. Allocated memory is still 637.5MB. Free memory is still 419.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 160, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 158, overapproximation of someBinaryFLOATComparisonOperation at line 148, overapproximation of someBinaryFLOATComparisonOperation at line 146, overapproximation of someBinaryFLOATComparisonOperation at line 199, overapproximation of someBinaryFLOATComparisonOperation at line 154, overapproximation of someBinaryFLOATComparisonOperation at line 150, overapproximation of someBinaryFLOATComparisonOperation at line 156, overapproximation of someBinaryFLOATComparisonOperation at line 62, overapproximation of someBinaryFLOATComparisonOperation at line 152, overapproximation of someBinaryArithmeticFLOAToperation at line 114. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -8; [L23] float var_1_2 = 1.5; [L24] float var_1_3 = 24.7; [L25] float var_1_8 = 0.875; [L26] float var_1_9 = 31.875; [L27] float var_1_10 = 255.25; [L28] float var_1_11 = 0.0; [L29] float var_1_12 = 7.58; [L30] float var_1_13 = 8.6; [L31] float var_1_14 = 49.75; [L32] signed short int var_1_16 = -64; [L33] signed long int var_1_18 = 4; [L34] signed long int var_1_19 = 100; [L35] unsigned char var_1_21 = 0; [L36] unsigned char var_1_23 = 0; [L37] signed char var_1_24 = 16; [L38] signed short int var_1_26 = -1; [L39] signed char var_1_27 = -32; [L40] unsigned char var_1_28 = 1; [L41] signed long int var_1_29 = -4; [L42] signed short int var_1_31 = 1000; [L43] signed long int var_1_32 = 4; [L44] signed short int var_1_33 = 8; [L45] signed short int var_1_34 = 25; [L46] signed short int var_1_35 = 100; [L47] signed short int var_1_36 = 10000; [L48] float var_1_38 = 2.125; [L49] signed long int var_1_39 = -1000000; [L50] signed long int last_1_var_1_1 = -8; [L51] float last_1_var_1_8 = 0.875; [L52] signed short int last_1_var_1_16 = -64; [L53] signed long int last_1_var_1_18 = 4; [L54] signed long int last_1_var_1_19 = 100; [L55] signed char last_1_var_1_24 = 16; [L56] signed long int last_1_var_1_29 = -4; [L57] signed short int last_1_var_1_31 = 1000; [L58] signed long int last_1_var_1_39 = -1000000; VAL [isInitial=0, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_2=3/2, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_3=247/10, var_1_8=7/8, var_1_9=255/8] [L203] isInitial = 1 [L204] FCALL initially() [L205] int k_loop; [L206] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_2=3/2, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_3=247/10, var_1_8=7/8, var_1_9=255/8] [L206] COND TRUE k_loop < 1 [L207] CALL updateLastVariables() [L188] last_1_var_1_1 = var_1_1 [L189] last_1_var_1_8 = var_1_8 [L190] last_1_var_1_16 = var_1_16 [L191] last_1_var_1_18 = var_1_18 [L192] last_1_var_1_19 = var_1_19 [L193] last_1_var_1_24 = var_1_24 [L194] last_1_var_1_29 = var_1_29 [L195] last_1_var_1_31 = var_1_31 [L196] last_1_var_1_39 = var_1_39 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_2=3/2, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_3=247/10, var_1_8=7/8, var_1_9=255/8] [L207] RET updateLastVariables() [L208] CALL updateVariables() [L145] var_1_2 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_3=247/10, var_1_8=7/8, var_1_9=255/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_3=247/10, var_1_8=7/8, var_1_9=255/8] [L146] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_3=247/10, var_1_8=7/8, var_1_9=255/8] [L147] var_1_3 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8, var_1_9=255/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8, var_1_9=255/8] [L148] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8, var_1_9=255/8] [L149] var_1_9 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L150] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L151] var_1_10 = __VERIFIER_nondet_float() [L152] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L152] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L153] var_1_11 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_11 >= 6917529.027641073700e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L154] RET assume_abort_if_not((var_1_11 >= 6917529.027641073700e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L155] var_1_12 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 2305843.009213691390e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L156] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 2305843.009213691390e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L157] var_1_13 = __VERIFIER_nondet_float() [L158] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L158] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L159] var_1_14 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L160] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L161] var_1_23 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L162] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L163] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L163] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L164] var_1_26 = __VERIFIER_nondet_short() [L165] CALL assume_abort_if_not(var_1_26 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L165] RET assume_abort_if_not(var_1_26 >= -32768) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L166] CALL assume_abort_if_not(var_1_26 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L166] RET assume_abort_if_not(var_1_26 <= 32767) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L167] CALL assume_abort_if_not(var_1_26 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L167] RET assume_abort_if_not(var_1_26 != 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L168] var_1_27 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_27 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L169] RET assume_abort_if_not(var_1_27 >= -127) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L170] CALL assume_abort_if_not(var_1_27 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L170] RET assume_abort_if_not(var_1_27 <= 126) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L171] var_1_32 = __VERIFIER_nondet_long() [L172] CALL assume_abort_if_not(var_1_32 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L172] RET assume_abort_if_not(var_1_32 >= -1) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L173] CALL assume_abort_if_not(var_1_32 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L173] RET assume_abort_if_not(var_1_32 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L174] var_1_33 = __VERIFIER_nondet_short() [L175] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L175] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L176] CALL assume_abort_if_not(var_1_33 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L176] RET assume_abort_if_not(var_1_33 <= 16383) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L177] var_1_34 = __VERIFIER_nondet_short() [L178] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L178] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L179] CALL assume_abort_if_not(var_1_34 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L179] RET assume_abort_if_not(var_1_34 <= 16383) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L180] var_1_35 = __VERIFIER_nondet_short() [L181] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L181] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L182] CALL assume_abort_if_not(var_1_35 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L182] RET assume_abort_if_not(var_1_35 <= 32766) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L183] var_1_36 = __VERIFIER_nondet_short() [L184] CALL assume_abort_if_not(var_1_36 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L184] RET assume_abort_if_not(var_1_36 >= 8191) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L185] CALL assume_abort_if_not(var_1_36 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L185] RET assume_abort_if_not(var_1_36 <= 16383) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L208] RET updateVariables() [L209] CALL step() [L62] COND TRUE (var_1_2 - var_1_3) >= last_1_var_1_8 [L63] var_1_1 = ((last_1_var_1_24 + last_1_var_1_31) + last_1_var_1_16) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L67] signed long int stepLocal_6 = -5; [L68] signed long int stepLocal_5 = last_1_var_1_1; [L69] signed long int stepLocal_4 = (var_1_32 - 4) * last_1_var_1_24; VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_4=-64, stepLocal_5=-8, stepLocal_6=-5, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L70] COND TRUE stepLocal_5 <= (last_1_var_1_18 * var_1_27) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_4=-64, stepLocal_6=-5, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L71] COND TRUE ((((last_1_var_1_18) < (last_1_var_1_16)) ? (last_1_var_1_18) : (last_1_var_1_16))) == stepLocal_4 [L72] var_1_31 = ((var_1_33 + var_1_34) - var_1_35) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L83] COND TRUE ((var_1_13 * var_1_12) * var_1_3) != (var_1_14 + last_1_var_1_8) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L84] COND TRUE last_1_var_1_29 >= (last_1_var_1_19 / var_1_26) [L85] var_1_24 = var_1_27 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L90] COND FALSE !((((((var_1_2 * var_1_10)) > (var_1_11)) ? ((var_1_2 * var_1_10)) : (var_1_11))) > var_1_9) [L97] var_1_16 = var_1_24 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=5, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L99] COND TRUE var_1_35 <= var_1_27 [L100] var_1_38 = var_1_9 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=5, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=-1000000, var_1_8=7/8, var_1_9=2] [L104] COND TRUE var_1_16 <= ((var_1_31 / -128) + var_1_1) [L105] var_1_21 = var_1_23 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=5, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=-1000000, var_1_8=7/8, var_1_9=2] [L107] signed long int stepLocal_0 = 64; VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_0=64, stepLocal_6=-5, var_1_16=5, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=-1000000, var_1_8=7/8, var_1_9=2] [L108] COND FALSE !(stepLocal_0 <= var_1_24) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=5, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=-1000000, var_1_8=7/8, var_1_9=2] [L111] COND FALSE !(\read(var_1_21)) [L114] var_1_8 = (var_1_12 - 2.125f) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=5, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=-1000000, var_1_9=2] [L117] COND TRUE var_1_9 > var_1_13 [L118] var_1_18 = (var_1_24 + var_1_31) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=5, var_1_18=3, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=-1000000, var_1_9=2] [L120] unsigned char stepLocal_2 = (var_1_31 + var_1_24) >= var_1_1; VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_2=0, stepLocal_6=-5, var_1_16=5, var_1_18=3, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=-1000000, var_1_9=2] [L121] COND FALSE !(stepLocal_2 || var_1_23) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=5, var_1_18=3, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=-1000000, var_1_9=2] [L124] COND TRUE ! var_1_21 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=5, var_1_18=3, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=-1000000, var_1_9=2] [L125] COND TRUE (last_1_var_1_39 <= var_1_31) || var_1_28 [L126] var_1_39 = var_1_36 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=5, var_1_18=3, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=8192, var_1_9=2] [L129] unsigned char stepLocal_1 = var_1_21; VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_1=0, stepLocal_6=-5, var_1_16=5, var_1_18=3, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=8192, var_1_9=2] [L130] COND TRUE var_1_28 || stepLocal_1 [L131] var_1_19 = (((((var_1_31 + var_1_24)) > ((-8 + var_1_18))) ? ((var_1_31 + var_1_24)) : ((-8 + var_1_18)))) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=5, var_1_18=3, var_1_19=3, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=8192, var_1_9=2] [L133] signed long int stepLocal_3 = var_1_24 * (var_1_31 * var_1_16); VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_3=-50, stepLocal_6=-5, var_1_16=5, var_1_18=3, var_1_19=3, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=8192, var_1_9=2] [L134] COND TRUE -50 == stepLocal_3 [L135] var_1_29 = ((((-500) < (var_1_18)) ? (-500) : (var_1_18))) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=5, var_1_18=3, var_1_19=3, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-500, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=8192, var_1_9=2] [L209] RET step() [L210] CALL, EXPR property() [L199-L200] return (((((((((((((var_1_2 - var_1_3) >= last_1_var_1_8) ? (var_1_1 == ((signed long int) ((last_1_var_1_24 + last_1_var_1_31) + last_1_var_1_16))) : (var_1_1 == ((signed long int) last_1_var_1_16))) && ((64 <= var_1_24) ? (var_1_8 == ((float) (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) - (var_1_12 + (var_1_13 + var_1_14))))) : (var_1_21 ? (var_1_8 == ((float) (((((((var_1_13) > (var_1_11)) ? (var_1_13) : (var_1_11))) < 0 ) ? -((((var_1_13) > (var_1_11)) ? (var_1_13) : (var_1_11))) : ((((var_1_13) > (var_1_11)) ? (var_1_13) : (var_1_11))))))) : (var_1_8 == ((float) (var_1_12 - 2.125f)))))) && (((((((var_1_2 * var_1_10)) > (var_1_11)) ? ((var_1_2 * var_1_10)) : (var_1_11))) > var_1_9) ? ((var_1_13 != var_1_2) ? (var_1_16 == ((signed short int) var_1_24)) : (var_1_16 == ((signed short int) var_1_24))) : (var_1_16 == ((signed short int) var_1_24)))) && ((var_1_9 > var_1_13) ? (var_1_18 == ((signed long int) (var_1_24 + var_1_31))) : 1)) && ((var_1_28 || var_1_21) ? (var_1_19 == ((signed long int) (((((var_1_31 + var_1_24)) > ((-8 + var_1_18))) ? ((var_1_31 + var_1_24)) : ((-8 + var_1_18)))))) : 1)) && ((var_1_16 <= ((var_1_31 / -128) + var_1_1)) ? (var_1_21 == ((unsigned char) var_1_23)) : 1)) && ((((var_1_13 * var_1_12) * var_1_3) != (var_1_14 + last_1_var_1_8)) ? ((last_1_var_1_29 >= (last_1_var_1_19 / var_1_26)) ? (var_1_24 == ((signed char) var_1_27)) : (var_1_24 == ((signed char) var_1_27))) : 1)) && ((((var_1_31 + var_1_24) >= var_1_1) || var_1_23) ? (var_1_28 == ((unsigned char) (var_1_21 && var_1_23))) : 1)) && ((-50 == (var_1_24 * (var_1_31 * var_1_16))) ? (var_1_29 == ((signed long int) ((((-500) < (var_1_18)) ? (-500) : (var_1_18))))) : (var_1_23 ? (var_1_29 == ((signed long int) var_1_1)) : (var_1_29 == ((signed long int) var_1_1))))) && ((last_1_var_1_1 <= (last_1_var_1_18 * var_1_27)) ? ((((((last_1_var_1_18) < (last_1_var_1_16)) ? (last_1_var_1_18) : (last_1_var_1_16))) == ((var_1_32 - 4) * last_1_var_1_24)) ? (var_1_31 == ((signed short int) ((var_1_33 + var_1_34) - var_1_35))) : (var_1_31 == ((signed short int) (((var_1_36 - 1) - var_1_33) + var_1_34)))) : ((-5 <= last_1_var_1_39) ? (var_1_31 == ((signed short int) var_1_27)) : (var_1_31 == ((signed short int) last_1_var_1_24))))) && ((var_1_35 <= var_1_27) ? (var_1_38 == ((float) var_1_9)) : (var_1_38 == ((float) (((((((var_1_13 - var_1_9) < 0 ) ? -(var_1_13 - var_1_9) : (var_1_13 - var_1_9))) < 0 ) ? -((((var_1_13 - var_1_9) < 0 ) ? -(var_1_13 - var_1_9) : (var_1_13 - var_1_9))) : ((((var_1_13 - var_1_9) < 0 ) ? -(var_1_13 - var_1_9) : (var_1_13 - var_1_9))))))))) && ((! var_1_21) ? (((last_1_var_1_39 <= var_1_31) || var_1_28) ? (var_1_39 == ((signed long int) var_1_36)) : 1) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=5, var_1_18=3, var_1_19=3, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-500, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=8192, var_1_9=2] [L210] RET, EXPR property() [L210] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=5, var_1_18=3, var_1_19=3, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-500, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=8192, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=5, var_1_18=3, var_1_19=3, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-500, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=8192, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 83 locations, 153 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.3s, OverallIterations: 13, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3626 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3601 mSDsluCounter, 7889 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5871 mSDsCounter, 988 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5015 IncrementalHoareTripleChecker+Invalid, 6003 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 988 mSolverCounterUnsat, 2018 mSDtfsCounter, 5015 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1721 GetRequests, 1550 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2183occurred in iteration=12, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 1801 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 3734 NumberOfCodeBlocks, 3734 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2526 ConstructedInterpolants, 3 QuantifiedInterpolants, 13291 SizeOfPredicates, 53 NumberOfNonLiveVariables, 3479 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 17691/18000 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-08 14:02:52,640 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-77.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 0cbe4eb7aae73c01b831078f0e738c68709fa97155cdb7dce934011117170926 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:02:54,413 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:02:54,491 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:02:54,495 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:02:54,496 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:02:54,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:02:54,518 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:02:54,518 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:02:54,520 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:02:54,520 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:02:54,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:02:54,521 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:02:54,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:02:54,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:02:54,521 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:02:54,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:02:54,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:02:54,522 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:02:54,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:02:54,522 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:02:54,522 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:02:54,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:02:54,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:02:54,522 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:02:54,522 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:02:54,522 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:02:54,522 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:02:54,522 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:02:54,522 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:02:54,522 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:02:54,523 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:02:54,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:02:54,523 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:02:54,523 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:02:54,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:02:54,523 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:02:54,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:02:54,523 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:02:54,523 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:02:54,523 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:02:54,523 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:02:54,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:02:54,523 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:02:54,524 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:02:54,524 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:02:54,524 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 -> 0cbe4eb7aae73c01b831078f0e738c68709fa97155cdb7dce934011117170926 [2025-03-08 14:02:54,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:02:54,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:02:54,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:02:54,751 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:02:54,751 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:02:54,753 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-77.i [2025-03-08 14:02:55,923 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48228087a/a63a5530df5e45af8cf4827ad758ece2/FLAGcb228c98d [2025-03-08 14:02:56,158 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:02:56,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-77.i [2025-03-08 14:02:56,169 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48228087a/a63a5530df5e45af8cf4827ad758ece2/FLAGcb228c98d [2025-03-08 14:02:56,501 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48228087a/a63a5530df5e45af8cf4827ad758ece2 [2025-03-08 14:02:56,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:02:56,505 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:02:56,507 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:02:56,507 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:02:56,510 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:02:56,511 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:02:56" (1/1) ... [2025-03-08 14:02:56,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40cf36b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:56, skipping insertion in model container [2025-03-08 14:02:56,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:02:56" (1/1) ... [2025-03-08 14:02:56,532 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:02:56,638 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-77.i[916,929] [2025-03-08 14:02:56,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:02:56,704 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:02:56,712 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-77.i[916,929] [2025-03-08 14:02:56,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:02:56,763 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:02:56,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:56 WrapperNode [2025-03-08 14:02:56,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:02:56,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:02:56,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:02:56,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:02:56,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:56" (1/1) ... [2025-03-08 14:02:56,785 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:56" (1/1) ... [2025-03-08 14:02:56,814 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2025-03-08 14:02:56,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:02:56,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:02:56,816 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:02:56,816 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:02:56,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:56" (1/1) ... [2025-03-08 14:02:56,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:56" (1/1) ... [2025-03-08 14:02:56,825 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:56" (1/1) ... [2025-03-08 14:02:56,835 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-08 14:02:56,835 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:56" (1/1) ... [2025-03-08 14:02:56,835 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:56" (1/1) ... [2025-03-08 14:02:56,845 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:56" (1/1) ... [2025-03-08 14:02:56,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:56" (1/1) ... [2025-03-08 14:02:56,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:56" (1/1) ... [2025-03-08 14:02:56,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:56" (1/1) ... [2025-03-08 14:02:56,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:02:56,852 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:02:56,852 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:02:56,852 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:02:56,857 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:56" (1/1) ... [2025-03-08 14:02:56,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:02:56,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:02:56,888 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-08 14:02:56,893 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-08 14:02:56,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:02:56,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:02:56,909 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:02:56,909 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:02:56,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:02:56,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:02:56,992 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:02:56,994 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:03:09,915 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-08 14:03:09,915 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:03:09,923 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:03:09,923 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:03:09,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:03:09 BoogieIcfgContainer [2025-03-08 14:03:09,924 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:03:09,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:03:09,925 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:03:09,928 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:03:09,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:02:56" (1/3) ... [2025-03-08 14:03:09,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271f768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:03:09, skipping insertion in model container [2025-03-08 14:03:09,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:56" (2/3) ... [2025-03-08 14:03:09,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271f768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:03:09, skipping insertion in model container [2025-03-08 14:03:09,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:03:09" (3/3) ... [2025-03-08 14:03:09,930 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-77.i [2025-03-08 14:03:09,940 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:03:09,942 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-77.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:03:09,977 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:03:09,987 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;@2196b9b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:03:09,987 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:03:09,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 14:03:09,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 14:03:09,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:03:09,999 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:03:09,999 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:03:10,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:03:10,003 INFO L85 PathProgramCache]: Analyzing trace with hash 477050143, now seen corresponding path program 1 times [2025-03-08 14:03:10,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:03:10,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012442449] [2025-03-08 14:03:10,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:03:10,012 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-08 14:03:10,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:03:10,014 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-08 14:03:10,016 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-08 14:03:10,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 14:03:10,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 14:03:10,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:03:10,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:03:10,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:03:10,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:03:10,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2025-03-08 14:03:10,590 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:03:10,591 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:03:10,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012442449] [2025-03-08 14:03:10,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1012442449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:03:10,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:03:10,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:03:10,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998746834] [2025-03-08 14:03:10,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:03:10,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:03:10,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:03:10,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:03:10,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:03:10,615 INFO L87 Difference]: Start difference. First operand has 83 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 14:03:10,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:03:10,633 INFO L93 Difference]: Finished difference Result 163 states and 278 transitions. [2025-03-08 14:03:10,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:03:10,636 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 168 [2025-03-08 14:03:10,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:03:10,645 INFO L225 Difference]: With dead ends: 163 [2025-03-08 14:03:10,645 INFO L226 Difference]: Without dead ends: 80 [2025-03-08 14:03:10,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 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-08 14:03:10,650 INFO L435 NwaCegarLoop]: 126 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, 126 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-08 14:03:10,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:03:10,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-08 14:03:10,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-08 14:03:10,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 53 states have internal predecessors, (73), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 14:03:10,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 123 transitions. [2025-03-08 14:03:10,685 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 123 transitions. Word has length 168 [2025-03-08 14:03:10,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:03:10,685 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 123 transitions. [2025-03-08 14:03:10,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 14:03:10,686 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 123 transitions. [2025-03-08 14:03:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 14:03:10,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:03:10,691 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:03:10,710 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-08 14:03:10,893 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-08 14:03:10,894 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:03:10,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:03:10,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1791799686, now seen corresponding path program 1 times [2025-03-08 14:03:10,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:03:10,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909837766] [2025-03-08 14:03:10,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:03:10,895 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-08 14:03:10,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:03:10,897 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-08 14:03:10,899 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-08 14:03:10,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 14:03:11,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 14:03:11,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:03:11,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:03:11,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 14:03:11,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:03:13,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 14:03:13,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:03:13,060 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:03:13,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909837766] [2025-03-08 14:03:13,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909837766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:03:13,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:03:13,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:03:13,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313699400] [2025-03-08 14:03:13,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:03:13,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 14:03:13,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:03:13,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 14:03:13,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:03:13,062 INFO L87 Difference]: Start difference. First operand 80 states and 123 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 14:03:19,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:03:23,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:03:27,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:03:31,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:03:31,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:03:31,105 INFO L93 Difference]: Finished difference Result 234 states and 363 transitions. [2025-03-08 14:03:31,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:03:31,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 168 [2025-03-08 14:03:31,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:03:31,109 INFO L225 Difference]: With dead ends: 234 [2025-03-08 14:03:31,109 INFO L226 Difference]: Without dead ends: 157 [2025-03-08 14:03:31,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:03:31,110 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 37 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:03:31,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 300 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 4 Unknown, 0 Unchecked, 18.0s Time] [2025-03-08 14:03:31,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-08 14:03:31,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2025-03-08 14:03:31,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 101 states have (on average 1.3762376237623761) internal successors, (139), 101 states have internal predecessors, (139), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 14:03:31,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 239 transitions. [2025-03-08 14:03:31,149 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 239 transitions. Word has length 168 [2025-03-08 14:03:31,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:03:31,149 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 239 transitions. [2025-03-08 14:03:31,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 14:03:31,150 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 239 transitions. [2025-03-08 14:03:31,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 14:03:31,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:03:31,151 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:03:31,169 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-08 14:03:31,352 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-08 14:03:31,352 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:03:31,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:03:31,354 INFO L85 PathProgramCache]: Analyzing trace with hash -255333731, now seen corresponding path program 1 times [2025-03-08 14:03:31,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:03:31,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673702253] [2025-03-08 14:03:31,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:03:31,359 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-08 14:03:31,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:03:31,361 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-08 14:03:31,362 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-08 14:03:31,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 14:03:31,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 14:03:31,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:03:31,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:03:31,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 14:03:31,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:03:33,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 582 proven. 45 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2025-03-08 14:03:33,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:03:34,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-08 14:03:34,224 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:03:34,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673702253] [2025-03-08 14:03:34,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [673702253] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:03:34,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 14:03:34,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-08 14:03:34,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653139202] [2025-03-08 14:03:34,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 14:03:34,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 14:03:34,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:03:34,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 14:03:34,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 14:03:34,225 INFO L87 Difference]: Start difference. First operand 154 states and 239 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-08 14:03:39,415 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-08 14:03:43,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:03:47,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:03:47,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:03:47,484 INFO L93 Difference]: Finished difference Result 321 states and 489 transitions. [2025-03-08 14:03:47,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 14:03:47,485 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 169 [2025-03-08 14:03:47,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:03:47,488 INFO L225 Difference]: With dead ends: 321 [2025-03-08 14:03:47,488 INFO L226 Difference]: Without dead ends: 170 [2025-03-08 14:03:47,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 330 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-03-08 14:03:47,490 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 169 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 88 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2025-03-08 14:03:47,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 204 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 154 Invalid, 3 Unknown, 0 Unchecked, 12.9s Time] [2025-03-08 14:03:47,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-08 14:03:47,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 162. [2025-03-08 14:03:47,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 107 states have internal predecessors, (139), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 14:03:47,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 239 transitions. [2025-03-08 14:03:47,517 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 239 transitions. Word has length 169 [2025-03-08 14:03:47,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:03:47,520 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 239 transitions. [2025-03-08 14:03:47,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-08 14:03:47,520 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 239 transitions. [2025-03-08 14:03:47,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 14:03:47,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:03:47,521 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:03:47,539 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-08 14:03:47,722 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-08 14:03:47,722 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:03:47,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:03:47,723 INFO L85 PathProgramCache]: Analyzing trace with hash -742693306, now seen corresponding path program 1 times [2025-03-08 14:03:47,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:03:47,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045229354] [2025-03-08 14:03:47,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:03:47,723 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-08 14:03:47,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:03:47,725 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-08 14:03:47,726 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-08 14:03:47,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 14:03:48,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 14:03:48,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:03:48,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:03:48,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 14:03:48,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:03:49,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 582 proven. 45 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2025-03-08 14:03:49,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:03:50,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-08 14:03:50,981 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:03:50,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045229354] [2025-03-08 14:03:50,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045229354] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:03:50,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 14:03:50,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2025-03-08 14:03:50,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316335735] [2025-03-08 14:03:50,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 14:03:50,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 14:03:50,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:03:50,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 14:03:50,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-08 14:03:50,983 INFO L87 Difference]: Start difference. First operand 162 states and 239 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41)