./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label43.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label43.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 b76d5bd3a937dd443771d4fd333665d0cd3fbe44dd72d1f97738d181d0765bea --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:20:16,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:20:16,519 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:20:16,522 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:20:16,523 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:20:16,545 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:20:16,546 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:20:16,546 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:20:16,547 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:20:16,547 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:20:16,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:20:16,548 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:20:16,548 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:20:16,548 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:20:16,548 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:20:16,548 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:20:16,548 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:20:16,548 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:20:16,548 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:20:16,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:20:16,549 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:20:16,549 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:20:16,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:20:16,549 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:20:16,549 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:20:16,549 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:20:16,549 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:20:16,549 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:20:16,549 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:20:16,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:20:16,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:20:16,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:20:16,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:20:16,550 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:20:16,550 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:20:16,551 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:20:16,551 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:20:16,551 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:20:16,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:20:16,551 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:20:16,551 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:20:16,551 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:20:16,551 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:20:16,551 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 -> b76d5bd3a937dd443771d4fd333665d0cd3fbe44dd72d1f97738d181d0765bea [2025-03-16 15:20:16,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:20:16,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:20:16,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:20:16,766 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:20:16,767 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:20:16,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label43.c [2025-03-16 15:20:17,850 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb023c105/a19cfdbef77647be80fe20ef63358535/FLAG646bcf296 [2025-03-16 15:20:18,244 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:20:18,245 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label43.c [2025-03-16 15:20:18,266 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb023c105/a19cfdbef77647be80fe20ef63358535/FLAG646bcf296 [2025-03-16 15:20:18,403 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb023c105/a19cfdbef77647be80fe20ef63358535 [2025-03-16 15:20:18,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:20:18,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:20:18,407 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:20:18,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:20:18,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:20:18,410 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:20:18" (1/1) ... [2025-03-16 15:20:18,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b9ba58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:20:18, skipping insertion in model container [2025-03-16 15:20:18,411 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:20:18" (1/1) ... [2025-03-16 15:20:18,466 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:20:18,625 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/Problem17_label43.c[9211,9224] [2025-03-16 15:20:18,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:20:18,985 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:20:19,024 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/Problem17_label43.c[9211,9224] [2025-03-16 15:20:19,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:20:19,187 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:20:19,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:20:19 WrapperNode [2025-03-16 15:20:19,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:20:19,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:20:19,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:20:19,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:20:19,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:20:19" (1/1) ... [2025-03-16 15:20:19,225 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:20:19" (1/1) ... [2025-03-16 15:20:19,407 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-16 15:20:19,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:20:19,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:20:19,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:20:19,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:20:19,414 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:20:19" (1/1) ... [2025-03-16 15:20:19,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:20:19" (1/1) ... [2025-03-16 15:20:19,482 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:20:19" (1/1) ... [2025-03-16 15:20:19,584 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-16 15:20:19,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:20:19" (1/1) ... [2025-03-16 15:20:19,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:20:19" (1/1) ... [2025-03-16 15:20:19,702 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:20:19" (1/1) ... [2025-03-16 15:20:19,718 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:20:19" (1/1) ... [2025-03-16 15:20:19,732 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:20:19" (1/1) ... [2025-03-16 15:20:19,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:20:19" (1/1) ... [2025-03-16 15:20:19,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:20:19,775 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:20:19,775 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:20:19,775 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:20:19,776 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:20:19" (1/1) ... [2025-03-16 15:20:19,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:20:19,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:20:19,801 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-16 15:20:19,807 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-16 15:20:19,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:20:19,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:20:19,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:20:19,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:20:19,866 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:20:19,867 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:20:22,345 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-16 15:20:22,517 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-16 15:20:22,518 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:20:22,546 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:20:22,547 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:20:22,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:20:22 BoogieIcfgContainer [2025-03-16 15:20:22,548 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:20:22,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:20:22,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:20:22,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:20:22,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:20:18" (1/3) ... [2025-03-16 15:20:22,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11777e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:20:22, skipping insertion in model container [2025-03-16 15:20:22,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:20:19" (2/3) ... [2025-03-16 15:20:22,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11777e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:20:22, skipping insertion in model container [2025-03-16 15:20:22,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:20:22" (3/3) ... [2025-03-16 15:20:22,556 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label43.c [2025-03-16 15:20:22,568 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:20:22,569 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label43.c that has 1 procedures, 529 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:20:22,628 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:20:22,635 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;@11a40971, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:20:22,636 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:20:22,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 529 states, 527 states have (on average 1.8975332068311195) internal successors, (1000), 528 states have internal predecessors, (1000), 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-16 15:20:22,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 15:20:22,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:22,647 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] [2025-03-16 15:20:22,648 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:22,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:22,652 INFO L85 PathProgramCache]: Analyzing trace with hash -150099466, now seen corresponding path program 1 times [2025-03-16 15:20:22,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:22,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582612366] [2025-03-16 15:20:22,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:22,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:22,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 15:20:22,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 15:20:22,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:22,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:22,779 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-16 15:20:22,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:22,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582612366] [2025-03-16 15:20:22,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582612366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:22,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:22,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:20:22,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831961677] [2025-03-16 15:20:22,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:22,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:20:22,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:22,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:20:22,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:20:22,800 INFO L87 Difference]: Start difference. First operand has 529 states, 527 states have (on average 1.8975332068311195) internal successors, (1000), 528 states have internal predecessors, (1000), 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 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 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-16 15:20:22,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:22,856 INFO L93 Difference]: Finished difference Result 1057 states and 1999 transitions. [2025-03-16 15:20:22,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:20:22,860 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 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 61 [2025-03-16 15:20:22,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:22,872 INFO L225 Difference]: With dead ends: 1057 [2025-03-16 15:20:22,872 INFO L226 Difference]: Without dead ends: 526 [2025-03-16 15:20:22,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:20:22,880 INFO L435 NwaCegarLoop]: 938 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:22,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:20:22,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-16 15:20:22,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-03-16 15:20:22,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 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-16 15:20:22,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2025-03-16 15:20:22,936 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 61 [2025-03-16 15:20:22,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:22,937 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2025-03-16 15:20:22,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 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-16 15:20:22,937 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2025-03-16 15:20:22,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 15:20:22,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:22,940 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] [2025-03-16 15:20:22,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:20:22,940 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:22,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:22,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1249402723, now seen corresponding path program 1 times [2025-03-16 15:20:22,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:22,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121629736] [2025-03-16 15:20:22,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:22,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:22,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 15:20:22,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 15:20:22,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:22,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:23,143 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-16 15:20:23,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:23,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121629736] [2025-03-16 15:20:23,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121629736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:23,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:23,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:20:23,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726065702] [2025-03-16 15:20:23,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:23,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:20:23,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:23,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:20:23,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:23,146 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 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-16 15:20:25,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:25,040 INFO L93 Difference]: Finished difference Result 1499 states and 2693 transitions. [2025-03-16 15:20:25,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:25,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 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 61 [2025-03-16 15:20:25,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:25,049 INFO L225 Difference]: With dead ends: 1499 [2025-03-16 15:20:25,049 INFO L226 Difference]: Without dead ends: 974 [2025-03-16 15:20:25,049 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-16 15:20:25,050 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 412 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:25,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 497 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:20:25,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-03-16 15:20:25,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 971. [2025-03-16 15:20:25,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5082474226804123) internal successors, (1463), 970 states have internal predecessors, (1463), 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-16 15:20:25,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1463 transitions. [2025-03-16 15:20:25,082 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1463 transitions. Word has length 61 [2025-03-16 15:20:25,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:25,082 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1463 transitions. [2025-03-16 15:20:25,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 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-16 15:20:25,083 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1463 transitions. [2025-03-16 15:20:25,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-16 15:20:25,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:25,087 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:20:25,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:20:25,088 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:25,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:25,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1071162749, now seen corresponding path program 1 times [2025-03-16 15:20:25,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:25,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116911311] [2025-03-16 15:20:25,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:25,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:25,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-16 15:20:25,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-16 15:20:25,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:25,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:25,393 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:20:25,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:25,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116911311] [2025-03-16 15:20:25,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116911311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:25,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:25,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:20:25,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180164105] [2025-03-16 15:20:25,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:25,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:20:25,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:25,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:20:25,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:25,396 INFO L87 Difference]: Start difference. First operand 971 states and 1463 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-16 15:20:27,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:27,308 INFO L93 Difference]: Finished difference Result 2813 states and 4241 transitions. [2025-03-16 15:20:27,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:27,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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 131 [2025-03-16 15:20:27,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:27,317 INFO L225 Difference]: With dead ends: 2813 [2025-03-16 15:20:27,319 INFO L226 Difference]: Without dead ends: 1843 [2025-03-16 15:20:27,320 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-16 15:20:27,322 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 429 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:27,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 919 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 15:20:27,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2025-03-16 15:20:27,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1841. [2025-03-16 15:20:27,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.3603260869565217) internal successors, (2503), 1840 states have internal predecessors, (2503), 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-16 15:20:27,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2503 transitions. [2025-03-16 15:20:27,361 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2503 transitions. Word has length 131 [2025-03-16 15:20:27,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:27,361 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2503 transitions. [2025-03-16 15:20:27,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-16 15:20:27,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2503 transitions. [2025-03-16 15:20:27,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-16 15:20:27,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:27,363 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:20:27,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:20:27,364 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:27,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:27,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1463213944, now seen corresponding path program 1 times [2025-03-16 15:20:27,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:27,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098180745] [2025-03-16 15:20:27,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:27,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:27,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-16 15:20:27,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-16 15:20:27,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:27,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:27,566 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:20:27,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:27,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098180745] [2025-03-16 15:20:27,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098180745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:27,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:27,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:20:27,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443209800] [2025-03-16 15:20:27,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:27,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:20:27,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:27,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:20:27,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:27,568 INFO L87 Difference]: Start difference. First operand 1841 states and 2503 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 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-16 15:20:29,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:29,120 INFO L93 Difference]: Finished difference Result 5394 states and 7325 transitions. [2025-03-16 15:20:29,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:29,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 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 153 [2025-03-16 15:20:29,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:29,128 INFO L225 Difference]: With dead ends: 5394 [2025-03-16 15:20:29,128 INFO L226 Difference]: Without dead ends: 2700 [2025-03-16 15:20:29,130 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-16 15:20:29,131 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 368 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:29,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 589 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:20:29,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2025-03-16 15:20:29,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2700. [2025-03-16 15:20:29,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 2699 states have (on average 1.1919229344201556) internal successors, (3217), 2699 states have internal predecessors, (3217), 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-16 15:20:29,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 3217 transitions. [2025-03-16 15:20:29,162 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 3217 transitions. Word has length 153 [2025-03-16 15:20:29,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:29,163 INFO L471 AbstractCegarLoop]: Abstraction has 2700 states and 3217 transitions. [2025-03-16 15:20:29,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 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-16 15:20:29,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 3217 transitions. [2025-03-16 15:20:29,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-16 15:20:29,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:29,165 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:20:29,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:20:29,165 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:29,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:29,166 INFO L85 PathProgramCache]: Analyzing trace with hash 124820866, now seen corresponding path program 1 times [2025-03-16 15:20:29,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:29,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906550624] [2025-03-16 15:20:29,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:29,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:29,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-16 15:20:29,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-16 15:20:29,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:29,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:29,384 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:20:29,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:29,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906550624] [2025-03-16 15:20:29,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906550624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:29,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:29,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:20:29,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552094288] [2025-03-16 15:20:29,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:29,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:20:29,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:29,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:20:29,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:29,386 INFO L87 Difference]: Start difference. First operand 2700 states and 3217 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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-16 15:20:30,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:30,628 INFO L93 Difference]: Finished difference Result 7107 states and 8597 transitions. [2025-03-16 15:20:30,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:30,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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 213 [2025-03-16 15:20:30,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:30,639 INFO L225 Difference]: With dead ends: 7107 [2025-03-16 15:20:30,639 INFO L226 Difference]: Without dead ends: 4408 [2025-03-16 15:20:30,641 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-16 15:20:30,642 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 496 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:30,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 782 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:20:30,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4408 states. [2025-03-16 15:20:30,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4408 to 4408. [2025-03-16 15:20:30,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4408 states, 4407 states have (on average 1.1706376219650556) internal successors, (5159), 4407 states have internal predecessors, (5159), 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-16 15:20:30,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4408 states to 4408 states and 5159 transitions. [2025-03-16 15:20:30,693 INFO L78 Accepts]: Start accepts. Automaton has 4408 states and 5159 transitions. Word has length 213 [2025-03-16 15:20:30,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:30,694 INFO L471 AbstractCegarLoop]: Abstraction has 4408 states and 5159 transitions. [2025-03-16 15:20:30,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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-16 15:20:30,694 INFO L276 IsEmpty]: Start isEmpty. Operand 4408 states and 5159 transitions. [2025-03-16 15:20:30,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-16 15:20:30,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:30,696 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:20:30,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:20:30,696 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:30,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:30,697 INFO L85 PathProgramCache]: Analyzing trace with hash 266558877, now seen corresponding path program 1 times [2025-03-16 15:20:30,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:30,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681521030] [2025-03-16 15:20:30,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:30,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:30,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-16 15:20:30,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-16 15:20:30,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:30,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:30,805 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-16 15:20:30,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:30,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681521030] [2025-03-16 15:20:30,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681521030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:30,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:30,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:20:30,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703948531] [2025-03-16 15:20:30,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:30,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:20:30,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:30,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:20:30,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:30,807 INFO L87 Difference]: Start difference. First operand 4408 states and 5159 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-16 15:20:32,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:32,149 INFO L93 Difference]: Finished difference Result 10935 states and 12969 transitions. [2025-03-16 15:20:32,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:32,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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 215 [2025-03-16 15:20:32,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:32,165 INFO L225 Difference]: With dead ends: 10935 [2025-03-16 15:20:32,165 INFO L226 Difference]: Without dead ends: 6527 [2025-03-16 15:20:32,170 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-16 15:20:32,171 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 388 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:32,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 444 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:20:32,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6527 states. [2025-03-16 15:20:32,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6527 to 4381. [2025-03-16 15:20:32,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4381 states, 4380 states have (on average 1.1684931506849314) internal successors, (5118), 4380 states have internal predecessors, (5118), 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-16 15:20:32,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4381 states to 4381 states and 5118 transitions. [2025-03-16 15:20:32,228 INFO L78 Accepts]: Start accepts. Automaton has 4381 states and 5118 transitions. Word has length 215 [2025-03-16 15:20:32,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:32,228 INFO L471 AbstractCegarLoop]: Abstraction has 4381 states and 5118 transitions. [2025-03-16 15:20:32,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-16 15:20:32,228 INFO L276 IsEmpty]: Start isEmpty. Operand 4381 states and 5118 transitions. [2025-03-16 15:20:32,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-03-16 15:20:32,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:32,231 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-16 15:20:32,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:20:32,231 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:32,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:32,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1554659301, now seen corresponding path program 1 times [2025-03-16 15:20:32,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:32,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244896235] [2025-03-16 15:20:32,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:32,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:32,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-16 15:20:32,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-16 15:20:32,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:32,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:32,486 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:20:32,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:32,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244896235] [2025-03-16 15:20:32,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244896235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:32,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:32,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:20:32,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722014675] [2025-03-16 15:20:32,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:32,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:20:32,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:32,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:20:32,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:32,487 INFO L87 Difference]: Start difference. First operand 4381 states and 5118 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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-16 15:20:33,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:33,850 INFO L93 Difference]: Finished difference Result 10044 states and 11705 transitions. [2025-03-16 15:20:33,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:33,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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 281 [2025-03-16 15:20:33,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:33,869 INFO L225 Difference]: With dead ends: 10044 [2025-03-16 15:20:33,869 INFO L226 Difference]: Without dead ends: 5664 [2025-03-16 15:20:33,873 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-16 15:20:33,874 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 374 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:33,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 892 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:20:33,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5664 states. [2025-03-16 15:20:33,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5664 to 5233. [2025-03-16 15:20:33,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5233 states, 5232 states have (on average 1.1588302752293578) internal successors, (6063), 5232 states have internal predecessors, (6063), 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-16 15:20:33,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5233 states to 5233 states and 6063 transitions. [2025-03-16 15:20:33,966 INFO L78 Accepts]: Start accepts. Automaton has 5233 states and 6063 transitions. Word has length 281 [2025-03-16 15:20:33,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:33,966 INFO L471 AbstractCegarLoop]: Abstraction has 5233 states and 6063 transitions. [2025-03-16 15:20:33,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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-16 15:20:33,967 INFO L276 IsEmpty]: Start isEmpty. Operand 5233 states and 6063 transitions. [2025-03-16 15:20:33,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-16 15:20:33,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:33,971 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, 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] [2025-03-16 15:20:33,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:20:33,972 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:33,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:33,972 INFO L85 PathProgramCache]: Analyzing trace with hash 814069186, now seen corresponding path program 1 times [2025-03-16 15:20:33,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:33,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278991761] [2025-03-16 15:20:33,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:33,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:34,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-16 15:20:34,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-16 15:20:34,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:34,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:34,254 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-03-16 15:20:34,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:34,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278991761] [2025-03-16 15:20:34,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278991761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:34,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:34,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:20:34,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271830722] [2025-03-16 15:20:34,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:34,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:20:34,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:34,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:20:34,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:34,256 INFO L87 Difference]: Start difference. First operand 5233 states and 6063 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-16 15:20:35,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:35,551 INFO L93 Difference]: Finished difference Result 12592 states and 14782 transitions. [2025-03-16 15:20:35,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:35,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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 293 [2025-03-16 15:20:35,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:35,567 INFO L225 Difference]: With dead ends: 12592 [2025-03-16 15:20:35,567 INFO L226 Difference]: Without dead ends: 6935 [2025-03-16 15:20:35,572 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-16 15:20:35,572 INFO L435 NwaCegarLoop]: 777 mSDtfsCounter, 383 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:35,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 845 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:20:35,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6935 states. [2025-03-16 15:20:35,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6935 to 6935. [2025-03-16 15:20:35,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6935 states, 6934 states have (on average 1.1322468993366022) internal successors, (7851), 6934 states have internal predecessors, (7851), 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-16 15:20:35,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6935 states to 6935 states and 7851 transitions. [2025-03-16 15:20:35,649 INFO L78 Accepts]: Start accepts. Automaton has 6935 states and 7851 transitions. Word has length 293 [2025-03-16 15:20:35,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:35,650 INFO L471 AbstractCegarLoop]: Abstraction has 6935 states and 7851 transitions. [2025-03-16 15:20:35,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-16 15:20:35,650 INFO L276 IsEmpty]: Start isEmpty. Operand 6935 states and 7851 transitions. [2025-03-16 15:20:35,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-16 15:20:35,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:35,656 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, 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, 1, 1, 1, 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-16 15:20:35,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:20:35,656 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:35,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:35,658 INFO L85 PathProgramCache]: Analyzing trace with hash 315061409, now seen corresponding path program 1 times [2025-03-16 15:20:35,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:35,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432137989] [2025-03-16 15:20:35,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:35,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:35,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-16 15:20:35,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-16 15:20:35,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:35,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:35,862 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-16 15:20:35,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:35,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432137989] [2025-03-16 15:20:35,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432137989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:35,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:35,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:20:35,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771737405] [2025-03-16 15:20:35,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:35,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:20:35,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:35,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:20:35,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:35,864 INFO L87 Difference]: Start difference. First operand 6935 states and 7851 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-16 15:20:37,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:37,161 INFO L93 Difference]: Finished difference Result 17278 states and 19682 transitions. [2025-03-16 15:20:37,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:37,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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 333 [2025-03-16 15:20:37,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:37,178 INFO L225 Difference]: With dead ends: 17278 [2025-03-16 15:20:37,178 INFO L226 Difference]: Without dead ends: 9467 [2025-03-16 15:20:37,184 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-16 15:20:37,185 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 483 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:37,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 638 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:20:37,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9467 states. [2025-03-16 15:20:37,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9467 to 9037. [2025-03-16 15:20:37,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9037 states, 9036 states have (on average 1.1249446657813191) internal successors, (10165), 9036 states have internal predecessors, (10165), 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-16 15:20:37,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9037 states to 9037 states and 10165 transitions. [2025-03-16 15:20:37,341 INFO L78 Accepts]: Start accepts. Automaton has 9037 states and 10165 transitions. Word has length 333 [2025-03-16 15:20:37,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:37,341 INFO L471 AbstractCegarLoop]: Abstraction has 9037 states and 10165 transitions. [2025-03-16 15:20:37,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-16 15:20:37,342 INFO L276 IsEmpty]: Start isEmpty. Operand 9037 states and 10165 transitions. [2025-03-16 15:20:37,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2025-03-16 15:20:37,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:37,370 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:20:37,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:20:37,370 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:37,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:37,380 INFO L85 PathProgramCache]: Analyzing trace with hash 984210390, now seen corresponding path program 1 times [2025-03-16 15:20:37,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:37,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921991567] [2025-03-16 15:20:37,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:37,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:37,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 400 statements into 1 equivalence classes. [2025-03-16 15:20:37,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 400 of 400 statements. [2025-03-16 15:20:37,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:37,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:37,685 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:20:37,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:37,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921991567] [2025-03-16 15:20:37,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921991567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:37,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:37,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:20:37,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706905264] [2025-03-16 15:20:37,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:37,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:20:37,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:37,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:20:37,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:20:37,689 INFO L87 Difference]: Start difference. First operand 9037 states and 10165 transitions. Second operand has 4 states, 4 states have (on average 100.0) internal successors, (400), 3 states have internal predecessors, (400), 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-16 15:20:39,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:39,389 INFO L93 Difference]: Finished difference Result 23200 states and 26056 transitions. [2025-03-16 15:20:39,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:20:39,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.0) internal successors, (400), 3 states have internal predecessors, (400), 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 400 [2025-03-16 15:20:39,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:39,413 INFO L225 Difference]: With dead ends: 23200 [2025-03-16 15:20:39,413 INFO L226 Difference]: Without dead ends: 13739 [2025-03-16 15:20:39,421 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-16 15:20:39,422 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 589 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2242 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 2499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 2242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:39,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 168 Invalid, 2499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 2242 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 15:20:39,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13739 states. [2025-03-16 15:20:39,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13739 to 13736. [2025-03-16 15:20:39,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13736 states, 13735 states have (on average 1.1253003276301419) internal successors, (15456), 13735 states have internal predecessors, (15456), 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-16 15:20:39,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13736 states to 13736 states and 15456 transitions. [2025-03-16 15:20:39,592 INFO L78 Accepts]: Start accepts. Automaton has 13736 states and 15456 transitions. Word has length 400 [2025-03-16 15:20:39,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:39,593 INFO L471 AbstractCegarLoop]: Abstraction has 13736 states and 15456 transitions. [2025-03-16 15:20:39,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.0) internal successors, (400), 3 states have internal predecessors, (400), 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-16 15:20:39,593 INFO L276 IsEmpty]: Start isEmpty. Operand 13736 states and 15456 transitions. [2025-03-16 15:20:39,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-03-16 15:20:39,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:39,602 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:20:39,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:20:39,602 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:39,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:39,603 INFO L85 PathProgramCache]: Analyzing trace with hash -741563245, now seen corresponding path program 1 times [2025-03-16 15:20:39,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:39,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456617936] [2025-03-16 15:20:39,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:39,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:39,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-16 15:20:39,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-16 15:20:39,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:39,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:39,922 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-16 15:20:39,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:39,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456617936] [2025-03-16 15:20:39,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456617936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:39,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:39,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:20:39,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185564684] [2025-03-16 15:20:39,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:39,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:20:39,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:39,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:20:39,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:39,924 INFO L87 Difference]: Start difference. First operand 13736 states and 15456 transitions. Second operand has 3 states, 3 states have (on average 73.0) 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-16 15:20:41,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:41,144 INFO L93 Difference]: Finished difference Result 35575 states and 39969 transitions. [2025-03-16 15:20:41,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:41,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) 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 404 [2025-03-16 15:20:41,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:41,174 INFO L225 Difference]: With dead ends: 35575 [2025-03-16 15:20:41,174 INFO L226 Difference]: Without dead ends: 21840 [2025-03-16 15:20:41,187 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-16 15:20:41,188 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 401 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:41,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 771 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:20:41,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21840 states. [2025-03-16 15:20:41,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21840 to 20546. [2025-03-16 15:20:41,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20546 states, 20545 states have (on average 1.1165733755171574) internal successors, (22940), 20545 states have internal predecessors, (22940), 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-16 15:20:41,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20546 states to 20546 states and 22940 transitions. [2025-03-16 15:20:41,492 INFO L78 Accepts]: Start accepts. Automaton has 20546 states and 22940 transitions. Word has length 404 [2025-03-16 15:20:41,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:41,494 INFO L471 AbstractCegarLoop]: Abstraction has 20546 states and 22940 transitions. [2025-03-16 15:20:41,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) 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-16 15:20:41,494 INFO L276 IsEmpty]: Start isEmpty. Operand 20546 states and 22940 transitions. [2025-03-16 15:20:41,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2025-03-16 15:20:41,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:41,513 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:20:41,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:20:41,513 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:41,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:41,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1777939546, now seen corresponding path program 1 times [2025-03-16 15:20:41,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:41,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922025520] [2025-03-16 15:20:41,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:41,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:41,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 684 statements into 1 equivalence classes. [2025-03-16 15:20:41,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 684 of 684 statements. [2025-03-16 15:20:41,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:41,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:41,739 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-03-16 15:20:41,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:41,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922025520] [2025-03-16 15:20:41,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922025520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:41,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:41,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:20:41,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846247009] [2025-03-16 15:20:41,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:41,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:20:41,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:41,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:20:41,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:41,742 INFO L87 Difference]: Start difference. First operand 20546 states and 22940 transitions. Second operand has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 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-16 15:20:43,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:43,090 INFO L93 Difference]: Finished difference Result 50885 states and 56860 transitions. [2025-03-16 15:20:43,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:43,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 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 684 [2025-03-16 15:20:43,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:43,124 INFO L225 Difference]: With dead ends: 50885 [2025-03-16 15:20:43,124 INFO L226 Difference]: Without dead ends: 30340 [2025-03-16 15:20:43,140 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-16 15:20:43,141 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 483 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:43,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 244 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:20:43,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30340 states. [2025-03-16 15:20:43,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30340 to 30327. [2025-03-16 15:20:43,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30327 states, 30326 states have (on average 1.1102684165402625) internal successors, (33670), 30326 states have internal predecessors, (33670), 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-16 15:20:43,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30327 states to 30327 states and 33670 transitions. [2025-03-16 15:20:43,470 INFO L78 Accepts]: Start accepts. Automaton has 30327 states and 33670 transitions. Word has length 684 [2025-03-16 15:20:43,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:43,470 INFO L471 AbstractCegarLoop]: Abstraction has 30327 states and 33670 transitions. [2025-03-16 15:20:43,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 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-16 15:20:43,471 INFO L276 IsEmpty]: Start isEmpty. Operand 30327 states and 33670 transitions. [2025-03-16 15:20:43,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 797 [2025-03-16 15:20:43,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:43,495 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 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-16 15:20:43,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:20:43,495 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:43,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:43,496 INFO L85 PathProgramCache]: Analyzing trace with hash 691658205, now seen corresponding path program 1 times [2025-03-16 15:20:43,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:43,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473464860] [2025-03-16 15:20:43,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:43,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:43,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 796 statements into 1 equivalence classes. [2025-03-16 15:20:43,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 796 of 796 statements. [2025-03-16 15:20:43,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:43,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:43,869 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-03-16 15:20:43,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:43,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473464860] [2025-03-16 15:20:43,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473464860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:43,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:43,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:20:43,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312015825] [2025-03-16 15:20:43,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:43,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:20:43,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:43,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:20:43,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:43,872 INFO L87 Difference]: Start difference. First operand 30327 states and 33670 transitions. Second operand has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 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-16 15:20:45,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:45,185 INFO L93 Difference]: Finished difference Result 67459 states and 75186 transitions. [2025-03-16 15:20:45,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:45,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 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 796 [2025-03-16 15:20:45,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:45,225 INFO L225 Difference]: With dead ends: 67459 [2025-03-16 15:20:45,225 INFO L226 Difference]: Without dead ends: 37133 [2025-03-16 15:20:45,236 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-16 15:20:45,237 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 483 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:45,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 700 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:20:45,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37133 states. [2025-03-16 15:20:45,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37133 to 37129. [2025-03-16 15:20:45,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37129 states, 37128 states have (on average 1.1063617754794226) internal successors, (41077), 37128 states have internal predecessors, (41077), 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-16 15:20:45,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37129 states to 37129 states and 41077 transitions. [2025-03-16 15:20:45,547 INFO L78 Accepts]: Start accepts. Automaton has 37129 states and 41077 transitions. Word has length 796 [2025-03-16 15:20:45,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:45,548 INFO L471 AbstractCegarLoop]: Abstraction has 37129 states and 41077 transitions. [2025-03-16 15:20:45,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 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-16 15:20:45,548 INFO L276 IsEmpty]: Start isEmpty. Operand 37129 states and 41077 transitions. [2025-03-16 15:20:45,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 840 [2025-03-16 15:20:45,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:45,642 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, 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, 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, 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] [2025-03-16 15:20:45,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:20:45,642 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:45,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:45,643 INFO L85 PathProgramCache]: Analyzing trace with hash -2140778253, now seen corresponding path program 1 times [2025-03-16 15:20:45,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:45,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058362335] [2025-03-16 15:20:45,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:45,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:45,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 839 statements into 1 equivalence classes. [2025-03-16 15:20:45,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 839 of 839 statements. [2025-03-16 15:20:45,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:45,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:46,748 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 516 proven. 61 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:20:46,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:46,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058362335] [2025-03-16 15:20:46,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058362335] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:20:46,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170439324] [2025-03-16 15:20:46,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:46,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:20:46,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:20:46,752 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-16 15:20:46,754 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-16 15:20:46,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 839 statements into 1 equivalence classes. [2025-03-16 15:20:46,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 839 of 839 statements. [2025-03-16 15:20:46,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:46,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:46,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 976 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:20:47,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:20:47,472 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 516 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-03-16 15:20:47,472 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:20:47,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170439324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:47,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:20:47,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-16 15:20:47,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386698030] [2025-03-16 15:20:47,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:47,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:20:47,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:47,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:20:47,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:20:47,475 INFO L87 Difference]: Start difference. First operand 37129 states and 41077 transitions. Second operand has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 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-16 15:20:48,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:48,650 INFO L93 Difference]: Finished difference Result 74255 states and 82151 transitions. [2025-03-16 15:20:48,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:48,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 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 839 [2025-03-16 15:20:48,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:48,693 INFO L225 Difference]: With dead ends: 74255 [2025-03-16 15:20:48,693 INFO L226 Difference]: Without dead ends: 37127 [2025-03-16 15:20:48,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 845 GetRequests, 839 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:20:48,721 INFO L435 NwaCegarLoop]: 635 mSDtfsCounter, 116 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:48,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 691 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:20:48,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37127 states. [2025-03-16 15:20:49,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37127 to 36702. [2025-03-16 15:20:49,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36702 states, 36701 states have (on average 1.082177597340672) internal successors, (39717), 36701 states have internal predecessors, (39717), 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-16 15:20:49,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36702 states to 36702 states and 39717 transitions. [2025-03-16 15:20:49,202 INFO L78 Accepts]: Start accepts. Automaton has 36702 states and 39717 transitions. Word has length 839 [2025-03-16 15:20:49,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:49,203 INFO L471 AbstractCegarLoop]: Abstraction has 36702 states and 39717 transitions. [2025-03-16 15:20:49,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 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-16 15:20:49,203 INFO L276 IsEmpty]: Start isEmpty. Operand 36702 states and 39717 transitions. [2025-03-16 15:20:49,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2025-03-16 15:20:49,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:49,239 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:20:49,245 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-16 15:20:49,439 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,SelfDestructingSolverStorable13 [2025-03-16 15:20:49,439 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:49,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:49,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1927377917, now seen corresponding path program 1 times [2025-03-16 15:20:49,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:49,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003807469] [2025-03-16 15:20:49,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:49,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:49,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 842 statements into 1 equivalence classes. [2025-03-16 15:20:49,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 842 of 842 statements. [2025-03-16 15:20:49,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:49,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:49,742 INFO L134 CoverageAnalysis]: Checked inductivity of 935 backedges. 606 proven. 0 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2025-03-16 15:20:49,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:49,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003807469] [2025-03-16 15:20:49,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003807469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:49,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:49,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:20:49,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959211958] [2025-03-16 15:20:49,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:49,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:20:49,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:49,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:20:49,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:49,745 INFO L87 Difference]: Start difference. First operand 36702 states and 39717 transitions. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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-16 15:20:50,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:50,959 INFO L93 Difference]: Finished difference Result 80207 states and 86921 transitions. [2025-03-16 15:20:50,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:50,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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 842 [2025-03-16 15:20:50,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:51,002 INFO L225 Difference]: With dead ends: 80207 [2025-03-16 15:20:51,002 INFO L226 Difference]: Without dead ends: 43506 [2025-03-16 15:20:51,024 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-16 15:20:51,025 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 456 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:51,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 340 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:20:51,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43506 states. [2025-03-16 15:20:51,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43506 to 40527. [2025-03-16 15:20:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40527 states, 40526 states have (on average 1.0774317721956275) internal successors, (43664), 40526 states have internal predecessors, (43664), 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-16 15:20:51,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40527 states to 40527 states and 43664 transitions. [2025-03-16 15:20:51,418 INFO L78 Accepts]: Start accepts. Automaton has 40527 states and 43664 transitions. Word has length 842 [2025-03-16 15:20:51,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:51,418 INFO L471 AbstractCegarLoop]: Abstraction has 40527 states and 43664 transitions. [2025-03-16 15:20:51,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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-16 15:20:51,419 INFO L276 IsEmpty]: Start isEmpty. Operand 40527 states and 43664 transitions. [2025-03-16 15:20:51,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 869 [2025-03-16 15:20:51,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:51,445 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:20:51,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:20:51,445 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:51,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:51,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1702220388, now seen corresponding path program 1 times [2025-03-16 15:20:51,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:51,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137792665] [2025-03-16 15:20:51,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:51,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:51,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 868 statements into 1 equivalence classes. [2025-03-16 15:20:51,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 868 of 868 statements. [2025-03-16 15:20:51,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:51,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:51,971 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2025-03-16 15:20:51,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:51,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137792665] [2025-03-16 15:20:51,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137792665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:51,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:51,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:20:51,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166129096] [2025-03-16 15:20:51,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:51,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:20:51,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:51,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:20:51,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:51,973 INFO L87 Difference]: Start difference. First operand 40527 states and 43664 transitions. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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-16 15:20:53,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:53,170 INFO L93 Difference]: Finished difference Result 86595 states and 93459 transitions. [2025-03-16 15:20:53,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:53,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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 868 [2025-03-16 15:20:53,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:53,214 INFO L225 Difference]: With dead ends: 86595 [2025-03-16 15:20:53,214 INFO L226 Difference]: Without dead ends: 45644 [2025-03-16 15:20:53,237 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-16 15:20:53,238 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 405 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:53,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 759 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:20:53,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45644 states. [2025-03-16 15:20:53,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45644 to 45211. [2025-03-16 15:20:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45211 states, 45210 states have (on average 1.0744304357443044) internal successors, (48575), 45210 states have internal predecessors, (48575), 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-16 15:20:53,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45211 states to 45211 states and 48575 transitions. [2025-03-16 15:20:53,670 INFO L78 Accepts]: Start accepts. Automaton has 45211 states and 48575 transitions. Word has length 868 [2025-03-16 15:20:53,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:53,671 INFO L471 AbstractCegarLoop]: Abstraction has 45211 states and 48575 transitions. [2025-03-16 15:20:53,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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-16 15:20:53,671 INFO L276 IsEmpty]: Start isEmpty. Operand 45211 states and 48575 transitions. [2025-03-16 15:20:53,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 872 [2025-03-16 15:20:53,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:53,698 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:20:53,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:20:53,698 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:53,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:53,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1046682490, now seen corresponding path program 1 times [2025-03-16 15:20:53,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:53,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798750635] [2025-03-16 15:20:53,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:53,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:53,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 871 statements into 1 equivalence classes. [2025-03-16 15:20:53,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 871 of 871 statements. [2025-03-16 15:20:53,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:53,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:54,615 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 567 proven. 243 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-16 15:20:54,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:54,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798750635] [2025-03-16 15:20:54,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798750635] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:20:54,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439309843] [2025-03-16 15:20:54,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:54,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:20:54,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:20:54,618 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-16 15:20:54,619 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-16 15:20:54,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 871 statements into 1 equivalence classes. [2025-03-16 15:20:54,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 871 of 871 statements. [2025-03-16 15:20:54,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:54,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:54,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:20:54,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:20:55,466 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 567 proven. 243 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-16 15:20:55,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:20:57,039 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 567 proven. 243 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-16 15:20:57,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439309843] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:20:57,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:20:57,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-16 15:20:57,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483814137] [2025-03-16 15:20:57,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:20:57,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 15:20:57,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:57,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 15:20:57,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:20:57,043 INFO L87 Difference]: Start difference. First operand 45211 states and 48575 transitions. Second operand has 6 states, 6 states have (on average 239.5) internal successors, (1437), 6 states have internal predecessors, (1437), 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-16 15:20:59,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:59,611 INFO L93 Difference]: Finished difference Result 97647 states and 105119 transitions. [2025-03-16 15:20:59,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:20:59,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 239.5) internal successors, (1437), 6 states have internal predecessors, (1437), 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 871 [2025-03-16 15:20:59,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:59,669 INFO L225 Difference]: With dead ends: 97647 [2025-03-16 15:20:59,670 INFO L226 Difference]: Without dead ends: 52012 [2025-03-16 15:20:59,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1744 GetRequests, 1739 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:20:59,699 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 633 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 3898 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 4125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 3898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:59,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 798 Invalid, 4125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 3898 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 15:20:59,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52012 states. [2025-03-16 15:21:00,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52012 to 45617. [2025-03-16 15:21:00,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45617 states, 45616 states have (on average 1.0706111890564713) internal successors, (48837), 45616 states have internal predecessors, (48837), 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-16 15:21:00,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45617 states to 45617 states and 48837 transitions. [2025-03-16 15:21:00,145 INFO L78 Accepts]: Start accepts. Automaton has 45617 states and 48837 transitions. Word has length 871 [2025-03-16 15:21:00,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:00,146 INFO L471 AbstractCegarLoop]: Abstraction has 45617 states and 48837 transitions. [2025-03-16 15:21:00,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.5) internal successors, (1437), 6 states have internal predecessors, (1437), 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-16 15:21:00,146 INFO L276 IsEmpty]: Start isEmpty. Operand 45617 states and 48837 transitions. [2025-03-16 15:21:00,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 927 [2025-03-16 15:21:00,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:00,176 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 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] [2025-03-16 15:21:00,182 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-16 15:21:00,376 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,SelfDestructingSolverStorable16 [2025-03-16 15:21:00,376 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:00,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:00,377 INFO L85 PathProgramCache]: Analyzing trace with hash 522789561, now seen corresponding path program 1 times [2025-03-16 15:21:00,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:00,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282984531] [2025-03-16 15:21:00,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:00,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:00,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 926 statements into 1 equivalence classes. [2025-03-16 15:21:00,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 926 of 926 statements. [2025-03-16 15:21:00,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:00,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1439 backedges. 1110 proven. 0 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2025-03-16 15:21:00,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:00,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282984531] [2025-03-16 15:21:00,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282984531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:00,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:00,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:21:00,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344538443] [2025-03-16 15:21:00,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:00,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:21:00,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:00,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:21:00,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:21:00,867 INFO L87 Difference]: Start difference. First operand 45617 states and 48837 transitions. Second operand has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 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-16 15:21:02,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:02,046 INFO L93 Difference]: Finished difference Result 99330 states and 106680 transitions. [2025-03-16 15:21:02,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:21:02,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 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 926 [2025-03-16 15:21:02,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:02,105 INFO L225 Difference]: With dead ends: 99330 [2025-03-16 15:21:02,105 INFO L226 Difference]: Without dead ends: 53289 [2025-03-16 15:21:02,137 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-16 15:21:02,137 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 194 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:02,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 612 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:21:02,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53289 states. [2025-03-16 15:21:02,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53289 to 52855. [2025-03-16 15:21:02,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52855 states, 52854 states have (on average 1.0741665720664473) internal successors, (56774), 52854 states have internal predecessors, (56774), 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-16 15:21:02,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52855 states to 52855 states and 56774 transitions. [2025-03-16 15:21:02,633 INFO L78 Accepts]: Start accepts. Automaton has 52855 states and 56774 transitions. Word has length 926 [2025-03-16 15:21:02,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:02,633 INFO L471 AbstractCegarLoop]: Abstraction has 52855 states and 56774 transitions. [2025-03-16 15:21:02,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 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-16 15:21:02,634 INFO L276 IsEmpty]: Start isEmpty. Operand 52855 states and 56774 transitions. [2025-03-16 15:21:02,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 937 [2025-03-16 15:21:02,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:02,666 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 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] [2025-03-16 15:21:02,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:21:02,667 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:02,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:02,667 INFO L85 PathProgramCache]: Analyzing trace with hash 417346131, now seen corresponding path program 1 times [2025-03-16 15:21:02,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:02,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738917561] [2025-03-16 15:21:02,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:02,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:02,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 936 statements into 1 equivalence classes. [2025-03-16 15:21:02,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 936 of 936 statements. [2025-03-16 15:21:02,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:02,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:03,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1087 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 847 trivial. 0 not checked. [2025-03-16 15:21:03,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:03,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738917561] [2025-03-16 15:21:03,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738917561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:03,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:03,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:21:03,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118186304] [2025-03-16 15:21:03,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:03,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:21:03,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:03,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:21:03,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:21:03,110 INFO L87 Difference]: Start difference. First operand 52855 states and 56774 transitions. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 2 states have internal predecessors, (399), 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-16 15:21:03,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:03,752 INFO L93 Difference]: Finished difference Result 100157 states and 107554 transitions. [2025-03-16 15:21:03,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:21:03,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 2 states have internal predecessors, (399), 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 936 [2025-03-16 15:21:03,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:03,797 INFO L225 Difference]: With dead ends: 100157 [2025-03-16 15:21:03,797 INFO L226 Difference]: Without dead ends: 47302 [2025-03-16 15:21:03,824 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-16 15:21:03,824 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 350 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:03,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 70 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:21:03,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47302 states. [2025-03-16 15:21:04,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47302 to 47293. [2025-03-16 15:21:04,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47293 states, 47292 states have (on average 1.0731201894612197) internal successors, (50750), 47292 states have internal predecessors, (50750), 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-16 15:21:04,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47293 states to 47293 states and 50750 transitions. [2025-03-16 15:21:04,210 INFO L78 Accepts]: Start accepts. Automaton has 47293 states and 50750 transitions. Word has length 936 [2025-03-16 15:21:04,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:04,211 INFO L471 AbstractCegarLoop]: Abstraction has 47293 states and 50750 transitions. [2025-03-16 15:21:04,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 2 states have internal predecessors, (399), 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-16 15:21:04,211 INFO L276 IsEmpty]: Start isEmpty. Operand 47293 states and 50750 transitions. [2025-03-16 15:21:04,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 948 [2025-03-16 15:21:04,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:04,243 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 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] [2025-03-16 15:21:04,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:21:04,243 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:04,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:04,244 INFO L85 PathProgramCache]: Analyzing trace with hash -2067770999, now seen corresponding path program 1 times [2025-03-16 15:21:04,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:04,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266825640] [2025-03-16 15:21:04,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:04,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:04,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 947 statements into 1 equivalence classes. [2025-03-16 15:21:04,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 947 of 947 statements. [2025-03-16 15:21:04,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:04,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1469 backedges. 1130 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-03-16 15:21:04,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:04,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266825640] [2025-03-16 15:21:04,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266825640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:04,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:04,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:21:04,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141217292] [2025-03-16 15:21:04,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:04,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:21:04,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:04,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:21:04,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:21:04,899 INFO L87 Difference]: Start difference. First operand 47293 states and 50750 transitions. Second operand has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 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-16 15:21:06,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:06,320 INFO L93 Difference]: Finished difference Result 105661 states and 113598 transitions. [2025-03-16 15:21:06,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:21:06,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 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 947 [2025-03-16 15:21:06,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:06,383 INFO L225 Difference]: With dead ends: 105661 [2025-03-16 15:21:06,383 INFO L226 Difference]: Without dead ends: 57942 [2025-03-16 15:21:06,413 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-16 15:21:06,414 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 343 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:06,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 641 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:21:06,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57942 states. [2025-03-16 15:21:06,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57942 to 48566. [2025-03-16 15:21:06,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48566 states, 48565 states have (on average 1.072480181200453) internal successors, (52085), 48565 states have internal predecessors, (52085), 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-16 15:21:06,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48566 states to 48566 states and 52085 transitions. [2025-03-16 15:21:06,861 INFO L78 Accepts]: Start accepts. Automaton has 48566 states and 52085 transitions. Word has length 947 [2025-03-16 15:21:06,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:06,862 INFO L471 AbstractCegarLoop]: Abstraction has 48566 states and 52085 transitions. [2025-03-16 15:21:06,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 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-16 15:21:06,862 INFO L276 IsEmpty]: Start isEmpty. Operand 48566 states and 52085 transitions. [2025-03-16 15:21:06,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 983 [2025-03-16 15:21:06,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:06,894 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 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] [2025-03-16 15:21:06,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 15:21:06,894 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:06,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:06,894 INFO L85 PathProgramCache]: Analyzing trace with hash 687251067, now seen corresponding path program 1 times [2025-03-16 15:21:06,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:06,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481994539] [2025-03-16 15:21:06,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:06,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:06,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 982 statements into 1 equivalence classes. [2025-03-16 15:21:06,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 982 of 982 statements. [2025-03-16 15:21:06,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:06,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:07,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 810 proven. 82 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2025-03-16 15:21:07,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:07,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481994539] [2025-03-16 15:21:07,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481994539] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:21:07,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880273986] [2025-03-16 15:21:07,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:07,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:21:07,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:21:07,586 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-16 15:21:07,587 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-16 15:21:07,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 982 statements into 1 equivalence classes. [2025-03-16 15:21:07,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 982 of 982 statements. [2025-03-16 15:21:07,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:07,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:07,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:21:07,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:21:08,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 1427 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-03-16 15:21:08,160 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:21:08,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880273986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:08,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:21:08,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2025-03-16 15:21:08,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988769835] [2025-03-16 15:21:08,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:08,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:21:08,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:08,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:21:08,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:21:08,163 INFO L87 Difference]: Start difference. First operand 48566 states and 52085 transitions. Second operand has 4 states, 4 states have (on average 210.5) internal successors, (842), 4 states have internal predecessors, (842), 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-16 15:21:09,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:09,853 INFO L93 Difference]: Finished difference Result 113746 states and 121962 transitions. [2025-03-16 15:21:09,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:21:09,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 210.5) internal successors, (842), 4 states have internal predecessors, (842), 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 982 [2025-03-16 15:21:09,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:09,929 INFO L225 Difference]: With dead ends: 113746 [2025-03-16 15:21:09,929 INFO L226 Difference]: Without dead ends: 65181 [2025-03-16 15:21:09,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 984 GetRequests, 980 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-16 15:21:09,966 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 678 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 1669 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 2117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 1669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:09,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 142 Invalid, 2117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 1669 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:21:10,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65181 states. [2025-03-16 15:21:10,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65181 to 54084. [2025-03-16 15:21:10,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54084 states, 54083 states have (on average 1.0699480428230683) internal successors, (57866), 54083 states have internal predecessors, (57866), 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-16 15:21:10,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54084 states to 54084 states and 57866 transitions. [2025-03-16 15:21:10,749 INFO L78 Accepts]: Start accepts. Automaton has 54084 states and 57866 transitions. Word has length 982 [2025-03-16 15:21:10,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:10,753 INFO L471 AbstractCegarLoop]: Abstraction has 54084 states and 57866 transitions. [2025-03-16 15:21:10,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 210.5) internal successors, (842), 4 states have internal predecessors, (842), 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-16 15:21:10,753 INFO L276 IsEmpty]: Start isEmpty. Operand 54084 states and 57866 transitions. [2025-03-16 15:21:10,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1138 [2025-03-16 15:21:10,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:10,798 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 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-16 15:21:10,805 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-16 15:21:10,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:21:10,998 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:10,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:10,999 INFO L85 PathProgramCache]: Analyzing trace with hash -166858336, now seen corresponding path program 1 times [2025-03-16 15:21:10,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:10,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047203624] [2025-03-16 15:21:10,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:11,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:11,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1137 statements into 1 equivalence classes. [2025-03-16 15:21:11,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1137 of 1137 statements. [2025-03-16 15:21:11,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:11,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:11,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 1122 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-03-16 15:21:11,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:11,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047203624] [2025-03-16 15:21:11,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047203624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:11,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:11,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:21:11,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466190580] [2025-03-16 15:21:11,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:11,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:21:11,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:11,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:21:11,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:21:11,327 INFO L87 Difference]: Start difference. First operand 54084 states and 57866 transitions. Second operand has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 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-16 15:21:12,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:12,532 INFO L93 Difference]: Finished difference Result 107315 states and 114821 transitions. [2025-03-16 15:21:12,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:21:12,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 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 1137 [2025-03-16 15:21:12,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:12,586 INFO L225 Difference]: With dead ends: 107315 [2025-03-16 15:21:12,586 INFO L226 Difference]: Without dead ends: 53232 [2025-03-16 15:21:12,614 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-16 15:21:12,615 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 109 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:12,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 644 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:21:12,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53232 states. [2025-03-16 15:21:12,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53232 to 52806. [2025-03-16 15:21:13,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52806 states, 52805 states have (on average 1.070258498248272) internal successors, (56515), 52805 states have internal predecessors, (56515), 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-16 15:21:13,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52806 states to 52806 states and 56515 transitions. [2025-03-16 15:21:13,083 INFO L78 Accepts]: Start accepts. Automaton has 52806 states and 56515 transitions. Word has length 1137 [2025-03-16 15:21:13,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:13,084 INFO L471 AbstractCegarLoop]: Abstraction has 52806 states and 56515 transitions. [2025-03-16 15:21:13,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 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-16 15:21:13,084 INFO L276 IsEmpty]: Start isEmpty. Operand 52806 states and 56515 transitions. [2025-03-16 15:21:13,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1146 [2025-03-16 15:21:13,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:13,126 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:21:13,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 15:21:13,126 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:13,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:13,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1563400970, now seen corresponding path program 1 times [2025-03-16 15:21:13,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:13,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45877177] [2025-03-16 15:21:13,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:13,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:13,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1145 statements into 1 equivalence classes. [2025-03-16 15:21:13,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1145 of 1145 statements. [2025-03-16 15:21:13,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:13,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:13,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2323 backedges. 1536 proven. 0 refuted. 0 times theorem prover too weak. 787 trivial. 0 not checked. [2025-03-16 15:21:13,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:13,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45877177] [2025-03-16 15:21:13,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45877177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:13,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:13,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:21:13,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071239482] [2025-03-16 15:21:13,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:13,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:21:13,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:13,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:21:13,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:21:13,520 INFO L87 Difference]: Start difference. First operand 52806 states and 56515 transitions. Second operand has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 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-16 15:21:14,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:14,827 INFO L93 Difference]: Finished difference Result 107730 states and 115472 transitions. [2025-03-16 15:21:14,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:21:14,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 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 1145 [2025-03-16 15:21:14,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:14,884 INFO L225 Difference]: With dead ends: 107730 [2025-03-16 15:21:14,884 INFO L226 Difference]: Without dead ends: 54500 [2025-03-16 15:21:14,919 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-16 15:21:14,919 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 347 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:14,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 570 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:21:14,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54500 states. [2025-03-16 15:21:15,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54500 to 48123. [2025-03-16 15:21:15,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48123 states, 48122 states have (on average 1.0671834088358756) internal successors, (51355), 48122 states have internal predecessors, (51355), 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-16 15:21:15,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48123 states to 48123 states and 51355 transitions. [2025-03-16 15:21:15,512 INFO L78 Accepts]: Start accepts. Automaton has 48123 states and 51355 transitions. Word has length 1145 [2025-03-16 15:21:15,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:15,512 INFO L471 AbstractCegarLoop]: Abstraction has 48123 states and 51355 transitions. [2025-03-16 15:21:15,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 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-16 15:21:15,513 INFO L276 IsEmpty]: Start isEmpty. Operand 48123 states and 51355 transitions. [2025-03-16 15:21:15,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1189 [2025-03-16 15:21:15,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:15,567 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 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-16 15:21:15,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 15:21:15,567 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:15,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:15,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1945650082, now seen corresponding path program 1 times [2025-03-16 15:21:15,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:15,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144481797] [2025-03-16 15:21:15,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:15,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:15,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1188 statements into 1 equivalence classes. [2025-03-16 15:21:15,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1188 of 1188 statements. [2025-03-16 15:21:15,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:15,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:16,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2135 backedges. 1181 proven. 0 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2025-03-16 15:21:16,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:16,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144481797] [2025-03-16 15:21:16,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144481797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:16,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:16,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:21:16,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961582362] [2025-03-16 15:21:16,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:16,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:21:16,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:16,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:21:16,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:21:16,293 INFO L87 Difference]: Start difference. First operand 48123 states and 51355 transitions. Second operand has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 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-16 15:21:17,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:17,419 INFO L93 Difference]: Finished difference Result 103064 states and 110088 transitions. [2025-03-16 15:21:17,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:21:17,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 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 1188 [2025-03-16 15:21:17,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:17,477 INFO L225 Difference]: With dead ends: 103064 [2025-03-16 15:21:17,477 INFO L226 Difference]: Without dead ends: 54942 [2025-03-16 15:21:17,509 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-16 15:21:17,509 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 318 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:17,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 689 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:21:17,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54942 states. [2025-03-16 15:21:18,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54942 to 54505. [2025-03-16 15:21:18,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54505 states, 54504 states have (on average 1.0664354909731395) internal successors, (58125), 54504 states have internal predecessors, (58125), 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-16 15:21:18,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54505 states to 54505 states and 58125 transitions. [2025-03-16 15:21:18,148 INFO L78 Accepts]: Start accepts. Automaton has 54505 states and 58125 transitions. Word has length 1188 [2025-03-16 15:21:18,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:18,149 INFO L471 AbstractCegarLoop]: Abstraction has 54505 states and 58125 transitions. [2025-03-16 15:21:18,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 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-16 15:21:18,149 INFO L276 IsEmpty]: Start isEmpty. Operand 54505 states and 58125 transitions. [2025-03-16 15:21:18,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1190 [2025-03-16 15:21:18,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:18,194 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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-16 15:21:18,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 15:21:18,194 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:18,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:18,195 INFO L85 PathProgramCache]: Analyzing trace with hash -674240604, now seen corresponding path program 1 times [2025-03-16 15:21:18,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:18,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144182446] [2025-03-16 15:21:18,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:18,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:18,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1189 statements into 1 equivalence classes. [2025-03-16 15:21:18,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1189 of 1189 statements. [2025-03-16 15:21:18,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:18,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:18,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2177 backedges. 1214 proven. 0 refuted. 0 times theorem prover too weak. 963 trivial. 0 not checked. [2025-03-16 15:21:18,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:18,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144182446] [2025-03-16 15:21:18,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144182446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:18,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:18,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:21:18,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405488001] [2025-03-16 15:21:18,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:18,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:21:18,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:18,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:21:18,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:21:18,737 INFO L87 Difference]: Start difference. First operand 54505 states and 58125 transitions. Second operand has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 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-16 15:21:19,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:19,867 INFO L93 Difference]: Finished difference Result 104751 states and 111712 transitions. [2025-03-16 15:21:19,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:21:19,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 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 1189 [2025-03-16 15:21:19,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:19,929 INFO L225 Difference]: With dead ends: 104751 [2025-03-16 15:21:19,930 INFO L226 Difference]: Without dead ends: 57917 [2025-03-16 15:21:19,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:21:19,961 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 358 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:19,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 213 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:21:19,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57917 states. [2025-03-16 15:21:20,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57917 to 57913. [2025-03-16 15:21:20,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57913 states, 57912 states have (on average 1.0629057880922779) internal successors, (61555), 57912 states have internal predecessors, (61555), 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-16 15:21:20,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57913 states to 57913 states and 61555 transitions. [2025-03-16 15:21:20,471 INFO L78 Accepts]: Start accepts. Automaton has 57913 states and 61555 transitions. Word has length 1189 [2025-03-16 15:21:20,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:20,471 INFO L471 AbstractCegarLoop]: Abstraction has 57913 states and 61555 transitions. [2025-03-16 15:21:20,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 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-16 15:21:20,471 INFO L276 IsEmpty]: Start isEmpty. Operand 57913 states and 61555 transitions. [2025-03-16 15:21:20,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1205 [2025-03-16 15:21:20,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:20,518 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:21:20,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 15:21:20,518 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:20,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:20,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1158036973, now seen corresponding path program 1 times [2025-03-16 15:21:20,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:20,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751134076] [2025-03-16 15:21:20,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:20,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:20,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1204 statements into 1 equivalence classes. [2025-03-16 15:21:20,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1204 of 1204 statements. [2025-03-16 15:21:20,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:20,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1456 backedges. 977 proven. 0 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2025-03-16 15:21:21,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:21,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751134076] [2025-03-16 15:21:21,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751134076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:21,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:21,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:21:21,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485952080] [2025-03-16 15:21:21,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:21,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:21:21,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:21,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:21:21,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:21:21,976 INFO L87 Difference]: Start difference. First operand 57913 states and 61555 transitions. Second operand has 4 states, 4 states have (on average 202.25) internal successors, (809), 4 states have internal predecessors, (809), 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-16 15:21:23,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:23,802 INFO L93 Difference]: Finished difference Result 123483 states and 130974 transitions. [2025-03-16 15:21:23,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:21:23,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 202.25) internal successors, (809), 4 states have internal predecessors, (809), 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 1204 [2025-03-16 15:21:23,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:23,864 INFO L225 Difference]: With dead ends: 123483 [2025-03-16 15:21:23,864 INFO L226 Difference]: Without dead ends: 72816 [2025-03-16 15:21:23,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-16 15:21:23,886 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 545 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 2244 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 2460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 2244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:23,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 177 Invalid, 2460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 2244 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:21:23,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72816 states. [2025-03-16 15:21:24,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72816 to 66423. [2025-03-16 15:21:24,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66423 states, 66422 states have (on average 1.061425431332992) internal successors, (70502), 66422 states have internal predecessors, (70502), 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-16 15:21:24,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66423 states to 66423 states and 70502 transitions. [2025-03-16 15:21:24,448 INFO L78 Accepts]: Start accepts. Automaton has 66423 states and 70502 transitions. Word has length 1204 [2025-03-16 15:21:24,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:24,449 INFO L471 AbstractCegarLoop]: Abstraction has 66423 states and 70502 transitions. [2025-03-16 15:21:24,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 202.25) internal successors, (809), 4 states have internal predecessors, (809), 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-16 15:21:24,449 INFO L276 IsEmpty]: Start isEmpty. Operand 66423 states and 70502 transitions. [2025-03-16 15:21:24,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1212 [2025-03-16 15:21:24,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:24,498 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 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-16 15:21:24,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 15:21:24,498 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:24,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:24,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1095105929, now seen corresponding path program 1 times [2025-03-16 15:21:24,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:24,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41363713] [2025-03-16 15:21:24,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:24,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:24,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1211 statements into 1 equivalence classes. [2025-03-16 15:21:24,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1211 of 1211 statements. [2025-03-16 15:21:24,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:24,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1167 proven. 0 refuted. 0 times theorem prover too weak. 1077 trivial. 0 not checked. [2025-03-16 15:21:25,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:25,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41363713] [2025-03-16 15:21:25,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41363713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:25,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:25,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:21:25,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636901415] [2025-03-16 15:21:25,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:25,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:21:25,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:25,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:21:25,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:21:25,241 INFO L87 Difference]: Start difference. First operand 66423 states and 70502 transitions. Second operand has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 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-16 15:21:27,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:27,209 INFO L93 Difference]: Finished difference Result 146041 states and 154672 transitions. [2025-03-16 15:21:27,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:21:27,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 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 1211 [2025-03-16 15:21:27,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:27,309 INFO L225 Difference]: With dead ends: 146041 [2025-03-16 15:21:27,309 INFO L226 Difference]: Without dead ends: 88143 [2025-03-16 15:21:27,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-16 15:21:27,352 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 575 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 2177 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 2502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 2177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:27,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 132 Invalid, 2502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 2177 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 15:21:27,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88143 states. [2025-03-16 15:21:28,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88143 to 62578. [2025-03-16 15:21:28,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62578 states, 62577 states have (on average 1.0569058919411285) internal successors, (66138), 62577 states have internal predecessors, (66138), 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-16 15:21:28,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62578 states to 62578 states and 66138 transitions. [2025-03-16 15:21:28,247 INFO L78 Accepts]: Start accepts. Automaton has 62578 states and 66138 transitions. Word has length 1211 [2025-03-16 15:21:28,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:28,248 INFO L471 AbstractCegarLoop]: Abstraction has 62578 states and 66138 transitions. [2025-03-16 15:21:28,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 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-16 15:21:28,248 INFO L276 IsEmpty]: Start isEmpty. Operand 62578 states and 66138 transitions. [2025-03-16 15:21:28,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1469 [2025-03-16 15:21:28,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:28,298 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 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, 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, 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] [2025-03-16 15:21:28,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 15:21:28,298 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:28,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:28,299 INFO L85 PathProgramCache]: Analyzing trace with hash 877982340, now seen corresponding path program 1 times [2025-03-16 15:21:28,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:28,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656430477] [2025-03-16 15:21:28,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:28,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:28,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1468 statements into 1 equivalence classes. [2025-03-16 15:21:28,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1468 of 1468 statements. [2025-03-16 15:21:28,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:28,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:29,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2468 backedges. 1699 proven. 290 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2025-03-16 15:21:29,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:29,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656430477] [2025-03-16 15:21:29,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656430477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:21:29,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108095623] [2025-03-16 15:21:29,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:29,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:21:29,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:21:29,528 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-16 15:21:29,529 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-16 15:21:29,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1468 statements into 1 equivalence classes. [2025-03-16 15:21:29,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1468 of 1468 statements. [2025-03-16 15:21:29,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:29,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:29,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 1665 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 15:21:29,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:21:30,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2468 backedges. 1284 proven. 82 refuted. 0 times theorem prover too weak. 1102 trivial. 0 not checked. [2025-03-16 15:21:30,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:21:30,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2468 backedges. 1366 proven. 0 refuted. 0 times theorem prover too weak. 1102 trivial. 0 not checked. [2025-03-16 15:21:30,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108095623] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:21:30,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:21:30,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 9 [2025-03-16 15:21:30,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131230626] [2025-03-16 15:21:30,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:30,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:21:30,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:30,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:21:30,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:21:30,545 INFO L87 Difference]: Start difference. First operand 62578 states and 66138 transitions. Second operand has 4 states, 4 states have (on average 195.25) internal successors, (781), 3 states have internal predecessors, (781), 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-16 15:21:32,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:32,392 INFO L93 Difference]: Finished difference Result 138786 states and 146923 transitions. [2025-03-16 15:21:32,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:21:32,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 195.25) internal successors, (781), 3 states have internal predecessors, (781), 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 1468 [2025-03-16 15:21:32,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:32,471 INFO L225 Difference]: With dead ends: 138786 [2025-03-16 15:21:32,471 INFO L226 Difference]: Without dead ends: 76209 [2025-03-16 15:21:32,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2939 GetRequests, 2932 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:21:32,507 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 545 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 2123 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 2431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 2123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:32,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 109 Invalid, 2431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 2123 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:21:32,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76209 states. [2025-03-16 15:21:32,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76209 to 70677. [2025-03-16 15:21:33,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70677 states, 70676 states have (on average 1.057402795857151) internal successors, (74733), 70676 states have internal predecessors, (74733), 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-16 15:21:33,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70677 states to 70677 states and 74733 transitions. [2025-03-16 15:21:33,096 INFO L78 Accepts]: Start accepts. Automaton has 70677 states and 74733 transitions. Word has length 1468 [2025-03-16 15:21:33,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:33,096 INFO L471 AbstractCegarLoop]: Abstraction has 70677 states and 74733 transitions. [2025-03-16 15:21:33,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 195.25) internal successors, (781), 3 states have internal predecessors, (781), 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-16 15:21:33,096 INFO L276 IsEmpty]: Start isEmpty. Operand 70677 states and 74733 transitions. [2025-03-16 15:21:33,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1543 [2025-03-16 15:21:33,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:33,151 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 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, 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] [2025-03-16 15:21:33,157 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-16 15:21:33,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-16 15:21:33,351 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:33,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:33,352 INFO L85 PathProgramCache]: Analyzing trace with hash -2024063520, now seen corresponding path program 1 times [2025-03-16 15:21:33,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:33,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944777823] [2025-03-16 15:21:33,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:33,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:33,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1542 statements into 1 equivalence classes. [2025-03-16 15:21:33,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1542 of 1542 statements. [2025-03-16 15:21:33,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:33,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:35,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2897 backedges. 1722 proven. 0 refuted. 0 times theorem prover too weak. 1175 trivial. 0 not checked. [2025-03-16 15:21:35,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:35,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944777823] [2025-03-16 15:21:35,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944777823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:35,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:35,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:21:35,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475370593] [2025-03-16 15:21:35,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:35,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:21:35,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:35,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:21:35,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:21:35,071 INFO L87 Difference]: Start difference. First operand 70677 states and 74733 transitions. Second operand has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 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-16 15:21:36,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:36,212 INFO L93 Difference]: Finished difference Result 140931 states and 149026 transitions. [2025-03-16 15:21:36,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:21:36,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 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 1542 [2025-03-16 15:21:36,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:36,281 INFO L225 Difference]: With dead ends: 140931 [2025-03-16 15:21:36,282 INFO L226 Difference]: Without dead ends: 70255 [2025-03-16 15:21:36,323 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-16 15:21:36,324 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 113 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:36,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 692 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:21:36,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70255 states. [2025-03-16 15:21:36,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70255 to 68977. [2025-03-16 15:21:36,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68977 states, 68976 states have (on average 1.0575707492461146) internal successors, (72947), 68976 states have internal predecessors, (72947), 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-16 15:21:37,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68977 states to 68977 states and 72947 transitions. [2025-03-16 15:21:37,048 INFO L78 Accepts]: Start accepts. Automaton has 68977 states and 72947 transitions. Word has length 1542 [2025-03-16 15:21:37,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:37,048 INFO L471 AbstractCegarLoop]: Abstraction has 68977 states and 72947 transitions. [2025-03-16 15:21:37,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 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-16 15:21:37,048 INFO L276 IsEmpty]: Start isEmpty. Operand 68977 states and 72947 transitions. [2025-03-16 15:21:37,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1548 [2025-03-16 15:21:37,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:37,109 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 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, 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] [2025-03-16 15:21:37,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 15:21:37,109 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:37,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:37,110 INFO L85 PathProgramCache]: Analyzing trace with hash -186338654, now seen corresponding path program 1 times [2025-03-16 15:21:37,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:37,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507079999] [2025-03-16 15:21:37,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:37,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:37,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1547 statements into 1 equivalence classes. [2025-03-16 15:21:37,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1547 of 1547 statements. [2025-03-16 15:21:37,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:37,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:38,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2922 backedges. 1917 proven. 290 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2025-03-16 15:21:38,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:38,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507079999] [2025-03-16 15:21:38,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507079999] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:21:38,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682046732] [2025-03-16 15:21:38,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:38,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:21:38,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:21:38,542 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-16 15:21:38,543 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-16 15:21:38,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1547 statements into 1 equivalence classes. [2025-03-16 15:21:38,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1547 of 1547 statements. [2025-03-16 15:21:38,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:38,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:38,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 1768 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 15:21:38,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:21:38,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2922 backedges. 763 proven. 78 refuted. 0 times theorem prover too weak. 2081 trivial. 0 not checked. [2025-03-16 15:21:38,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:21:39,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2922 backedges. 841 proven. 0 refuted. 0 times theorem prover too weak. 2081 trivial. 0 not checked. [2025-03-16 15:21:39,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682046732] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:21:39,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:21:39,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 9 [2025-03-16 15:21:39,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904539097] [2025-03-16 15:21:39,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:39,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:21:39,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:39,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:21:39,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:21:39,144 INFO L87 Difference]: Start difference. First operand 68977 states and 72947 transitions. Second operand has 4 states, 4 states have (on average 136.5) internal successors, (546), 3 states have internal predecessors, (546), 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-16 15:21:41,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:41,090 INFO L93 Difference]: Finished difference Result 152004 states and 160731 transitions. [2025-03-16 15:21:41,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:21:41,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 136.5) internal successors, (546), 3 states have internal predecessors, (546), 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 1547 [2025-03-16 15:21:41,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:41,179 INFO L225 Difference]: With dead ends: 152004 [2025-03-16 15:21:41,179 INFO L226 Difference]: Without dead ends: 83028 [2025-03-16 15:21:41,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3097 GetRequests, 3090 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:21:41,213 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 808 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 2089 mSolverCounterSat, 369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 2458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 369 IncrementalHoareTripleChecker+Valid, 2089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:41,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 119 Invalid, 2458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [369 Valid, 2089 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:21:41,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83028 states.