./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label48.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label48.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 0d929df4a838f03b0a70e3f4a24ac63ec6782a4f298757e5a2174a7cc8e9071c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 11:01:57,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:01:57,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 11:01:57,301 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:01:57,301 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:01:57,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:01:57,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:01:57,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:01:57,319 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:01:57,319 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:01:57,320 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:01:57,320 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:01:57,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:01:57,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:01:57,321 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:01:57,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:01:57,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:01:57,321 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:01:57,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 11:01:57,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:01:57,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:01:57,321 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:01:57,321 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:01:57,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:01:57,322 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:01:57,322 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:01:57,322 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:01:57,322 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:01:57,322 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:01:57,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:01:57,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:01:57,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:01:57,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:01:57,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:01:57,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:01:57,323 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:01:57,323 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:01:57,323 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 11:01:57,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 11:01:57,323 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:01:57,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:01:57,323 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:01:57,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:01:57,324 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 -> 0d929df4a838f03b0a70e3f4a24ac63ec6782a4f298757e5a2174a7cc8e9071c [2025-03-03 11:01:57,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:01:57,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:01:57,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:01:57,532 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:01:57,532 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:01:57,533 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label48.c [2025-03-03 11:01:58,639 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79d8ffd2e/4fe21035b3c7428ca9be1ee1075b2b94/FLAGc5653d890 [2025-03-03 11:01:59,051 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:01:59,051 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label48.c [2025-03-03 11:01:59,076 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79d8ffd2e/4fe21035b3c7428ca9be1ee1075b2b94/FLAGc5653d890 [2025-03-03 11:01:59,204 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79d8ffd2e/4fe21035b3c7428ca9be1ee1075b2b94 [2025-03-03 11:01:59,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:01:59,207 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:01:59,208 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:01:59,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:01:59,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:01:59,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:01:59" (1/1) ... [2025-03-03 11:01:59,211 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e5a079c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:59, skipping insertion in model container [2025-03-03 11:01:59,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:01:59" (1/1) ... [2025-03-03 11:01:59,260 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:01:59,429 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_label48.c[6493,6506] [2025-03-03 11:01:59,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:01:59,851 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:01:59,893 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_label48.c[6493,6506] [2025-03-03 11:02:00,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:02:00,063 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:02:00,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00 WrapperNode [2025-03-03 11:02:00,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:02:00,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:02:00,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:02:00,065 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:02:00,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00" (1/1) ... [2025-03-03 11:02:00,097 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00" (1/1) ... [2025-03-03 11:02:00,261 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-03 11:02:00,262 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:02:00,262 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:02:00,262 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:02:00,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:02:00,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00" (1/1) ... [2025-03-03 11:02:00,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00" (1/1) ... [2025-03-03 11:02:00,334 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00" (1/1) ... [2025-03-03 11:02:00,449 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 11:02:00,450 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00" (1/1) ... [2025-03-03 11:02:00,450 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00" (1/1) ... [2025-03-03 11:02:00,570 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00" (1/1) ... [2025-03-03 11:02:00,586 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00" (1/1) ... [2025-03-03 11:02:00,604 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00" (1/1) ... [2025-03-03 11:02:00,614 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00" (1/1) ... [2025-03-03 11:02:00,641 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:02:00,642 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:02:00,642 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:02:00,642 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:02:00,643 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00" (1/1) ... [2025-03-03 11:02:00,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:02:00,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:02:00,667 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 11:02:00,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 11:02:00,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:02:00,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 11:02:00,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:02:00,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:02:00,734 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:02:00,735 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:02:03,088 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-03 11:02:03,230 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-03 11:02:03,234 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:02:03,263 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:02:03,263 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:02:03,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:02:03 BoogieIcfgContainer [2025-03-03 11:02:03,263 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:02:03,268 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:02:03,268 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:02:03,271 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:02:03,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:01:59" (1/3) ... [2025-03-03 11:02:03,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2222d3af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:02:03, skipping insertion in model container [2025-03-03 11:02:03,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00" (2/3) ... [2025-03-03 11:02:03,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2222d3af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:02:03, skipping insertion in model container [2025-03-03 11:02:03,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:02:03" (3/3) ... [2025-03-03 11:02:03,274 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label48.c [2025-03-03 11:02:03,284 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:02:03,285 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label48.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 11:02:03,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:02:03,353 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;@e7889c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:02:03,353 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 11:02:03,358 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 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-03 11:02:03,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 11:02:03,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:03,365 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] [2025-03-03 11:02:03,365 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:03,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:03,370 INFO L85 PathProgramCache]: Analyzing trace with hash 640438294, now seen corresponding path program 1 times [2025-03-03 11:02:03,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:03,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422853312] [2025-03-03 11:02:03,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:03,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:03,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 11:02:03,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 11:02:03,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:03,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:03,649 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-03 11:02:03,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:03,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422853312] [2025-03-03 11:02:03,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422853312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:03,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:03,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:02:03,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561200493] [2025-03-03 11:02:03,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:03,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:03,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:03,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:03,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:03,674 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 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-03 11:02:05,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:05,667 INFO L93 Difference]: Finished difference Result 1644 states and 3026 transitions. [2025-03-03 11:02:05,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:05,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 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 43 [2025-03-03 11:02:05,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:05,679 INFO L225 Difference]: With dead ends: 1644 [2025-03-03 11:02:05,680 INFO L226 Difference]: Without dead ends: 977 [2025-03-03 11:02:05,685 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-03 11:02:05,687 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 445 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:05,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 11:02:05,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-03-03 11:02:05,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2025-03-03 11:02:05,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 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-03 11:02:05,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2025-03-03 11:02:05,766 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 43 [2025-03-03 11:02:05,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:05,766 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2025-03-03 11:02:05,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 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-03 11:02:05,767 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2025-03-03 11:02:05,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 11:02:05,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:05,769 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:05,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 11:02:05,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:05,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:05,770 INFO L85 PathProgramCache]: Analyzing trace with hash -32991307, now seen corresponding path program 1 times [2025-03-03 11:02:05,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:05,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537234297] [2025-03-03 11:02:05,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:05,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:05,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 11:02:05,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 11:02:05,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:05,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:06,012 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:02:06,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:06,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537234297] [2025-03-03 11:02:06,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537234297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:06,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:06,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:02:06,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653431491] [2025-03-03 11:02:06,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:06,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:06,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:06,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:06,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:06,017 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-03 11:02:07,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:07,732 INFO L93 Difference]: Finished difference Result 2815 states and 4382 transitions. [2025-03-03 11:02:07,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:07,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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 110 [2025-03-03 11:02:07,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:07,738 INFO L225 Difference]: With dead ends: 2815 [2025-03-03 11:02:07,738 INFO L226 Difference]: Without dead ends: 1846 [2025-03-03 11:02:07,739 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-03 11:02:07,740 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 407 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:07,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 581 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 11:02:07,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2025-03-03 11:02:07,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1841. [2025-03-03 11:02:07,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.3505434782608696) internal successors, (2485), 1840 states have internal predecessors, (2485), 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-03 11:02:07,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2485 transitions. [2025-03-03 11:02:07,780 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2485 transitions. Word has length 110 [2025-03-03 11:02:07,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:07,781 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2485 transitions. [2025-03-03 11:02:07,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-03 11:02:07,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2485 transitions. [2025-03-03 11:02:07,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 11:02:07,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:07,787 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:07,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 11:02:07,787 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:07,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:07,787 INFO L85 PathProgramCache]: Analyzing trace with hash 716871277, now seen corresponding path program 1 times [2025-03-03 11:02:07,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:07,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303833163] [2025-03-03 11:02:07,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:07,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:07,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 11:02:07,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 11:02:07,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:07,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:08,114 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:02:08,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:08,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303833163] [2025-03-03 11:02:08,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303833163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:08,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:08,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:08,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517877833] [2025-03-03 11:02:08,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:08,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:02:08,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:08,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:02:08,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:02:08,116 INFO L87 Difference]: Start difference. First operand 1841 states and 2485 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 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-03 11:02:10,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:10,613 INFO L93 Difference]: Finished difference Result 6767 states and 9263 transitions. [2025-03-03 11:02:10,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:02:10,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 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 113 [2025-03-03 11:02:10,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:10,626 INFO L225 Difference]: With dead ends: 6767 [2025-03-03 11:02:10,626 INFO L226 Difference]: Without dead ends: 4928 [2025-03-03 11:02:10,628 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-03 11:02:10,629 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 925 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2516 mSolverCounterSat, 774 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 3290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 774 IncrementalHoareTripleChecker+Valid, 2516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:10,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 286 Invalid, 3290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [774 Valid, 2516 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 11:02:10,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4928 states. [2025-03-03 11:02:10,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4928 to 4875. [2025-03-03 11:02:10,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4875 states, 4874 states have (on average 1.2870332375871973) internal successors, (6273), 4874 states have internal predecessors, (6273), 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-03 11:02:10,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4875 states to 4875 states and 6273 transitions. [2025-03-03 11:02:10,693 INFO L78 Accepts]: Start accepts. Automaton has 4875 states and 6273 transitions. Word has length 113 [2025-03-03 11:02:10,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:10,694 INFO L471 AbstractCegarLoop]: Abstraction has 4875 states and 6273 transitions. [2025-03-03 11:02:10,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 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-03 11:02:10,694 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 6273 transitions. [2025-03-03 11:02:10,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 11:02:10,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:10,699 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, 2, 2, 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] [2025-03-03 11:02:10,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 11:02:10,700 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:10,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:10,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1176502342, now seen corresponding path program 1 times [2025-03-03 11:02:10,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:10,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123167401] [2025-03-03 11:02:10,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:10,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:10,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 11:02:10,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 11:02:10,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:10,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:10,880 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-03 11:02:10,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:10,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123167401] [2025-03-03 11:02:10,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123167401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:10,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:10,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:02:10,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171051387] [2025-03-03 11:02:10,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:10,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:10,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:10,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:10,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:10,883 INFO L87 Difference]: Start difference. First operand 4875 states and 6273 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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-03 11:02:12,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:12,324 INFO L93 Difference]: Finished difference Result 14436 states and 18550 transitions. [2025-03-03 11:02:12,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:12,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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 179 [2025-03-03 11:02:12,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:12,345 INFO L225 Difference]: With dead ends: 14436 [2025-03-03 11:02:12,346 INFO L226 Difference]: Without dead ends: 8277 [2025-03-03 11:02:12,353 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-03 11:02:12,354 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 590 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.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:12,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 11:02:12,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8277 states. [2025-03-03 11:02:12,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8277 to 6571. [2025-03-03 11:02:12,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6571 states, 6570 states have (on average 1.1796042617960427) internal successors, (7750), 6570 states have internal predecessors, (7750), 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-03 11:02:12,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6571 states to 6571 states and 7750 transitions. [2025-03-03 11:02:12,451 INFO L78 Accepts]: Start accepts. Automaton has 6571 states and 7750 transitions. Word has length 179 [2025-03-03 11:02:12,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:12,452 INFO L471 AbstractCegarLoop]: Abstraction has 6571 states and 7750 transitions. [2025-03-03 11:02:12,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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-03 11:02:12,452 INFO L276 IsEmpty]: Start isEmpty. Operand 6571 states and 7750 transitions. [2025-03-03 11:02:12,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-03 11:02:12,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:12,454 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, 2, 2, 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] [2025-03-03 11:02:12,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 11:02:12,455 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:12,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:12,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1072114548, now seen corresponding path program 1 times [2025-03-03 11:02:12,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:12,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981670643] [2025-03-03 11:02:12,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:12,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:12,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-03 11:02:12,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-03 11:02:12,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:12,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:12,664 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:02:12,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:12,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981670643] [2025-03-03 11:02:12,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981670643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:12,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:12,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:12,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404600864] [2025-03-03 11:02:12,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:12,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:12,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:12,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:12,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:12,667 INFO L87 Difference]: Start difference. First operand 6571 states and 7750 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-03 11:02:14,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:14,003 INFO L93 Difference]: Finished difference Result 16550 states and 19925 transitions. [2025-03-03 11:02:14,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:14,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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 192 [2025-03-03 11:02:14,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:14,027 INFO L225 Difference]: With dead ends: 16550 [2025-03-03 11:02:14,028 INFO L226 Difference]: Without dead ends: 9981 [2025-03-03 11:02:14,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:14,036 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 499 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:14,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 801 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 11:02:14,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9981 states. [2025-03-03 11:02:14,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9981 to 9981. [2025-03-03 11:02:14,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9981 states, 9980 states have (on average 1.1698396793587174) internal successors, (11675), 9980 states have internal predecessors, (11675), 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-03 11:02:14,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9981 states to 9981 states and 11675 transitions. [2025-03-03 11:02:14,148 INFO L78 Accepts]: Start accepts. Automaton has 9981 states and 11675 transitions. Word has length 192 [2025-03-03 11:02:14,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:14,149 INFO L471 AbstractCegarLoop]: Abstraction has 9981 states and 11675 transitions. [2025-03-03 11:02:14,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-03 11:02:14,149 INFO L276 IsEmpty]: Start isEmpty. Operand 9981 states and 11675 transitions. [2025-03-03 11:02:14,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 11:02:14,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:14,151 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, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:02:14,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 11:02:14,152 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:14,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:14,152 INFO L85 PathProgramCache]: Analyzing trace with hash 798747510, now seen corresponding path program 1 times [2025-03-03 11:02:14,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:14,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716828254] [2025-03-03 11:02:14,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:14,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:14,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 11:02:14,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 11:02:14,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:14,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:14,328 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-03 11:02:14,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:14,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716828254] [2025-03-03 11:02:14,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716828254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:14,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:14,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:14,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820788207] [2025-03-03 11:02:14,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:14,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:14,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:14,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:14,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:14,374 INFO L87 Difference]: Start difference. First operand 9981 states and 11675 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-03 11:02:16,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:16,413 INFO L93 Difference]: Finished difference Result 24248 states and 28757 transitions. [2025-03-03 11:02:16,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:16,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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 197 [2025-03-03 11:02:16,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:16,439 INFO L225 Difference]: With dead ends: 24248 [2025-03-03 11:02:16,439 INFO L226 Difference]: Without dead ends: 14269 [2025-03-03 11:02:16,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:16,449 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 477 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:16,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 444 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 11:02:16,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14269 states. [2025-03-03 11:02:16,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14269 to 13397. [2025-03-03 11:02:16,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13397 states, 13396 states have (on average 1.1923708569722304) internal successors, (15973), 13396 states have internal predecessors, (15973), 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-03 11:02:16,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13397 states to 13397 states and 15973 transitions. [2025-03-03 11:02:16,588 INFO L78 Accepts]: Start accepts. Automaton has 13397 states and 15973 transitions. Word has length 197 [2025-03-03 11:02:16,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:16,588 INFO L471 AbstractCegarLoop]: Abstraction has 13397 states and 15973 transitions. [2025-03-03 11:02:16,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-03 11:02:16,589 INFO L276 IsEmpty]: Start isEmpty. Operand 13397 states and 15973 transitions. [2025-03-03 11:02:16,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-03-03 11:02:16,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:16,591 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:02:16,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 11:02:16,591 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:16,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:16,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1379642700, now seen corresponding path program 1 times [2025-03-03 11:02:16,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:16,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525531188] [2025-03-03 11:02:16,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:16,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:16,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-03 11:02:16,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-03 11:02:16,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:16,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:16,703 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 11:02:16,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:16,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525531188] [2025-03-03 11:02:16,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525531188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:16,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:16,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:16,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005150255] [2025-03-03 11:02:16,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:16,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:16,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:16,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:16,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:16,705 INFO L87 Difference]: Start difference. First operand 13397 states and 15973 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-03 11:02:18,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:18,340 INFO L93 Difference]: Finished difference Result 30624 states and 36860 transitions. [2025-03-03 11:02:18,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:18,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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 242 [2025-03-03 11:02:18,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:18,366 INFO L225 Difference]: With dead ends: 30624 [2025-03-03 11:02:18,366 INFO L226 Difference]: Without dead ends: 17229 [2025-03-03 11:02:18,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:18,379 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 460 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:18,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 410 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 1392 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 11:02:18,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17229 states. [2025-03-03 11:02:18,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17229 to 13379. [2025-03-03 11:02:18,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13379 states, 13378 states have (on average 1.190611451637016) internal successors, (15928), 13378 states have internal predecessors, (15928), 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-03 11:02:18,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13379 states to 13379 states and 15928 transitions. [2025-03-03 11:02:18,566 INFO L78 Accepts]: Start accepts. Automaton has 13379 states and 15928 transitions. Word has length 242 [2025-03-03 11:02:18,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:18,567 INFO L471 AbstractCegarLoop]: Abstraction has 13379 states and 15928 transitions. [2025-03-03 11:02:18,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-03 11:02:18,567 INFO L276 IsEmpty]: Start isEmpty. Operand 13379 states and 15928 transitions. [2025-03-03 11:02:18,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-03 11:02:18,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:18,570 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:18,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 11:02:18,571 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:18,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:18,571 INFO L85 PathProgramCache]: Analyzing trace with hash -744516636, now seen corresponding path program 1 times [2025-03-03 11:02:18,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:18,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329874222] [2025-03-03 11:02:18,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:18,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:18,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-03 11:02:18,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-03 11:02:18,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:18,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:18,754 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:02:18,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:18,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329874222] [2025-03-03 11:02:18,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329874222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:18,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:18,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:18,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443652822] [2025-03-03 11:02:18,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:18,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:18,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:18,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:18,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:18,755 INFO L87 Difference]: Start difference. First operand 13379 states and 15928 transitions. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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-03 11:02:20,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:20,272 INFO L93 Difference]: Finished difference Result 30622 states and 36711 transitions. [2025-03-03 11:02:20,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:20,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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 259 [2025-03-03 11:02:20,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:20,298 INFO L225 Difference]: With dead ends: 30622 [2025-03-03 11:02:20,298 INFO L226 Difference]: Without dead ends: 17245 [2025-03-03 11:02:20,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:20,311 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 356 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:20,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 887 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 11:02:20,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17245 states. [2025-03-03 11:02:20,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17245 to 16812. [2025-03-03 11:02:20,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16812 states, 16811 states have (on average 1.1727440366426745) internal successors, (19715), 16811 states have internal predecessors, (19715), 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-03 11:02:20,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16812 states to 16812 states and 19715 transitions. [2025-03-03 11:02:20,513 INFO L78 Accepts]: Start accepts. Automaton has 16812 states and 19715 transitions. Word has length 259 [2025-03-03 11:02:20,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:20,514 INFO L471 AbstractCegarLoop]: Abstraction has 16812 states and 19715 transitions. [2025-03-03 11:02:20,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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-03 11:02:20,515 INFO L276 IsEmpty]: Start isEmpty. Operand 16812 states and 19715 transitions. [2025-03-03 11:02:20,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-03 11:02:20,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:20,522 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, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 11:02:20,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 11:02:20,522 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:20,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:20,523 INFO L85 PathProgramCache]: Analyzing trace with hash -757782067, now seen corresponding path program 1 times [2025-03-03 11:02:20,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:20,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682571719] [2025-03-03 11:02:20,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:20,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:20,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-03 11:02:20,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-03 11:02:20,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:20,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:20,861 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 220 proven. 70 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 11:02:20,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:20,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682571719] [2025-03-03 11:02:20,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682571719] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:02:20,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60379661] [2025-03-03 11:02:20,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:20,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:02:20,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:02:20,865 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:02:20,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 11:02:20,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-03 11:02:20,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-03 11:02:20,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:20,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:20,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 11:02:20,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:02:21,158 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 220 proven. 70 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 11:02:21,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:02:21,396 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 11:02:21,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60379661] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 11:02:21,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 11:02:21,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-03 11:02:21,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118486187] [2025-03-03 11:02:21,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:21,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:02:21,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:21,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:02:21,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:02:21,399 INFO L87 Difference]: Start difference. First operand 16812 states and 19715 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 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-03 11:02:24,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:24,136 INFO L93 Difference]: Finished difference Result 47275 states and 56056 transitions. [2025-03-03 11:02:24,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:02:24,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 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 267 [2025-03-03 11:02:24,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:24,170 INFO L225 Difference]: With dead ends: 47275 [2025-03-03 11:02:24,170 INFO L226 Difference]: Without dead ends: 28306 [2025-03-03 11:02:24,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:02:24,188 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 1064 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 1224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1064 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 3490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1224 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:24,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1064 Valid, 148 Invalid, 3490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1224 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 11:02:24,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28306 states. [2025-03-03 11:02:24,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28306 to 27875. [2025-03-03 11:02:24,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27875 states, 27874 states have (on average 1.1424625098658248) internal successors, (31845), 27874 states have internal predecessors, (31845), 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-03 11:02:24,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27875 states to 27875 states and 31845 transitions. [2025-03-03 11:02:24,500 INFO L78 Accepts]: Start accepts. Automaton has 27875 states and 31845 transitions. Word has length 267 [2025-03-03 11:02:24,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:24,500 INFO L471 AbstractCegarLoop]: Abstraction has 27875 states and 31845 transitions. [2025-03-03 11:02:24,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 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-03 11:02:24,501 INFO L276 IsEmpty]: Start isEmpty. Operand 27875 states and 31845 transitions. [2025-03-03 11:02:24,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-03-03 11:02:24,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:24,506 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:24,513 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-03 11:02:24,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:02:24,711 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:24,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:24,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1160441804, now seen corresponding path program 1 times [2025-03-03 11:02:24,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:24,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160371446] [2025-03-03 11:02:24,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:24,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:24,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-03 11:02:24,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-03 11:02:24,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:24,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-03-03 11:02:24,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:24,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160371446] [2025-03-03 11:02:24,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160371446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:24,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:24,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:24,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347511318] [2025-03-03 11:02:24,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:24,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:24,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:24,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:24,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:24,882 INFO L87 Difference]: Start difference. First operand 27875 states and 31845 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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-03 11:02:26,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:26,374 INFO L93 Difference]: Finished difference Result 64690 states and 73399 transitions. [2025-03-03 11:02:26,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:26,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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 361 [2025-03-03 11:02:26,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:26,414 INFO L225 Difference]: With dead ends: 64690 [2025-03-03 11:02:26,414 INFO L226 Difference]: Without dead ends: 36817 [2025-03-03 11:02:26,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:26,433 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 485 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:26,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 282 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 11:02:26,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36817 states. [2025-03-03 11:02:26,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36817 to 36367. [2025-03-03 11:02:26,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36367 states, 36366 states have (on average 1.122422042567233) internal successors, (40818), 36366 states have internal predecessors, (40818), 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-03 11:02:26,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36367 states to 36367 states and 40818 transitions. [2025-03-03 11:02:26,896 INFO L78 Accepts]: Start accepts. Automaton has 36367 states and 40818 transitions. Word has length 361 [2025-03-03 11:02:26,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:26,897 INFO L471 AbstractCegarLoop]: Abstraction has 36367 states and 40818 transitions. [2025-03-03 11:02:26,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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-03 11:02:26,897 INFO L276 IsEmpty]: Start isEmpty. Operand 36367 states and 40818 transitions. [2025-03-03 11:02:26,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-03-03 11:02:26,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:26,904 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:26,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 11:02:26,905 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:26,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:26,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1481224643, now seen corresponding path program 1 times [2025-03-03 11:02:26,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:26,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809205115] [2025-03-03 11:02:26,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:26,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:26,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-03-03 11:02:26,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-03-03 11:02:26,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:26,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:27,116 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-03 11:02:27,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:27,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809205115] [2025-03-03 11:02:27,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809205115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:27,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:27,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:27,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904375093] [2025-03-03 11:02:27,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:27,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:27,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:27,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:27,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:27,118 INFO L87 Difference]: Start difference. First operand 36367 states and 40818 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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-03 11:02:28,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:28,507 INFO L93 Difference]: Finished difference Result 79526 states and 89552 transitions. [2025-03-03 11:02:28,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:28,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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 382 [2025-03-03 11:02:28,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:28,548 INFO L225 Difference]: With dead ends: 79526 [2025-03-03 11:02:28,548 INFO L226 Difference]: Without dead ends: 43161 [2025-03-03 11:02:28,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:28,572 INFO L435 NwaCegarLoop]: 731 mSDtfsCounter, 272 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:28,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 793 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:02:28,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43161 states. [2025-03-03 11:02:28,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43161 to 43161. [2025-03-03 11:02:28,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43161 states, 43160 states have (on average 1.1083178869323447) internal successors, (47835), 43160 states have internal predecessors, (47835), 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-03 11:02:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43161 states to 43161 states and 47835 transitions. [2025-03-03 11:02:28,946 INFO L78 Accepts]: Start accepts. Automaton has 43161 states and 47835 transitions. Word has length 382 [2025-03-03 11:02:28,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:28,946 INFO L471 AbstractCegarLoop]: Abstraction has 43161 states and 47835 transitions. [2025-03-03 11:02:28,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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-03 11:02:28,946 INFO L276 IsEmpty]: Start isEmpty. Operand 43161 states and 47835 transitions. [2025-03-03 11:02:28,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-03-03 11:02:28,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:28,952 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:28,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 11:02:28,953 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:28,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:28,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1383289224, now seen corresponding path program 1 times [2025-03-03 11:02:28,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:28,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333203215] [2025-03-03 11:02:28,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:28,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:29,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-03 11:02:29,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-03 11:02:29,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:29,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:29,433 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 11:02:29,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:29,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333203215] [2025-03-03 11:02:29,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333203215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:29,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:29,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:29,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148241881] [2025-03-03 11:02:29,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:29,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:29,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:29,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:29,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:29,434 INFO L87 Difference]: Start difference. First operand 43161 states and 47835 transitions. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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-03 11:02:30,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:30,925 INFO L93 Difference]: Finished difference Result 98273 states and 108802 transitions. [2025-03-03 11:02:30,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:30,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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 405 [2025-03-03 11:02:30,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:30,985 INFO L225 Difference]: With dead ends: 98273 [2025-03-03 11:02:30,985 INFO L226 Difference]: Without dead ends: 55114 [2025-03-03 11:02:31,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:31,014 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 336 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:31,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 636 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:02:31,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55114 states. [2025-03-03 11:02:31,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55114 to 52106. [2025-03-03 11:02:31,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52106 states, 52105 states have (on average 1.1077055944726995) internal successors, (57717), 52105 states have internal predecessors, (57717), 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-03 11:02:31,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52106 states to 52106 states and 57717 transitions. [2025-03-03 11:02:31,532 INFO L78 Accepts]: Start accepts. Automaton has 52106 states and 57717 transitions. Word has length 405 [2025-03-03 11:02:31,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:31,532 INFO L471 AbstractCegarLoop]: Abstraction has 52106 states and 57717 transitions. [2025-03-03 11:02:31,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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-03 11:02:31,532 INFO L276 IsEmpty]: Start isEmpty. Operand 52106 states and 57717 transitions. [2025-03-03 11:02:31,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-03-03 11:02:31,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:31,540 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:31,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 11:02:31,541 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:31,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:31,541 INFO L85 PathProgramCache]: Analyzing trace with hash 133764608, now seen corresponding path program 1 times [2025-03-03 11:02:31,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:31,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243564443] [2025-03-03 11:02:31,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:31,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:31,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-03 11:02:31,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-03 11:02:31,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:31,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:32,003 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 11:02:32,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:32,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243564443] [2025-03-03 11:02:32,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243564443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:32,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:32,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:02:32,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861026180] [2025-03-03 11:02:32,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:32,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:02:32,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:32,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:02:32,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:02:32,006 INFO L87 Difference]: Start difference. First operand 52106 states and 57717 transitions. Second operand has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 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-03 11:02:34,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:34,325 INFO L93 Difference]: Finished difference Result 130213 states and 143849 transitions. [2025-03-03 11:02:34,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:02:34,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 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 448 [2025-03-03 11:02:34,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:34,401 INFO L225 Difference]: With dead ends: 130213 [2025-03-03 11:02:34,401 INFO L226 Difference]: Without dead ends: 77684 [2025-03-03 11:02:34,415 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-03 11:02:34,417 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 780 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 2522 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 2982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 2522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:34,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 161 Invalid, 2982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 2522 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 11:02:34,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77684 states. [2025-03-03 11:02:34,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77684 to 69116. [2025-03-03 11:02:34,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69116 states, 69115 states have (on average 1.1004991680532445) internal successors, (76061), 69115 states have internal predecessors, (76061), 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-03 11:02:35,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69116 states to 69116 states and 76061 transitions. [2025-03-03 11:02:35,213 INFO L78 Accepts]: Start accepts. Automaton has 69116 states and 76061 transitions. Word has length 448 [2025-03-03 11:02:35,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:35,214 INFO L471 AbstractCegarLoop]: Abstraction has 69116 states and 76061 transitions. [2025-03-03 11:02:35,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 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-03 11:02:35,214 INFO L276 IsEmpty]: Start isEmpty. Operand 69116 states and 76061 transitions. [2025-03-03 11:02:35,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-03 11:02:35,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:35,223 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:35,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 11:02:35,224 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:35,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:35,224 INFO L85 PathProgramCache]: Analyzing trace with hash 926009500, now seen corresponding path program 1 times [2025-03-03 11:02:35,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:35,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919690211] [2025-03-03 11:02:35,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:35,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:35,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-03 11:02:35,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-03 11:02:35,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:35,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-03 11:02:35,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:35,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919690211] [2025-03-03 11:02:35,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919690211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:35,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:35,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:35,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561651470] [2025-03-03 11:02:35,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:35,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:35,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:35,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:35,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:35,809 INFO L87 Difference]: Start difference. First operand 69116 states and 76061 transitions. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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-03 11:02:37,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:37,421 INFO L93 Difference]: Finished difference Result 153595 states and 169224 transitions. [2025-03-03 11:02:37,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:37,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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 455 [2025-03-03 11:02:37,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:37,521 INFO L225 Difference]: With dead ends: 153595 [2025-03-03 11:02:37,521 INFO L226 Difference]: Without dead ends: 84056 [2025-03-03 11:02:37,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-03 11:02:37,572 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 446 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:37,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 701 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1313 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:02:37,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84056 states. [2025-03-03 11:02:38,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84056 to 82333. [2025-03-03 11:02:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82333 states, 82332 states have (on average 1.1011149978137298) internal successors, (90657), 82332 states have internal predecessors, (90657), 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-03 11:02:38,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82333 states to 82333 states and 90657 transitions. [2025-03-03 11:02:38,713 INFO L78 Accepts]: Start accepts. Automaton has 82333 states and 90657 transitions. Word has length 455 [2025-03-03 11:02:38,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:38,713 INFO L471 AbstractCegarLoop]: Abstraction has 82333 states and 90657 transitions. [2025-03-03 11:02:38,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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-03 11:02:38,713 INFO L276 IsEmpty]: Start isEmpty. Operand 82333 states and 90657 transitions. [2025-03-03 11:02:38,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-03-03 11:02:38,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:38,721 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, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 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] [2025-03-03 11:02:38,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 11:02:38,722 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:38,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:38,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1609137762, now seen corresponding path program 1 times [2025-03-03 11:02:38,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:38,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132166258] [2025-03-03 11:02:38,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:38,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:38,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-03 11:02:38,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-03 11:02:38,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:38,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 543 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-03 11:02:38,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:38,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132166258] [2025-03-03 11:02:38,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132166258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:38,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:38,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:02:38,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073148918] [2025-03-03 11:02:38,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:38,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:38,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:38,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:38,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:38,899 INFO L87 Difference]: Start difference. First operand 82333 states and 90657 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 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-03 11:02:39,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:39,846 INFO L93 Difference]: Finished difference Result 162524 states and 178775 transitions. [2025-03-03 11:02:39,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:39,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 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 469 [2025-03-03 11:02:39,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:39,927 INFO L225 Difference]: With dead ends: 162524 [2025-03-03 11:02:39,927 INFO L226 Difference]: Without dead ends: 80193 [2025-03-03 11:02:39,977 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-03 11:02:39,978 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 622 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:39,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 103 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 11:02:40,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80193 states. [2025-03-03 11:02:40,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80193 to 80178. [2025-03-03 11:02:40,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80178 states, 80177 states have (on average 1.0985569427641344) internal successors, (88079), 80177 states have internal predecessors, (88079), 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-03 11:02:40,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80178 states to 80178 states and 88079 transitions. [2025-03-03 11:02:40,918 INFO L78 Accepts]: Start accepts. Automaton has 80178 states and 88079 transitions. Word has length 469 [2025-03-03 11:02:40,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:40,918 INFO L471 AbstractCegarLoop]: Abstraction has 80178 states and 88079 transitions. [2025-03-03 11:02:40,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 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-03 11:02:40,919 INFO L276 IsEmpty]: Start isEmpty. Operand 80178 states and 88079 transitions. [2025-03-03 11:02:40,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-03-03 11:02:40,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:40,928 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 11:02:40,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 11:02:40,928 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:40,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:40,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1237186986, now seen corresponding path program 1 times [2025-03-03 11:02:40,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:40,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448745348] [2025-03-03 11:02:40,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:40,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:40,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-03-03 11:02:40,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-03-03 11:02:40,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:40,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:41,469 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 425 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-03 11:02:41,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:41,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448745348] [2025-03-03 11:02:41,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448745348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:41,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:41,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:02:41,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285372588] [2025-03-03 11:02:41,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:41,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:02:41,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:41,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:02:41,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:02:41,471 INFO L87 Difference]: Start difference. First operand 80178 states and 88079 transitions. Second operand has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 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-03 11:02:43,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:43,920 INFO L93 Difference]: Finished difference Result 189350 states and 207625 transitions. [2025-03-03 11:02:43,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:02:43,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 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 487 [2025-03-03 11:02:43,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:44,029 INFO L225 Difference]: With dead ends: 189350 [2025-03-03 11:02:44,029 INFO L226 Difference]: Without dead ends: 104916 [2025-03-03 11:02:44,060 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-03 11:02:44,060 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 746 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 2449 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 2852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 2449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:44,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 220 Invalid, 2852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 2449 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 11:02:44,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104916 states. [2025-03-03 11:02:44,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104916 to 100611. [2025-03-03 11:02:44,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100611 states, 100610 states have (on average 1.0951197694066197) internal successors, (110180), 100610 states have internal predecessors, (110180), 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-03 11:02:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100611 states to 100611 states and 110180 transitions. [2025-03-03 11:02:44,984 INFO L78 Accepts]: Start accepts. Automaton has 100611 states and 110180 transitions. Word has length 487 [2025-03-03 11:02:44,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:44,985 INFO L471 AbstractCegarLoop]: Abstraction has 100611 states and 110180 transitions. [2025-03-03 11:02:44,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 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-03 11:02:44,985 INFO L276 IsEmpty]: Start isEmpty. Operand 100611 states and 110180 transitions. [2025-03-03 11:02:44,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2025-03-03 11:02:44,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:44,994 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, 5, 5, 5, 5, 5, 5, 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, 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] [2025-03-03 11:02:44,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 11:02:44,995 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:44,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:44,995 INFO L85 PathProgramCache]: Analyzing trace with hash -321353048, now seen corresponding path program 1 times [2025-03-03 11:02:44,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:44,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845230429] [2025-03-03 11:02:44,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:44,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:45,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 492 statements into 1 equivalence classes. [2025-03-03 11:02:45,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 492 of 492 statements. [2025-03-03 11:02:45,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:45,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:45,378 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 654 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2025-03-03 11:02:45,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:45,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845230429] [2025-03-03 11:02:45,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845230429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:45,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:45,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:45,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481558966] [2025-03-03 11:02:45,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:45,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:45,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:45,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:45,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:45,381 INFO L87 Difference]: Start difference. First operand 100611 states and 110180 transitions. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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-03 11:02:46,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:46,882 INFO L93 Difference]: Finished difference Result 213971 states and 234379 transitions. [2025-03-03 11:02:46,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:46,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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 492 [2025-03-03 11:02:46,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:47,010 INFO L225 Difference]: With dead ends: 213971 [2025-03-03 11:02:47,010 INFO L226 Difference]: Without dead ends: 113362 [2025-03-03 11:02:47,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:47,072 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 399 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:47,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 320 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:02:47,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113362 states. [2025-03-03 11:02:48,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113362 to 110800. [2025-03-03 11:02:48,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110800 states, 110799 states have (on average 1.0898564066462693) internal successors, (120755), 110799 states have internal predecessors, (120755), 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-03 11:02:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110800 states to 110800 states and 120755 transitions. [2025-03-03 11:02:48,512 INFO L78 Accepts]: Start accepts. Automaton has 110800 states and 120755 transitions. Word has length 492 [2025-03-03 11:02:48,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:48,513 INFO L471 AbstractCegarLoop]: Abstraction has 110800 states and 120755 transitions. [2025-03-03 11:02:48,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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-03 11:02:48,513 INFO L276 IsEmpty]: Start isEmpty. Operand 110800 states and 120755 transitions. [2025-03-03 11:02:48,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-03-03 11:02:48,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:48,529 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, 5, 5, 5, 5, 5, 5, 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, 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] [2025-03-03 11:02:48,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 11:02:48,529 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:48,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:48,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1644620326, now seen corresponding path program 1 times [2025-03-03 11:02:48,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:48,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096734888] [2025-03-03 11:02:48,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:48,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:48,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-03-03 11:02:48,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-03-03 11:02:48,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:48,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:49,209 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 654 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2025-03-03 11:02:49,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:49,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096734888] [2025-03-03 11:02:49,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096734888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:49,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:49,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:02:49,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545478944] [2025-03-03 11:02:49,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:49,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:02:49,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:49,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:02:49,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:02:49,211 INFO L87 Difference]: Start difference. First operand 110800 states and 120755 transitions. Second operand has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:51,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:51,221 INFO L93 Difference]: Finished difference Result 232233 states and 253625 transitions. [2025-03-03 11:02:51,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:02:51,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 503 [2025-03-03 11:02:51,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:51,376 INFO L225 Difference]: With dead ends: 232233 [2025-03-03 11:02:51,376 INFO L226 Difference]: Without dead ends: 121010 [2025-03-03 11:02:51,448 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-03 11:02:51,449 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 827 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 2092 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 2401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 2092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:51,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 748 Invalid, 2401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 2092 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 11:02:51,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121010 states. [2025-03-03 11:02:52,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121010 to 106945. [2025-03-03 11:02:52,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106945 states, 106944 states have (on average 1.0883640035906643) internal successors, (116394), 106944 states have internal predecessors, (116394), 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-03 11:02:52,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106945 states to 106945 states and 116394 transitions. [2025-03-03 11:02:52,768 INFO L78 Accepts]: Start accepts. Automaton has 106945 states and 116394 transitions. Word has length 503 [2025-03-03 11:02:52,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:52,768 INFO L471 AbstractCegarLoop]: Abstraction has 106945 states and 116394 transitions. [2025-03-03 11:02:52,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:52,768 INFO L276 IsEmpty]: Start isEmpty. Operand 106945 states and 116394 transitions. [2025-03-03 11:02:52,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-03 11:02:52,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:52,780 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:52,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 11:02:52,780 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:52,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:52,781 INFO L85 PathProgramCache]: Analyzing trace with hash 504180046, now seen corresponding path program 1 times [2025-03-03 11:02:52,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:52,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105365144] [2025-03-03 11:02:52,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:52,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:52,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-03 11:02:52,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-03 11:02:52,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:52,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:53,775 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 427 proven. 41 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-03 11:02:53,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:53,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105365144] [2025-03-03 11:02:53,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105365144] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:02:53,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749103364] [2025-03-03 11:02:53,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:53,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:02:53,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:02:53,778 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:02:53,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 11:02:53,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-03 11:02:53,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-03 11:02:53,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:53,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:53,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 11:02:53,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:02:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 455 proven. 82 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-03 11:02:54,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:02:54,919 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 455 proven. 82 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-03 11:02:54,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749103364] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 11:02:54,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 11:02:54,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-03-03 11:02:54,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021735208] [2025-03-03 11:02:54,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 11:02:54,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 11:02:54,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:54,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 11:02:54,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 11:02:54,922 INFO L87 Difference]: Start difference. First operand 106945 states and 116394 transitions. Second operand has 9 states, 9 states have (on average 101.11111111111111) internal successors, (910), 9 states have internal predecessors, (910), 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-03 11:03:01,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:01,903 INFO L93 Difference]: Finished difference Result 249664 states and 271344 transitions. [2025-03-03 11:03:01,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 11:03:01,904 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 101.11111111111111) internal successors, (910), 9 states have internal predecessors, (910), 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 532 [2025-03-03 11:03:01,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:02,044 INFO L225 Difference]: With dead ends: 249664 [2025-03-03 11:03:02,045 INFO L226 Difference]: Without dead ends: 138029 [2025-03-03 11:03:02,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1084 GetRequests, 1068 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2025-03-03 11:03:02,108 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 7343 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 8271 mSolverCounterSat, 1809 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7343 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 10080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1809 IncrementalHoareTripleChecker+Valid, 8271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:02,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7343 Valid, 260 Invalid, 10080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1809 Valid, 8271 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2025-03-03 11:03:02,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138029 states. [2025-03-03 11:03:03,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138029 to 122213. [2025-03-03 11:03:03,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122213 states, 122212 states have (on average 1.0703367918044056) internal successors, (130808), 122212 states have internal predecessors, (130808), 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-03 11:03:03,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122213 states to 122213 states and 130808 transitions. [2025-03-03 11:03:03,630 INFO L78 Accepts]: Start accepts. Automaton has 122213 states and 130808 transitions. Word has length 532 [2025-03-03 11:03:03,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:03,630 INFO L471 AbstractCegarLoop]: Abstraction has 122213 states and 130808 transitions. [2025-03-03 11:03:03,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 101.11111111111111) internal successors, (910), 9 states have internal predecessors, (910), 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-03 11:03:03,631 INFO L276 IsEmpty]: Start isEmpty. Operand 122213 states and 130808 transitions. [2025-03-03 11:03:03,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2025-03-03 11:03:03,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:03,647 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:03:03,653 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-03 11:03:03,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:03:03,848 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:03,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:03,848 INFO L85 PathProgramCache]: Analyzing trace with hash 525273390, now seen corresponding path program 1 times [2025-03-03 11:03:03,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:03,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243254671] [2025-03-03 11:03:03,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:03,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:03,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-03-03 11:03:03,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-03-03 11:03:03,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:03,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:04,612 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 500 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-03-03 11:03:04,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:04,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243254671] [2025-03-03 11:03:04,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243254671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:04,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:04,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:03:04,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545215893] [2025-03-03 11:03:04,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:04,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:03:04,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:04,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:03:04,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:03:04,614 INFO L87 Difference]: Start difference. First operand 122213 states and 130808 transitions. Second operand has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 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-03 11:03:06,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:06,953 INFO L93 Difference]: Finished difference Result 264462 states and 282527 transitions. [2025-03-03 11:03:06,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:03:06,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 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 567 [2025-03-03 11:03:06,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:07,103 INFO L225 Difference]: With dead ends: 264462 [2025-03-03 11:03:07,103 INFO L226 Difference]: Without dead ends: 141825 [2025-03-03 11:03:07,181 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-03 11:03:07,181 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 739 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 2355 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 2738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 2355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:07,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 158 Invalid, 2738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 2355 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 11:03:07,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141825 states. [2025-03-03 11:03:08,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141825 to 131153. [2025-03-03 11:03:08,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131153 states, 131152 states have (on average 1.0690496523118214) internal successors, (140208), 131152 states have internal predecessors, (140208), 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-03 11:03:08,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131153 states to 131153 states and 140208 transitions. [2025-03-03 11:03:08,910 INFO L78 Accepts]: Start accepts. Automaton has 131153 states and 140208 transitions. Word has length 567 [2025-03-03 11:03:08,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:08,910 INFO L471 AbstractCegarLoop]: Abstraction has 131153 states and 140208 transitions. [2025-03-03 11:03:08,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 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-03 11:03:08,910 INFO L276 IsEmpty]: Start isEmpty. Operand 131153 states and 140208 transitions. [2025-03-03 11:03:08,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2025-03-03 11:03:08,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:08,933 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:08,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 11:03:08,934 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:08,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:08,934 INFO L85 PathProgramCache]: Analyzing trace with hash 961780607, now seen corresponding path program 1 times [2025-03-03 11:03:08,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:08,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147303154] [2025-03-03 11:03:08,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:08,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:08,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 614 statements into 1 equivalence classes. [2025-03-03 11:03:09,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 614 of 614 statements. [2025-03-03 11:03:09,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:09,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:09,370 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 11:03:09,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:09,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147303154] [2025-03-03 11:03:09,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147303154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:09,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:09,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:09,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489090940] [2025-03-03 11:03:09,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:09,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:09,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:09,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:09,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:09,374 INFO L87 Difference]: Start difference. First operand 131153 states and 140208 transitions. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 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-03 11:03:11,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:11,006 INFO L93 Difference]: Finished difference Result 261430 states and 279201 transitions. [2025-03-03 11:03:11,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:11,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 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 614 [2025-03-03 11:03:11,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:11,176 INFO L225 Difference]: With dead ends: 261430 [2025-03-03 11:03:11,176 INFO L226 Difference]: Without dead ends: 131129 [2025-03-03 11:03:11,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:11,258 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 289 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:11,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 657 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 11:03:11,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131129 states. [2025-03-03 11:03:12,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131129 to 129427. [2025-03-03 11:03:12,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129427 states, 129426 states have (on average 1.061834561834562) internal successors, (137429), 129426 states have internal predecessors, (137429), 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-03 11:03:12,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129427 states to 129427 states and 137429 transitions. [2025-03-03 11:03:12,599 INFO L78 Accepts]: Start accepts. Automaton has 129427 states and 137429 transitions. Word has length 614 [2025-03-03 11:03:12,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:12,600 INFO L471 AbstractCegarLoop]: Abstraction has 129427 states and 137429 transitions. [2025-03-03 11:03:12,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 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-03 11:03:12,600 INFO L276 IsEmpty]: Start isEmpty. Operand 129427 states and 137429 transitions. [2025-03-03 11:03:12,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-03-03 11:03:12,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:12,616 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:03:12,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 11:03:12,616 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:12,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:12,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1708590601, now seen corresponding path program 1 times [2025-03-03 11:03:12,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:12,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788927048] [2025-03-03 11:03:12,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:12,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:12,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-03-03 11:03:12,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-03-03 11:03:12,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:12,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:12,853 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2025-03-03 11:03:12,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:12,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788927048] [2025-03-03 11:03:12,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788927048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:12,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:12,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:12,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558704810] [2025-03-03 11:03:12,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:12,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:12,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:12,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:12,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:12,854 INFO L87 Difference]: Start difference. First operand 129427 states and 137429 transitions. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 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)