./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label49.c --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/eca-rers2012/Problem03_label49.c -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 e2ce90b08f9dc9315f13f0d8408b309f0856f833532caca0391f68d5a9cb9786 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 01:02:15,364 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 01:02:15,422 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 01:02:15,427 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 01:02:15,427 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 01:02:15,448 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 01:02:15,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 01:02:15,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 01:02:15,449 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 01:02:15,449 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 01:02:15,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 01:02:15,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 01:02:15,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 01:02:15,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 01:02:15,449 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 01:02:15,449 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 01:02:15,449 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 01:02:15,449 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 01:02:15,450 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 01:02:15,450 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 01:02:15,450 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 01:02:15,450 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 01:02:15,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 01:02:15,450 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 01:02:15,450 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 01:02:15,450 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 01:02:15,450 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 01:02:15,450 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 01:02:15,450 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 01:02:15,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 01:02:15,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 01:02:15,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 01:02:15,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:02:15,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 01:02:15,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 01:02:15,451 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 01:02:15,451 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 01:02:15,451 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 01:02:15,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 01:02:15,451 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 01:02:15,451 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 01:02:15,451 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 01:02:15,451 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 01:02:15,451 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 -> e2ce90b08f9dc9315f13f0d8408b309f0856f833532caca0391f68d5a9cb9786 [2025-03-08 01:02:15,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 01:02:15,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 01:02:15,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 01:02:15,694 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 01:02:15,694 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 01:02:15,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label49.c [2025-03-08 01:02:16,870 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7186dde66/b7a600e3ba5d4931b649ed35ecd92ef6/FLAG3e8025f4f [2025-03-08 01:02:17,209 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 01:02:17,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label49.c [2025-03-08 01:02:17,225 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7186dde66/b7a600e3ba5d4931b649ed35ecd92ef6/FLAG3e8025f4f [2025-03-08 01:02:17,241 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7186dde66/b7a600e3ba5d4931b649ed35ecd92ef6 [2025-03-08 01:02:17,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 01:02:17,244 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 01:02:17,246 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 01:02:17,246 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 01:02:17,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 01:02:17,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:02:17" (1/1) ... [2025-03-08 01:02:17,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a3212f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:17, skipping insertion in model container [2025-03-08 01:02:17,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:02:17" (1/1) ... [2025-03-08 01:02:17,294 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 01:02:17,670 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/eca-rers2012/Problem03_label49.c[56899,56912] [2025-03-08 01:02:17,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:02:17,708 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 01:02:17,850 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/eca-rers2012/Problem03_label49.c[56899,56912] [2025-03-08 01:02:17,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:02:17,882 INFO L204 MainTranslator]: Completed translation [2025-03-08 01:02:17,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:17 WrapperNode [2025-03-08 01:02:17,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 01:02:17,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 01:02:17,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 01:02:17,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 01:02:17,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:17" (1/1) ... [2025-03-08 01:02:17,915 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:17" (1/1) ... [2025-03-08 01:02:17,991 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-03-08 01:02:17,991 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 01:02:17,992 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 01:02:17,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 01:02:17,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 01:02:17,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:17" (1/1) ... [2025-03-08 01:02:17,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:17" (1/1) ... [2025-03-08 01:02:18,013 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:17" (1/1) ... [2025-03-08 01:02:18,049 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 01:02:18,049 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:17" (1/1) ... [2025-03-08 01:02:18,049 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:17" (1/1) ... [2025-03-08 01:02:18,122 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:17" (1/1) ... [2025-03-08 01:02:18,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:17" (1/1) ... [2025-03-08 01:02:18,133 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:17" (1/1) ... [2025-03-08 01:02:18,138 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:17" (1/1) ... [2025-03-08 01:02:18,149 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 01:02:18,149 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 01:02:18,150 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 01:02:18,150 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 01:02:18,151 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:17" (1/1) ... [2025-03-08 01:02:18,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:02:18,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:02:18,177 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 01:02:18,182 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 01:02:18,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 01:02:18,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 01:02:18,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 01:02:18,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 01:02:18,253 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 01:02:18,254 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 01:02:19,643 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-08 01:02:19,644 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 01:02:19,658 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 01:02:19,658 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 01:02:19,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:02:19 BoogieIcfgContainer [2025-03-08 01:02:19,661 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 01:02:19,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 01:02:19,662 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 01:02:19,665 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 01:02:19,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:02:17" (1/3) ... [2025-03-08 01:02:19,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d42ec24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:02:19, skipping insertion in model container [2025-03-08 01:02:19,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:17" (2/3) ... [2025-03-08 01:02:19,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d42ec24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:02:19, skipping insertion in model container [2025-03-08 01:02:19,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:02:19" (3/3) ... [2025-03-08 01:02:19,668 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label49.c [2025-03-08 01:02:19,678 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 01:02:19,681 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label49.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 01:02:19,727 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 01:02:19,737 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;@3ab863bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 01:02:19,737 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 01:02:19,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:19,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 01:02:19,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:19,754 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:02:19,754 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:19,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:19,759 INFO L85 PathProgramCache]: Analyzing trace with hash -404729554, now seen corresponding path program 1 times [2025-03-08 01:02:19,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:19,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341742237] [2025-03-08 01:02:19,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:19,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:19,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 01:02:20,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 01:02:20,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:20,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:20,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:02:20,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:20,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341742237] [2025-03-08 01:02:20,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341742237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:20,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:20,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:02:20,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637736030] [2025-03-08 01:02:20,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:20,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:20,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:20,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:20,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:20,576 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:21,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:21,523 INFO L93 Difference]: Finished difference Result 860 states and 1504 transitions. [2025-03-08 01:02:21,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:21,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2025-03-08 01:02:21,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:21,532 INFO L225 Difference]: With dead ends: 860 [2025-03-08 01:02:21,532 INFO L226 Difference]: Without dead ends: 465 [2025-03-08 01:02:21,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:21,536 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 136 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:21,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 170 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 01:02:21,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-08 01:02:21,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 459. [2025-03-08 01:02:21,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.556768558951965) internal successors, (713), 458 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:21,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 713 transitions. [2025-03-08 01:02:21,594 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 713 transitions. Word has length 168 [2025-03-08 01:02:21,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:21,595 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 713 transitions. [2025-03-08 01:02:21,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:21,596 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 713 transitions. [2025-03-08 01:02:21,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 01:02:21,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:21,599 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:02:21,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 01:02:21,600 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:21,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:21,600 INFO L85 PathProgramCache]: Analyzing trace with hash -671033724, now seen corresponding path program 1 times [2025-03-08 01:02:21,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:21,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181043823] [2025-03-08 01:02:21,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:21,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:21,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 01:02:21,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 01:02:21,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:21,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:21,823 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:02:21,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:21,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181043823] [2025-03-08 01:02:21,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181043823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:21,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:21,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:02:21,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637174530] [2025-03-08 01:02:21,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:21,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:21,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:21,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:21,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:21,826 INFO L87 Difference]: Start difference. First operand 459 states and 713 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:22,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:22,531 INFO L93 Difference]: Finished difference Result 1343 states and 2102 transitions. [2025-03-08 01:02:22,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:22,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2025-03-08 01:02:22,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:22,537 INFO L225 Difference]: With dead ends: 1343 [2025-03-08 01:02:22,537 INFO L226 Difference]: Without dead ends: 886 [2025-03-08 01:02:22,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:22,541 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:22,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 92 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 01:02:22,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-03-08 01:02:22,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 868. [2025-03-08 01:02:22,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 867 states have (on average 1.532871972318339) internal successors, (1329), 867 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:22,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1329 transitions. [2025-03-08 01:02:22,569 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1329 transitions. Word has length 176 [2025-03-08 01:02:22,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:22,569 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1329 transitions. [2025-03-08 01:02:22,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:22,569 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1329 transitions. [2025-03-08 01:02:22,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 01:02:22,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:22,573 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:02:22,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 01:02:22,573 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:22,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:22,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1410941572, now seen corresponding path program 1 times [2025-03-08 01:02:22,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:22,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733883013] [2025-03-08 01:02:22,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:22,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:22,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 01:02:22,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 01:02:22,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:22,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:22,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:02:22,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:22,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733883013] [2025-03-08 01:02:22,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733883013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:22,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:22,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:02:22,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112671716] [2025-03-08 01:02:22,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:22,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:22,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:22,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:22,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:22,761 INFO L87 Difference]: Start difference. First operand 868 states and 1329 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:23,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:23,079 INFO L93 Difference]: Finished difference Result 1710 states and 2622 transitions. [2025-03-08 01:02:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:23,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 181 [2025-03-08 01:02:23,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:23,083 INFO L225 Difference]: With dead ends: 1710 [2025-03-08 01:02:23,083 INFO L226 Difference]: Without dead ends: 844 [2025-03-08 01:02:23,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:23,084 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 329 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:23,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 31 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 01:02:23,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2025-03-08 01:02:23,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 844. [2025-03-08 01:02:23,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 843 states have (on average 1.4768683274021353) internal successors, (1245), 843 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:23,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1245 transitions. [2025-03-08 01:02:23,098 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1245 transitions. Word has length 181 [2025-03-08 01:02:23,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:23,099 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1245 transitions. [2025-03-08 01:02:23,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1245 transitions. [2025-03-08 01:02:23,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 01:02:23,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:23,101 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:02:23,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 01:02:23,101 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:23,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:23,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1752468616, now seen corresponding path program 1 times [2025-03-08 01:02:23,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:23,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061608013] [2025-03-08 01:02:23,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:23,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:23,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 01:02:23,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 01:02:23,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:23,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:23,317 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 01:02:23,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:23,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061608013] [2025-03-08 01:02:23,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061608013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:23,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:23,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:02:23,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189937873] [2025-03-08 01:02:23,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:23,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:23,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:23,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:23,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:23,320 INFO L87 Difference]: Start difference. First operand 844 states and 1245 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:23,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:23,941 INFO L93 Difference]: Finished difference Result 2498 states and 3690 transitions. [2025-03-08 01:02:23,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:23,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 182 [2025-03-08 01:02:23,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:23,947 INFO L225 Difference]: With dead ends: 2498 [2025-03-08 01:02:23,947 INFO L226 Difference]: Without dead ends: 1656 [2025-03-08 01:02:23,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:23,948 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 209 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:23,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 142 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:02:23,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2025-03-08 01:02:23,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1656. [2025-03-08 01:02:23,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1655 states have (on average 1.3069486404833837) internal successors, (2163), 1655 states have internal predecessors, (2163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:23,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2163 transitions. [2025-03-08 01:02:23,979 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2163 transitions. Word has length 182 [2025-03-08 01:02:23,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:23,980 INFO L471 AbstractCegarLoop]: Abstraction has 1656 states and 2163 transitions. [2025-03-08 01:02:23,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:23,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2163 transitions. [2025-03-08 01:02:23,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 01:02:23,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:23,983 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:02:23,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 01:02:23,984 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:23,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:23,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1353323737, now seen corresponding path program 1 times [2025-03-08 01:02:23,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:23,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552253041] [2025-03-08 01:02:23,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:23,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:24,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 01:02:24,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 01:02:24,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:24,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 01:02:24,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:24,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552253041] [2025-03-08 01:02:24,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552253041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:24,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:24,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:02:24,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051905202] [2025-03-08 01:02:24,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:24,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:24,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:24,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:24,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:24,238 INFO L87 Difference]: Start difference. First operand 1656 states and 2163 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:24,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:24,932 INFO L93 Difference]: Finished difference Result 4962 states and 6483 transitions. [2025-03-08 01:02:24,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:24,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 187 [2025-03-08 01:02:24,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:24,942 INFO L225 Difference]: With dead ends: 4962 [2025-03-08 01:02:24,942 INFO L226 Difference]: Without dead ends: 3308 [2025-03-08 01:02:24,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:24,945 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 286 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:24,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 51 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:02:24,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3308 states. [2025-03-08 01:02:24,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3308 to 3305. [2025-03-08 01:02:24,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3305 states, 3304 states have (on average 1.3014527845036319) internal successors, (4300), 3304 states have internal predecessors, (4300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:24,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 4300 transitions. [2025-03-08 01:02:24,999 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 4300 transitions. Word has length 187 [2025-03-08 01:02:24,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:24,999 INFO L471 AbstractCegarLoop]: Abstraction has 3305 states and 4300 transitions. [2025-03-08 01:02:24,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:25,000 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 4300 transitions. [2025-03-08 01:02:25,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 01:02:25,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:25,004 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:02:25,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 01:02:25,004 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:25,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:25,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1193575715, now seen corresponding path program 1 times [2025-03-08 01:02:25,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:25,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005081376] [2025-03-08 01:02:25,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:25,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:25,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 01:02:25,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 01:02:25,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:25,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 01:02:25,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:25,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005081376] [2025-03-08 01:02:25,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005081376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:02:25,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817004464] [2025-03-08 01:02:25,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:25,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:25,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:02:25,212 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 01:02:25,213 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 01:02:25,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 01:02:25,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 01:02:25,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:25,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:25,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:02:25,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:02:25,408 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 01:02:25,408 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:02:25,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817004464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:25,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:02:25,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-08 01:02:25,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694853534] [2025-03-08 01:02:25,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:25,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:25,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:25,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:25,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:02:25,409 INFO L87 Difference]: Start difference. First operand 3305 states and 4300 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:25,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:25,699 INFO L93 Difference]: Finished difference Result 9903 states and 12888 transitions. [2025-03-08 01:02:25,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:25,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2025-03-08 01:02:25,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:25,722 INFO L225 Difference]: With dead ends: 9903 [2025-03-08 01:02:25,722 INFO L226 Difference]: Without dead ends: 6600 [2025-03-08 01:02:25,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:02:25,729 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 321 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:25,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 535 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 01:02:25,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6600 states. [2025-03-08 01:02:25,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6600 to 6592. [2025-03-08 01:02:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6592 states, 6591 states have (on average 1.3010165377029281) internal successors, (8575), 6591 states have internal predecessors, (8575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:25,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6592 states to 6592 states and 8575 transitions. [2025-03-08 01:02:25,882 INFO L78 Accepts]: Start accepts. Automaton has 6592 states and 8575 transitions. Word has length 188 [2025-03-08 01:02:25,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:25,882 INFO L471 AbstractCegarLoop]: Abstraction has 6592 states and 8575 transitions. [2025-03-08 01:02:25,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:25,883 INFO L276 IsEmpty]: Start isEmpty. Operand 6592 states and 8575 transitions. [2025-03-08 01:02:25,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 01:02:25,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:25,891 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:02:25,901 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 01:02:26,091 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,SelfDestructingSolverStorable5 [2025-03-08 01:02:26,092 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:26,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:26,093 INFO L85 PathProgramCache]: Analyzing trace with hash 268270712, now seen corresponding path program 1 times [2025-03-08 01:02:26,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:26,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554060980] [2025-03-08 01:02:26,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:26,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:26,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 01:02:26,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 01:02:26,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:26,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:26,272 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:02:26,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:26,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554060980] [2025-03-08 01:02:26,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554060980] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:02:26,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411666948] [2025-03-08 01:02:26,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:26,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:26,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:02:26,275 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 01:02:26,277 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 01:02:26,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 01:02:26,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 01:02:26,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:26,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:26,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:02:26,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:02:26,425 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 01:02:26,425 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:02:26,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411666948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:26,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:02:26,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 01:02:26,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586244648] [2025-03-08 01:02:26,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:26,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:26,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:26,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:26,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:02:26,426 INFO L87 Difference]: Start difference. First operand 6592 states and 8575 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:27,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:27,172 INFO L93 Difference]: Finished difference Result 16438 states and 21944 transitions. [2025-03-08 01:02:27,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:27,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 190 [2025-03-08 01:02:27,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:27,203 INFO L225 Difference]: With dead ends: 16438 [2025-03-08 01:02:27,203 INFO L226 Difference]: Without dead ends: 9848 [2025-03-08 01:02:27,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:02:27,214 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 210 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:27,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 367 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:02:27,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9848 states. [2025-03-08 01:02:27,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9848 to 9840. [2025-03-08 01:02:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9840 states, 9839 states have (on average 1.2353897753836771) internal successors, (12155), 9839 states have internal predecessors, (12155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:27,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9840 states to 9840 states and 12155 transitions. [2025-03-08 01:02:27,443 INFO L78 Accepts]: Start accepts. Automaton has 9840 states and 12155 transitions. Word has length 190 [2025-03-08 01:02:27,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:27,443 INFO L471 AbstractCegarLoop]: Abstraction has 9840 states and 12155 transitions. [2025-03-08 01:02:27,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:27,443 INFO L276 IsEmpty]: Start isEmpty. Operand 9840 states and 12155 transitions. [2025-03-08 01:02:27,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-08 01:02:27,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:27,451 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:02:27,458 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 01:02:27,651 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,SelfDestructingSolverStorable6 [2025-03-08 01:02:27,652 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:27,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:27,653 INFO L85 PathProgramCache]: Analyzing trace with hash -824441090, now seen corresponding path program 1 times [2025-03-08 01:02:27,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:27,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173751820] [2025-03-08 01:02:27,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:27,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:27,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-08 01:02:27,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-08 01:02:27,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:27,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:27,937 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 01:02:27,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:27,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173751820] [2025-03-08 01:02:27,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173751820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:27,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:27,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:02:27,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674106737] [2025-03-08 01:02:27,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:27,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:02:27,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:27,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:02:27,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:02:27,940 INFO L87 Difference]: Start difference. First operand 9840 states and 12155 transitions. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:28,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:28,667 INFO L93 Difference]: Finished difference Result 19700 states and 24350 transitions. [2025-03-08 01:02:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:02:28,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 224 [2025-03-08 01:02:28,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:28,694 INFO L225 Difference]: With dead ends: 19700 [2025-03-08 01:02:28,694 INFO L226 Difference]: Without dead ends: 9862 [2025-03-08 01:02:28,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:02:28,706 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 796 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:28,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 44 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:02:28,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9862 states. [2025-03-08 01:02:28,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9862 to 9840. [2025-03-08 01:02:28,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9840 states, 9839 states have (on average 1.2256326862486024) internal successors, (12059), 9839 states have internal predecessors, (12059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:28,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9840 states to 9840 states and 12059 transitions. [2025-03-08 01:02:28,872 INFO L78 Accepts]: Start accepts. Automaton has 9840 states and 12059 transitions. Word has length 224 [2025-03-08 01:02:28,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:28,872 INFO L471 AbstractCegarLoop]: Abstraction has 9840 states and 12059 transitions. [2025-03-08 01:02:28,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:28,873 INFO L276 IsEmpty]: Start isEmpty. Operand 9840 states and 12059 transitions. [2025-03-08 01:02:28,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-08 01:02:28,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:28,879 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:02:28,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 01:02:28,880 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:28,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:28,880 INFO L85 PathProgramCache]: Analyzing trace with hash 896630500, now seen corresponding path program 1 times [2025-03-08 01:02:28,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:28,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343302865] [2025-03-08 01:02:28,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:28,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:28,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-08 01:02:28,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-08 01:02:28,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:28,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:29,132 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:02:29,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:29,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343302865] [2025-03-08 01:02:29,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343302865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:29,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:29,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:02:29,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663554312] [2025-03-08 01:02:29,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:29,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:02:29,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:29,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:02:29,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:02:29,135 INFO L87 Difference]: Start difference. First operand 9840 states and 12059 transitions. Second operand has 4 states, 4 states have (on average 59.5) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:30,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:30,069 INFO L93 Difference]: Finished difference Result 34386 states and 42315 transitions. [2025-03-08 01:02:30,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:02:30,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2025-03-08 01:02:30,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:30,120 INFO L225 Difference]: With dead ends: 34386 [2025-03-08 01:02:30,120 INFO L226 Difference]: Without dead ends: 24548 [2025-03-08 01:02:30,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:02:30,132 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 535 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:30,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 471 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 01:02:30,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24548 states. [2025-03-08 01:02:30,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24548 to 24534. [2025-03-08 01:02:30,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24534 states, 24533 states have (on average 1.211796355928749) internal successors, (29729), 24533 states have internal predecessors, (29729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:30,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24534 states to 24534 states and 29729 transitions. [2025-03-08 01:02:30,540 INFO L78 Accepts]: Start accepts. Automaton has 24534 states and 29729 transitions. Word has length 238 [2025-03-08 01:02:30,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:30,542 INFO L471 AbstractCegarLoop]: Abstraction has 24534 states and 29729 transitions. [2025-03-08 01:02:30,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:30,542 INFO L276 IsEmpty]: Start isEmpty. Operand 24534 states and 29729 transitions. [2025-03-08 01:02:30,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-08 01:02:30,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:30,548 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:02:30,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 01:02:30,549 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:30,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:30,549 INFO L85 PathProgramCache]: Analyzing trace with hash -621195945, now seen corresponding path program 1 times [2025-03-08 01:02:30,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:30,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046357203] [2025-03-08 01:02:30,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:30,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:30,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-08 01:02:30,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-08 01:02:30,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:30,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:31,457 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-08 01:02:31,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:31,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046357203] [2025-03-08 01:02:31,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046357203] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:02:31,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080502483] [2025-03-08 01:02:31,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:31,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:31,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:02:31,460 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 01:02:31,462 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 01:02:31,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-08 01:02:31,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-08 01:02:31,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:31,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:31,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:02:31,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:02:31,783 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 01:02:31,783 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:02:31,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080502483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:31,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:02:31,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-08 01:02:31,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283433452] [2025-03-08 01:02:31,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:31,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:31,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:31,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:31,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:02:31,785 INFO L87 Difference]: Start difference. First operand 24534 states and 29729 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:32,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:32,570 INFO L93 Difference]: Finished difference Result 69460 states and 84273 transitions. [2025-03-08 01:02:32,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:32,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 247 [2025-03-08 01:02:32,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:32,654 INFO L225 Difference]: With dead ends: 69460 [2025-03-08 01:02:32,654 INFO L226 Difference]: Without dead ends: 44928 [2025-03-08 01:02:32,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:02:32,683 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 63 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:32,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 143 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:02:32,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44928 states. [2025-03-08 01:02:33,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44928 to 40810. [2025-03-08 01:02:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40810 states, 40809 states have (on average 1.2188487833566126) internal successors, (49740), 40809 states have internal predecessors, (49740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40810 states to 40810 states and 49740 transitions. [2025-03-08 01:02:33,331 INFO L78 Accepts]: Start accepts. Automaton has 40810 states and 49740 transitions. Word has length 247 [2025-03-08 01:02:33,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:33,332 INFO L471 AbstractCegarLoop]: Abstraction has 40810 states and 49740 transitions. [2025-03-08 01:02:33,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:33,332 INFO L276 IsEmpty]: Start isEmpty. Operand 40810 states and 49740 transitions. [2025-03-08 01:02:33,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-08 01:02:33,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:33,344 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:02:33,352 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 01:02:33,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:33,545 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:33,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:33,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1672086589, now seen corresponding path program 1 times [2025-03-08 01:02:33,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:33,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970388139] [2025-03-08 01:02:33,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:33,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:33,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-08 01:02:33,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-08 01:02:33,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:33,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:33,674 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:02:33,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:33,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970388139] [2025-03-08 01:02:33,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970388139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:33,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:33,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:02:33,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950353947] [2025-03-08 01:02:33,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:33,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:33,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:33,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:33,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:33,677 INFO L87 Difference]: Start difference. First operand 40810 states and 49740 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:34,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:34,627 INFO L93 Difference]: Finished difference Result 113306 states and 138298 transitions. [2025-03-08 01:02:34,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:34,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 278 [2025-03-08 01:02:34,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:34,761 INFO L225 Difference]: With dead ends: 113306 [2025-03-08 01:02:34,761 INFO L226 Difference]: Without dead ends: 72498 [2025-03-08 01:02:34,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:34,801 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 230 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:34,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 340 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 01:02:34,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72498 states. [2025-03-08 01:02:35,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72498 to 72082. [2025-03-08 01:02:35,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72082 states, 72081 states have (on average 1.1752611645232447) internal successors, (84714), 72081 states have internal predecessors, (84714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:35,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72082 states to 72082 states and 84714 transitions. [2025-03-08 01:02:35,881 INFO L78 Accepts]: Start accepts. Automaton has 72082 states and 84714 transitions. Word has length 278 [2025-03-08 01:02:35,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:35,881 INFO L471 AbstractCegarLoop]: Abstraction has 72082 states and 84714 transitions. [2025-03-08 01:02:35,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:35,882 INFO L276 IsEmpty]: Start isEmpty. Operand 72082 states and 84714 transitions. [2025-03-08 01:02:35,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-03-08 01:02:35,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:35,919 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:02:35,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 01:02:35,919 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:35,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:35,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1018518093, now seen corresponding path program 1 times [2025-03-08 01:02:35,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:35,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124528374] [2025-03-08 01:02:35,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:35,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:36,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-03-08 01:02:36,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-03-08 01:02:36,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:36,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:36,640 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 205 proven. 62 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 01:02:36,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:36,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124528374] [2025-03-08 01:02:36,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124528374] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:02:36,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379322190] [2025-03-08 01:02:36,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:36,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:36,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:02:36,644 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 01:02:36,646 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 01:02:36,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-03-08 01:02:36,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-03-08 01:02:36,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:36,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:36,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 01:02:36,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:02:36,815 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-08 01:02:36,815 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:02:36,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379322190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:36,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:02:36,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-08 01:02:36,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485235577] [2025-03-08 01:02:36,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:36,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:36,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:36,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:36,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:02:36,817 INFO L87 Difference]: Start difference. First operand 72082 states and 84714 transitions. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:37,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:37,759 INFO L93 Difference]: Finished difference Result 187212 states and 219601 transitions. [2025-03-08 01:02:37,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:37,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 368 [2025-03-08 01:02:37,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:37,924 INFO L225 Difference]: With dead ends: 187212 [2025-03-08 01:02:37,924 INFO L226 Difference]: Without dead ends: 115132 [2025-03-08 01:02:37,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:02:37,995 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 243 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:37,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 313 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 01:02:38,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115132 states. [2025-03-08 01:02:39,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115132 to 100900. [2025-03-08 01:02:39,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100900 states, 100899 states have (on average 1.135095491531135) internal successors, (114530), 100899 states have internal predecessors, (114530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:39,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100900 states to 100900 states and 114530 transitions. [2025-03-08 01:02:39,731 INFO L78 Accepts]: Start accepts. Automaton has 100900 states and 114530 transitions. Word has length 368 [2025-03-08 01:02:39,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:39,732 INFO L471 AbstractCegarLoop]: Abstraction has 100900 states and 114530 transitions. [2025-03-08 01:02:39,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:39,732 INFO L276 IsEmpty]: Start isEmpty. Operand 100900 states and 114530 transitions. [2025-03-08 01:02:39,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-03-08 01:02:39,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:39,787 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:02:39,796 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 01:02:39,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:39,988 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:39,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:39,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1345943561, now seen corresponding path program 1 times [2025-03-08 01:02:39,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:39,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418897895] [2025-03-08 01:02:39,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:39,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:40,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-03-08 01:02:40,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-03-08 01:02:40,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:40,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:40,269 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-03-08 01:02:40,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:40,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418897895] [2025-03-08 01:02:40,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418897895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:40,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:40,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:02:40,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375035302] [2025-03-08 01:02:40,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:40,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:40,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:40,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:40,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:40,272 INFO L87 Difference]: Start difference. First operand 100900 states and 114530 transitions. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 2 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:41,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:41,296 INFO L93 Difference]: Finished difference Result 273810 states and 310126 transitions. [2025-03-08 01:02:41,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:41,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 2 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 409 [2025-03-08 01:02:41,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:41,563 INFO L225 Difference]: With dead ends: 273810 [2025-03-08 01:02:41,563 INFO L226 Difference]: Without dead ends: 172912 [2025-03-08 01:02:41,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:41,668 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 204 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:41,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 452 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 01:02:41,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172912 states. [2025-03-08 01:02:43,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172912 to 172910. [2025-03-08 01:02:44,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172910 states, 172909 states have (on average 1.1303113198271924) internal successors, (195441), 172909 states have internal predecessors, (195441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:44,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172910 states to 172910 states and 195441 transitions. [2025-03-08 01:02:44,610 INFO L78 Accepts]: Start accepts. Automaton has 172910 states and 195441 transitions. Word has length 409 [2025-03-08 01:02:44,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:44,611 INFO L471 AbstractCegarLoop]: Abstraction has 172910 states and 195441 transitions. [2025-03-08 01:02:44,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 2 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:44,611 INFO L276 IsEmpty]: Start isEmpty. Operand 172910 states and 195441 transitions. [2025-03-08 01:02:44,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-03-08 01:02:44,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:44,660 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:02:44,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 01:02:44,660 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:44,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:44,661 INFO L85 PathProgramCache]: Analyzing trace with hash -660620157, now seen corresponding path program 1 times [2025-03-08 01:02:44,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:44,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157052016] [2025-03-08 01:02:44,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:44,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:44,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-03-08 01:02:44,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-03-08 01:02:44,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:44,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:45,245 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-03-08 01:02:45,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:45,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157052016] [2025-03-08 01:02:45,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157052016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:45,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:45,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:02:45,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943129148] [2025-03-08 01:02:45,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:45,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:02:45,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:45,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:02:45,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:02:45,247 INFO L87 Difference]: Start difference. First operand 172910 states and 195441 transitions. Second operand has 4 states, 4 states have (on average 68.0) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:46,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:46,986 INFO L93 Difference]: Finished difference Result 397505 states and 449271 transitions. [2025-03-08 01:02:46,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:02:46,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 415 [2025-03-08 01:02:46,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:47,323 INFO L225 Difference]: With dead ends: 397505 [2025-03-08 01:02:47,323 INFO L226 Difference]: Without dead ends: 224597 [2025-03-08 01:02:47,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:02:47,668 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 344 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:47,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 96 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 01:02:47,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224597 states. [2025-03-08 01:02:50,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224597 to 218788. [2025-03-08 01:02:50,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218788 states, 218787 states have (on average 1.110975514998606) internal successors, (243067), 218787 states have internal predecessors, (243067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:50,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218788 states to 218788 states and 243067 transitions. [2025-03-08 01:02:50,509 INFO L78 Accepts]: Start accepts. Automaton has 218788 states and 243067 transitions. Word has length 415 [2025-03-08 01:02:50,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:50,510 INFO L471 AbstractCegarLoop]: Abstraction has 218788 states and 243067 transitions. [2025-03-08 01:02:50,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:50,510 INFO L276 IsEmpty]: Start isEmpty. Operand 218788 states and 243067 transitions. [2025-03-08 01:02:50,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-03-08 01:02:50,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:50,572 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:02:50,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 01:02:50,572 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:50,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:50,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1107079370, now seen corresponding path program 1 times [2025-03-08 01:02:50,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:50,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671188431] [2025-03-08 01:02:50,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:50,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:50,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-03-08 01:02:50,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-03-08 01:02:50,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:50,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2025-03-08 01:02:52,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:52,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671188431] [2025-03-08 01:02:52,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671188431] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:02:52,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913249411] [2025-03-08 01:02:52,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:52,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:52,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:02:52,390 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 01:02:52,392 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 01:02:52,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-03-08 01:02:52,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-03-08 01:02:52,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:52,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:52,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:02:52,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:02:52,813 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-08 01:02:52,813 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:02:52,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913249411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:52,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:02:52,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-08 01:02:52,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277005373] [2025-03-08 01:02:52,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:52,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:52,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:52,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:52,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:02:52,814 INFO L87 Difference]: Start difference. First operand 218788 states and 243067 transitions. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:54,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:54,311 INFO L93 Difference]: Finished difference Result 437602 states and 486184 transitions. [2025-03-08 01:02:54,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:54,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 443 [2025-03-08 01:02:54,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:54,650 INFO L225 Difference]: With dead ends: 437602 [2025-03-08 01:02:54,650 INFO L226 Difference]: Without dead ends: 218816 [2025-03-08 01:02:54,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:02:54,766 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 73 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:54,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 117 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:02:54,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218816 states. [2025-03-08 01:02:57,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218816 to 217164. [2025-03-08 01:02:57,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217164 states, 217163 states have (on average 1.0944682105146826) internal successors, (237678), 217163 states have internal predecessors, (237678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:57,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217164 states to 217164 states and 237678 transitions. [2025-03-08 01:02:57,742 INFO L78 Accepts]: Start accepts. Automaton has 217164 states and 237678 transitions. Word has length 443 [2025-03-08 01:02:57,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:57,743 INFO L471 AbstractCegarLoop]: Abstraction has 217164 states and 237678 transitions. [2025-03-08 01:02:57,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:57,743 INFO L276 IsEmpty]: Start isEmpty. Operand 217164 states and 237678 transitions. [2025-03-08 01:02:57,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-08 01:02:57,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:57,812 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:02:57,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 01:02:58,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 01:02:58,012 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:58,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:58,013 INFO L85 PathProgramCache]: Analyzing trace with hash 2080972516, now seen corresponding path program 1 times [2025-03-08 01:02:58,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:58,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603344402] [2025-03-08 01:02:58,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:58,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:58,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-08 01:02:58,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-08 01:02:58,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:58,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:59,907 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 64 proven. 195 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2025-03-08 01:02:59,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:59,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603344402] [2025-03-08 01:02:59,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603344402] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:02:59,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165319573] [2025-03-08 01:02:59,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:59,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:59,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:02:59,911 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 01:02:59,915 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 01:02:59,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-08 01:03:00,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-08 01:03:00,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:03:00,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:03:00,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:03:00,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:03:00,411 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2025-03-08 01:03:00,411 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:03:00,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165319573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:03:00,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:03:00,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 01:03:00,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632827406] [2025-03-08 01:03:00,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:03:00,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:03:00,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:03:00,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:03:00,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:03:00,413 INFO L87 Difference]: Start difference. First operand 217164 states and 237678 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:03:01,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:03:01,938 INFO L93 Difference]: Finished difference Result 432121 states and 472939 transitions. [2025-03-08 01:03:01,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:03:01,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 465 [2025-03-08 01:03:01,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:03:02,225 INFO L225 Difference]: With dead ends: 432121 [2025-03-08 01:03:02,225 INFO L226 Difference]: Without dead ends: 214959 [2025-03-08 01:03:02,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:03:02,327 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 95 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:03:02,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 291 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 01:03:02,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214959 states. [2025-03-08 01:03:05,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214959 to 210871. [2025-03-08 01:03:05,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210871 states, 210870 states have (on average 1.0890643524446342) internal successors, (229651), 210870 states have internal predecessors, (229651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:03:05,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210871 states to 210871 states and 229651 transitions. [2025-03-08 01:03:05,691 INFO L78 Accepts]: Start accepts. Automaton has 210871 states and 229651 transitions. Word has length 465 [2025-03-08 01:03:05,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:03:05,692 INFO L471 AbstractCegarLoop]: Abstraction has 210871 states and 229651 transitions. [2025-03-08 01:03:05,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:03:05,692 INFO L276 IsEmpty]: Start isEmpty. Operand 210871 states and 229651 transitions. [2025-03-08 01:03:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-03-08 01:03:05,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:03:05,745 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:03:05,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 01:03:05,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 01:03:05,946 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:03:05,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:03:05,947 INFO L85 PathProgramCache]: Analyzing trace with hash 882724004, now seen corresponding path program 1 times [2025-03-08 01:03:05,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:03:05,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122676056] [2025-03-08 01:03:05,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:03:05,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:03:05,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-08 01:03:06,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-08 01:03:06,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:03:06,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:03:06,768 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 325 proven. 6 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2025-03-08 01:03:06,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:03:06,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122676056] [2025-03-08 01:03:06,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122676056] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:03:06,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239279530] [2025-03-08 01:03:06,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:03:06,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:03:06,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:03:06,770 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 01:03:06,772 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 01:03:06,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-08 01:03:06,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-08 01:03:06,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:03:06,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:03:06,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 01:03:06,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:03:07,271 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 491 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-03-08 01:03:07,271 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:03:07,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239279530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:03:07,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:03:07,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2025-03-08 01:03:07,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376183010] [2025-03-08 01:03:07,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:03:07,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:03:07,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:03:07,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:03:07,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:03:07,273 INFO L87 Difference]: Start difference. First operand 210871 states and 229651 transitions. Second operand has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:03:09,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:03:09,284 INFO L93 Difference]: Finished difference Result 452682 states and 493110 transitions. [2025-03-08 01:03:09,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:03:09,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2025-03-08 01:03:09,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:03:09,598 INFO L225 Difference]: With dead ends: 452682 [2025-03-08 01:03:09,598 INFO L226 Difference]: Without dead ends: 241813 [2025-03-08 01:03:09,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:03:09,766 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 281 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:03:09,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 133 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 01:03:09,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241813 states. [2025-03-08 01:03:12,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241813 to 239333. [2025-03-08 01:03:12,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239333 states, 239332 states have (on average 1.075756689452309) internal successors, (257463), 239332 states have internal predecessors, (257463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:03:12,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239333 states to 239333 states and 257463 transitions. [2025-03-08 01:03:12,908 INFO L78 Accepts]: Start accepts. Automaton has 239333 states and 257463 transitions. Word has length 476 [2025-03-08 01:03:12,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:03:12,909 INFO L471 AbstractCegarLoop]: Abstraction has 239333 states and 257463 transitions. [2025-03-08 01:03:12,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:03:12,909 INFO L276 IsEmpty]: Start isEmpty. Operand 239333 states and 257463 transitions. [2025-03-08 01:03:12,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-03-08 01:03:12,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:03:12,968 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:03:12,975 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 01:03:13,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:03:13,169 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:03:13,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:03:13,170 INFO L85 PathProgramCache]: Analyzing trace with hash 112353864, now seen corresponding path program 1 times [2025-03-08 01:03:13,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:03:13,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800125431] [2025-03-08 01:03:13,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:03:13,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:03:13,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes.