./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label06.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem16_label06.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 30e99cc503a65b2b00d0d341e953b7b3e491fbf488860704d5a2cfc226394b22 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:11:51,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:11:51,531 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:11:51,538 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:11:51,538 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:11:51,560 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:11:51,561 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:11:51,561 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:11:51,561 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:11:51,561 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:11:51,561 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:11:51,562 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:11:51,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:11:51,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:11:51,563 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:11:51,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:11:51,564 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:11:51,564 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:11:51,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:11:51,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:11:51,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:11:51,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:11:51,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:11:51,564 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:11:51,564 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:11:51,564 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:11:51,564 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:11:51,564 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:11:51,564 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:11:51,564 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:11:51,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:11:51,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:11:51,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:11:51,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:11:51,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:11:51,565 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:11:51,565 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:11:51,565 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:11:51,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:11:51,565 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:11:51,565 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:11:51,565 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:11:51,565 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:11:51,566 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 -> 30e99cc503a65b2b00d0d341e953b7b3e491fbf488860704d5a2cfc226394b22 [2025-03-16 15:11:51,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:11:51,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:11:51,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:11:51,829 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:11:51,830 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:11:51,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label06.c [2025-03-16 15:11:52,975 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94097f93f/53ddce17c1d640cdafe25c67eeda831d/FLAG00f5965b8 [2025-03-16 15:11:53,375 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:11:53,378 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label06.c [2025-03-16 15:11:53,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94097f93f/53ddce17c1d640cdafe25c67eeda831d/FLAG00f5965b8 [2025-03-16 15:11:53,547 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94097f93f/53ddce17c1d640cdafe25c67eeda831d [2025-03-16 15:11:53,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:11:53,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:11:53,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:11:53,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:11:53,555 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:11:53,556 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:11:53" (1/1) ... [2025-03-16 15:11:53,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c12871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:53, skipping insertion in model container [2025-03-16 15:11:53,558 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:11:53" (1/1) ... [2025-03-16 15:11:53,605 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:11:53,736 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/Problem16_label06.c[1375,1388] [2025-03-16 15:11:53,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:11:54,004 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:11:54,013 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/Problem16_label06.c[1375,1388] [2025-03-16 15:11:54,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:11:54,126 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:11:54,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:54 WrapperNode [2025-03-16 15:11:54,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:11:54,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:11:54,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:11:54,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:11:54,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:54" (1/1) ... [2025-03-16 15:11:54,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:54" (1/1) ... [2025-03-16 15:11:54,261 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-16 15:11:54,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:11:54,262 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:11:54,262 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:11:54,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:11:54,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:54" (1/1) ... [2025-03-16 15:11:54,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:54" (1/1) ... [2025-03-16 15:11:54,285 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:54" (1/1) ... [2025-03-16 15:11:54,325 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:11:54,326 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:54" (1/1) ... [2025-03-16 15:11:54,326 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:54" (1/1) ... [2025-03-16 15:11:54,364 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:54" (1/1) ... [2025-03-16 15:11:54,374 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:54" (1/1) ... [2025-03-16 15:11:54,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:54" (1/1) ... [2025-03-16 15:11:54,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:54" (1/1) ... [2025-03-16 15:11:54,412 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:11:54,414 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:11:54,414 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:11:54,415 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:11:54,415 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:54" (1/1) ... [2025-03-16 15:11:54,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:11:54,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:11:54,440 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 15:11:54,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 15:11:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:11:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:11:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:11:54,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:11:54,514 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:11:54,516 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:11:56,156 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-16 15:11:56,216 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-16 15:11:56,216 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:11:56,237 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:11:56,238 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:11:56,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:11:56 BoogieIcfgContainer [2025-03-16 15:11:56,239 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:11:56,241 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:11:56,241 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:11:56,245 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:11:56,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:11:53" (1/3) ... [2025-03-16 15:11:56,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7145fdb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:11:56, skipping insertion in model container [2025-03-16 15:11:56,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:54" (2/3) ... [2025-03-16 15:11:56,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7145fdb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:11:56, skipping insertion in model container [2025-03-16 15:11:56,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:11:56" (3/3) ... [2025-03-16 15:11:56,247 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label06.c [2025-03-16 15:11:56,259 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:11:56,260 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label06.c that has 1 procedures, 335 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:11:56,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:11:56,359 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;@4da33235, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:11:56,359 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:11:56,363 INFO L276 IsEmpty]: Start isEmpty. Operand has 335 states, 333 states have (on average 1.984984984984985) internal successors, (661), 334 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:56,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-16 15:11:56,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:56,368 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:56,368 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:56,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:56,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1557523618, now seen corresponding path program 1 times [2025-03-16 15:11:56,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:56,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944575208] [2025-03-16 15:11:56,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:56,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:56,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-16 15:11:56,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-16 15:11:56,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:56,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:56,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:11:56,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:56,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944575208] [2025-03-16 15:11:56,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944575208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:56,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:56,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:11:56,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832743939] [2025-03-16 15:11:56,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:56,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:11:56,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:56,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:11:56,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:11:56,510 INFO L87 Difference]: Start difference. First operand has 335 states, 333 states have (on average 1.984984984984985) internal successors, (661), 334 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:56,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:56,561 INFO L93 Difference]: Finished difference Result 669 states and 1321 transitions. [2025-03-16 15:11:56,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:11:56,562 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2025-03-16 15:11:56,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:56,573 INFO L225 Difference]: With dead ends: 669 [2025-03-16 15:11:56,573 INFO L226 Difference]: Without dead ends: 332 [2025-03-16 15:11:56,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:11:56,577 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:56,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:11:56,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-16 15:11:56,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-03-16 15:11:56,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.8006042296072509) internal successors, (596), 331 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:56,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 596 transitions. [2025-03-16 15:11:56,625 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 596 transitions. Word has length 9 [2025-03-16 15:11:56,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:56,625 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 596 transitions. [2025-03-16 15:11:56,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:56,626 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 596 transitions. [2025-03-16 15:11:56,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-16 15:11:56,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:56,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:56,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:11:56,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:56,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:56,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1527940194, now seen corresponding path program 1 times [2025-03-16 15:11:56,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:56,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158934594] [2025-03-16 15:11:56,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:56,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:56,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-16 15:11:56,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-16 15:11:56,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:56,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:56,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:11:56,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:56,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158934594] [2025-03-16 15:11:56,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158934594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:56,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:56,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:11:56,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113814385] [2025-03-16 15:11:56,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:56,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:56,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:56,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:56,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:56,712 INFO L87 Difference]: Start difference. First operand 332 states and 596 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:57,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:57,865 INFO L93 Difference]: Finished difference Result 992 states and 1785 transitions. [2025-03-16 15:11:57,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:57,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2025-03-16 15:11:57,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:57,869 INFO L225 Difference]: With dead ends: 992 [2025-03-16 15:11:57,869 INFO L226 Difference]: Without dead ends: 661 [2025-03-16 15:11:57,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:57,870 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 361 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:57,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 200 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:11:57,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-03-16 15:11:57,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2025-03-16 15:11:57,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.5196969696969698) internal successors, (1003), 660 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:57,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1003 transitions. [2025-03-16 15:11:57,896 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1003 transitions. Word has length 9 [2025-03-16 15:11:57,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:57,896 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 1003 transitions. [2025-03-16 15:11:57,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:57,896 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1003 transitions. [2025-03-16 15:11:57,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 15:11:57,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:57,897 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:57,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:11:57,898 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:57,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:57,898 INFO L85 PathProgramCache]: Analyzing trace with hash -954943000, now seen corresponding path program 1 times [2025-03-16 15:11:57,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:57,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799075510] [2025-03-16 15:11:57,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:57,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:57,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 15:11:57,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 15:11:57,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:57,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:58,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:11:58,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:58,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799075510] [2025-03-16 15:11:58,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799075510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:58,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:58,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:58,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670158206] [2025-03-16 15:11:58,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:58,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:11:58,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:58,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:11:58,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:11:58,231 INFO L87 Difference]: Start difference. First operand 661 states and 1003 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:59,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:59,759 INFO L93 Difference]: Finished difference Result 2308 states and 3413 transitions. [2025-03-16 15:11:59,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:11:59,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-03-16 15:11:59,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:59,764 INFO L225 Difference]: With dead ends: 2308 [2025-03-16 15:11:59,764 INFO L226 Difference]: Without dead ends: 1648 [2025-03-16 15:11:59,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:11:59,766 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1007 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:59,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1007 Valid, 41 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:11:59,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2025-03-16 15:11:59,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1648. [2025-03-16 15:11:59,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1647 states have (on average 1.4019429265330905) internal successors, (2309), 1647 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:59,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2309 transitions. [2025-03-16 15:11:59,799 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2309 transitions. Word has length 77 [2025-03-16 15:11:59,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:59,799 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2309 transitions. [2025-03-16 15:11:59,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:59,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2309 transitions. [2025-03-16 15:11:59,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-16 15:11:59,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:59,805 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:59,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:11:59,805 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:59,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:59,807 INFO L85 PathProgramCache]: Analyzing trace with hash 349357574, now seen corresponding path program 1 times [2025-03-16 15:11:59,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:59,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759851107] [2025-03-16 15:11:59,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:59,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:59,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-16 15:11:59,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-16 15:11:59,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:59,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:11:59,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:59,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759851107] [2025-03-16 15:11:59,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759851107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:59,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:59,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:11:59,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208774517] [2025-03-16 15:11:59,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:59,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:59,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:59,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:59,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:59,976 INFO L87 Difference]: Start difference. First operand 1648 states and 2309 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:01,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:01,045 INFO L93 Difference]: Finished difference Result 3624 states and 5241 transitions. [2025-03-16 15:12:01,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:01,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2025-03-16 15:12:01,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:01,056 INFO L225 Difference]: With dead ends: 3624 [2025-03-16 15:12:01,056 INFO L226 Difference]: Without dead ends: 2306 [2025-03-16 15:12:01,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:01,062 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:01,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 76 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:12:01,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2025-03-16 15:12:01,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2306. [2025-03-16 15:12:01,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2306 states, 2305 states have (on average 1.350108459869848) internal successors, (3112), 2305 states have internal predecessors, (3112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3112 transitions. [2025-03-16 15:12:01,090 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 3112 transitions. Word has length 140 [2025-03-16 15:12:01,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:01,090 INFO L471 AbstractCegarLoop]: Abstraction has 2306 states and 3112 transitions. [2025-03-16 15:12:01,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3112 transitions. [2025-03-16 15:12:01,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-16 15:12:01,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:01,092 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:01,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:12:01,092 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:01,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:01,093 INFO L85 PathProgramCache]: Analyzing trace with hash 87065586, now seen corresponding path program 1 times [2025-03-16 15:12:01,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:01,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119979541] [2025-03-16 15:12:01,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:01,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:01,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-16 15:12:01,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-16 15:12:01,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:01,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:01,261 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-16 15:12:01,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:01,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119979541] [2025-03-16 15:12:01,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119979541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:01,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:01,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:12:01,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246958308] [2025-03-16 15:12:01,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:01,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:01,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:01,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:01,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:01,263 INFO L87 Difference]: Start difference. First operand 2306 states and 3112 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:02,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:02,160 INFO L93 Difference]: Finished difference Result 5598 states and 7698 transitions. [2025-03-16 15:12:02,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:02,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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 175 [2025-03-16 15:12:02,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:02,202 INFO L225 Difference]: With dead ends: 5598 [2025-03-16 15:12:02,203 INFO L226 Difference]: Without dead ends: 3622 [2025-03-16 15:12:02,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:02,205 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:02,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 154 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:12:02,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3622 states. [2025-03-16 15:12:02,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3622 to 2964. [2025-03-16 15:12:02,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2964 states, 2963 states have (on average 1.2443469456631793) internal successors, (3687), 2963 states have internal predecessors, (3687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:02,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2964 states to 2964 states and 3687 transitions. [2025-03-16 15:12:02,249 INFO L78 Accepts]: Start accepts. Automaton has 2964 states and 3687 transitions. Word has length 175 [2025-03-16 15:12:02,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:02,250 INFO L471 AbstractCegarLoop]: Abstraction has 2964 states and 3687 transitions. [2025-03-16 15:12:02,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:02,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2964 states and 3687 transitions. [2025-03-16 15:12:02,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-16 15:12:02,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:02,255 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:02,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:12:02,256 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:02,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:02,256 INFO L85 PathProgramCache]: Analyzing trace with hash -588438856, now seen corresponding path program 1 times [2025-03-16 15:12:02,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:02,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357940678] [2025-03-16 15:12:02,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:02,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:02,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-16 15:12:02,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-16 15:12:02,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:02,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:02,416 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:12:02,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:02,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357940678] [2025-03-16 15:12:02,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357940678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:02,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:02,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:02,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591024054] [2025-03-16 15:12:02,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:02,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:02,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:02,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:02,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:02,418 INFO L87 Difference]: Start difference. First operand 2964 states and 3687 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-16 15:12:03,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:03,226 INFO L93 Difference]: Finished difference Result 6914 states and 8656 transitions. [2025-03-16 15:12:03,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:03,226 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-16 15:12:03,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:03,235 INFO L225 Difference]: With dead ends: 6914 [2025-03-16 15:12:03,235 INFO L226 Difference]: Without dead ends: 3951 [2025-03-16 15:12:03,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:03,239 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 287 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:03,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 537 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:12:03,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2025-03-16 15:12:03,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3951. [2025-03-16 15:12:03,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3951 states, 3950 states have (on average 1.0736708860759494) internal successors, (4241), 3950 states have internal predecessors, (4241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:03,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 4241 transitions. [2025-03-16 15:12:03,288 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 4241 transitions. Word has length 192 [2025-03-16 15:12:03,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:03,288 INFO L471 AbstractCegarLoop]: Abstraction has 3951 states and 4241 transitions. [2025-03-16 15:12:03,289 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-16 15:12:03,289 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 4241 transitions. [2025-03-16 15:12:03,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-03-16 15:12:03,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:03,294 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:03,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:12:03,294 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:03,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:03,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1999536642, now seen corresponding path program 1 times [2025-03-16 15:12:03,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:03,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540936428] [2025-03-16 15:12:03,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:03,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:03,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-16 15:12:03,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-16 15:12:03,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:03,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:03,480 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 15:12:03,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:03,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540936428] [2025-03-16 15:12:03,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540936428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:03,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:03,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:12:03,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406376768] [2025-03-16 15:12:03,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:03,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:03,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:03,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:03,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:03,481 INFO L87 Difference]: Start difference. First operand 3951 states and 4241 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:04,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:04,177 INFO L93 Difference]: Finished difference Result 10862 states and 11724 transitions. [2025-03-16 15:12:04,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:04,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 244 [2025-03-16 15:12:04,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:04,192 INFO L225 Difference]: With dead ends: 10862 [2025-03-16 15:12:04,192 INFO L226 Difference]: Without dead ends: 6912 [2025-03-16 15:12:04,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:04,196 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 98 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:04,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 48 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:12:04,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6912 states. [2025-03-16 15:12:04,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6912 to 6912. [2025-03-16 15:12:04,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6912 states, 6911 states have (on average 1.0735060049196932) internal successors, (7419), 6911 states have internal predecessors, (7419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:04,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6912 states to 6912 states and 7419 transitions. [2025-03-16 15:12:04,270 INFO L78 Accepts]: Start accepts. Automaton has 6912 states and 7419 transitions. Word has length 244 [2025-03-16 15:12:04,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:04,270 INFO L471 AbstractCegarLoop]: Abstraction has 6912 states and 7419 transitions. [2025-03-16 15:12:04,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:04,270 INFO L276 IsEmpty]: Start isEmpty. Operand 6912 states and 7419 transitions. [2025-03-16 15:12:04,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-16 15:12:04,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:04,273 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:04,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:12:04,273 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:04,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:04,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1047118670, now seen corresponding path program 1 times [2025-03-16 15:12:04,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:04,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028750964] [2025-03-16 15:12:04,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:04,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:04,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-16 15:12:04,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-16 15:12:04,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:04,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:04,463 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-16 15:12:04,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:04,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028750964] [2025-03-16 15:12:04,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028750964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:04,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:04,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:04,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286552051] [2025-03-16 15:12:04,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:04,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:04,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:04,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:04,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:04,465 INFO L87 Difference]: Start difference. First operand 6912 states and 7419 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:05,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:05,183 INFO L93 Difference]: Finished difference Result 16126 states and 17344 transitions. [2025-03-16 15:12:05,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:05,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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 348 [2025-03-16 15:12:05,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:05,208 INFO L225 Difference]: With dead ends: 16126 [2025-03-16 15:12:05,208 INFO L226 Difference]: Without dead ends: 9215 [2025-03-16 15:12:05,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:05,214 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 322 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:05,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 424 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:12:05,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9215 states. [2025-03-16 15:12:05,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9215 to 9215. [2025-03-16 15:12:05,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9215 states, 9214 states have (on average 1.066746255697851) internal successors, (9829), 9214 states have internal predecessors, (9829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:05,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9215 states to 9215 states and 9829 transitions. [2025-03-16 15:12:05,310 INFO L78 Accepts]: Start accepts. Automaton has 9215 states and 9829 transitions. Word has length 348 [2025-03-16 15:12:05,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:05,311 INFO L471 AbstractCegarLoop]: Abstraction has 9215 states and 9829 transitions. [2025-03-16 15:12:05,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:05,311 INFO L276 IsEmpty]: Start isEmpty. Operand 9215 states and 9829 transitions. [2025-03-16 15:12:05,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-16 15:12:05,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:05,315 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:05,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:12:05,315 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:05,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:05,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1427364260, now seen corresponding path program 1 times [2025-03-16 15:12:05,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:05,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376343769] [2025-03-16 15:12:05,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:05,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:05,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-16 15:12:05,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-16 15:12:05,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:05,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:12:05,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:05,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376343769] [2025-03-16 15:12:05,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376343769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:05,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:05,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:05,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844472041] [2025-03-16 15:12:05,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:05,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:05,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:05,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:05,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:05,564 INFO L87 Difference]: Start difference. First operand 9215 states and 9829 transitions. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:06,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:06,246 INFO L93 Difference]: Finished difference Result 18100 states and 19326 transitions. [2025-03-16 15:12:06,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:06,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 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 403 [2025-03-16 15:12:06,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:06,268 INFO L225 Difference]: With dead ends: 18100 [2025-03-16 15:12:06,268 INFO L226 Difference]: Without dead ends: 9215 [2025-03-16 15:12:06,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:06,276 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 188 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:06,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 51 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:12:06,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9215 states. [2025-03-16 15:12:06,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9215 to 9215. [2025-03-16 15:12:06,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9215 states, 9214 states have (on average 1.0533970045582808) internal successors, (9706), 9214 states have internal predecessors, (9706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:06,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9215 states to 9215 states and 9706 transitions. [2025-03-16 15:12:06,361 INFO L78 Accepts]: Start accepts. Automaton has 9215 states and 9706 transitions. Word has length 403 [2025-03-16 15:12:06,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:06,362 INFO L471 AbstractCegarLoop]: Abstraction has 9215 states and 9706 transitions. [2025-03-16 15:12:06,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:06,363 INFO L276 IsEmpty]: Start isEmpty. Operand 9215 states and 9706 transitions. [2025-03-16 15:12:06,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-03-16 15:12:06,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:06,368 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:06,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:12:06,368 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:06,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:06,371 INFO L85 PathProgramCache]: Analyzing trace with hash 2115688626, now seen corresponding path program 1 times [2025-03-16 15:12:06,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:06,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283633120] [2025-03-16 15:12:06,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:06,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:06,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-03-16 15:12:06,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-03-16 15:12:06,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:06,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:06,695 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:12:06,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:06,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283633120] [2025-03-16 15:12:06,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283633120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:06,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:06,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:06,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848279743] [2025-03-16 15:12:06,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:06,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:12:06,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:06,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:12:06,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:12:06,697 INFO L87 Difference]: Start difference. First operand 9215 states and 9706 transitions. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:07,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:07,784 INFO L93 Difference]: Finished difference Result 25338 states and 26682 transitions. [2025-03-16 15:12:07,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:12:07,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 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-16 15:12:07,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:07,808 INFO L225 Difference]: With dead ends: 25338 [2025-03-16 15:12:07,808 INFO L226 Difference]: Without dead ends: 16453 [2025-03-16 15:12:07,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:12:07,818 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 186 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1643 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:07,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 68 Invalid, 1738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1643 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:12:07,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16453 states. [2025-03-16 15:12:07,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16453 to 15137. [2025-03-16 15:12:07,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15137 states, 15136 states have (on average 1.050607822410148) internal successors, (15902), 15136 states have internal predecessors, (15902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:07,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15137 states to 15137 states and 15902 transitions. [2025-03-16 15:12:07,954 INFO L78 Accepts]: Start accepts. Automaton has 15137 states and 15902 transitions. Word has length 487 [2025-03-16 15:12:07,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:07,954 INFO L471 AbstractCegarLoop]: Abstraction has 15137 states and 15902 transitions. [2025-03-16 15:12:07,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:07,955 INFO L276 IsEmpty]: Start isEmpty. Operand 15137 states and 15902 transitions. [2025-03-16 15:12:07,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2025-03-16 15:12:07,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:07,960 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:12:07,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:12:07,960 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:07,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:07,961 INFO L85 PathProgramCache]: Analyzing trace with hash 821302700, now seen corresponding path program 1 times [2025-03-16 15:12:07,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:07,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812604918] [2025-03-16 15:12:07,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:07,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:07,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-03-16 15:12:08,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-03-16 15:12:08,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:08,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:08,209 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-16 15:12:08,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:08,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812604918] [2025-03-16 15:12:08,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812604918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:08,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:08,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:08,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287843927] [2025-03-16 15:12:08,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:08,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:08,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:08,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:08,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:08,211 INFO L87 Difference]: Start difference. First operand 15137 states and 15902 transitions. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 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-16 15:12:08,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:08,815 INFO L93 Difference]: Finished difference Result 32905 states and 34584 transitions. [2025-03-16 15:12:08,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:08,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 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 507 [2025-03-16 15:12:08,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:08,837 INFO L225 Difference]: With dead ends: 32905 [2025-03-16 15:12:08,837 INFO L226 Difference]: Without dead ends: 18427 [2025-03-16 15:12:08,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:08,850 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 188 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:08,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 36 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:12:08,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18427 states. [2025-03-16 15:12:08,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18427 to 17769. [2025-03-16 15:12:08,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17769 states, 17768 states have (on average 1.0468257541647907) internal successors, (18600), 17768 states have internal predecessors, (18600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:09,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17769 states to 17769 states and 18600 transitions. [2025-03-16 15:12:09,005 INFO L78 Accepts]: Start accepts. Automaton has 17769 states and 18600 transitions. Word has length 507 [2025-03-16 15:12:09,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:09,006 INFO L471 AbstractCegarLoop]: Abstraction has 17769 states and 18600 transitions. [2025-03-16 15:12:09,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 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-16 15:12:09,006 INFO L276 IsEmpty]: Start isEmpty. Operand 17769 states and 18600 transitions. [2025-03-16 15:12:09,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2025-03-16 15:12:09,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:09,011 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:12:09,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:12:09,011 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:09,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:09,011 INFO L85 PathProgramCache]: Analyzing trace with hash -997774285, now seen corresponding path program 1 times [2025-03-16 15:12:09,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:09,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205811864] [2025-03-16 15:12:09,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:09,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:09,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 561 statements into 1 equivalence classes. [2025-03-16 15:12:09,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 561 of 561 statements. [2025-03-16 15:12:09,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:09,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:09,516 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 15:12:09,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:09,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205811864] [2025-03-16 15:12:09,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205811864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:09,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:09,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:09,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059388555] [2025-03-16 15:12:09,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:09,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:12:09,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:09,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:12:09,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:12:09,520 INFO L87 Difference]: Start difference. First operand 17769 states and 18600 transitions. Second operand has 4 states, 4 states have (on average 138.5) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:10,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:10,103 INFO L93 Difference]: Finished difference Result 34879 states and 36531 transitions. [2025-03-16 15:12:10,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:10,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 138.5) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 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 561 [2025-03-16 15:12:10,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:10,121 INFO L225 Difference]: With dead ends: 34879 [2025-03-16 15:12:10,121 INFO L226 Difference]: Without dead ends: 17769 [2025-03-16 15:12:10,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:12:10,136 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 267 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:10,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 107 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:12:10,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17769 states. [2025-03-16 15:12:10,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17769 to 17769. [2025-03-16 15:12:10,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17769 states, 17768 states have (on average 1.0466006303466906) internal successors, (18596), 17768 states have internal predecessors, (18596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:10,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17769 states to 17769 states and 18596 transitions. [2025-03-16 15:12:10,283 INFO L78 Accepts]: Start accepts. Automaton has 17769 states and 18596 transitions. Word has length 561 [2025-03-16 15:12:10,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:10,284 INFO L471 AbstractCegarLoop]: Abstraction has 17769 states and 18596 transitions. [2025-03-16 15:12:10,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.5) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:10,285 INFO L276 IsEmpty]: Start isEmpty. Operand 17769 states and 18596 transitions. [2025-03-16 15:12:10,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2025-03-16 15:12:10,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:10,289 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:12:10,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:12:10,290 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:10,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:10,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1302797160, now seen corresponding path program 1 times [2025-03-16 15:12:10,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:10,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851991425] [2025-03-16 15:12:10,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:10,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:10,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-03-16 15:12:10,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-03-16 15:12:10,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:10,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:10,619 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2025-03-16 15:12:10,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:10,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851991425] [2025-03-16 15:12:10,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851991425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:10,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:10,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:10,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31185591] [2025-03-16 15:12:10,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:10,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:10,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:10,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:10,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:10,621 INFO L87 Difference]: Start difference. First operand 17769 states and 18596 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:11,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:11,190 INFO L93 Difference]: Finished difference Result 34879 states and 36527 transitions. [2025-03-16 15:12:11,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:11,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 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 622 [2025-03-16 15:12:11,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:11,213 INFO L225 Difference]: With dead ends: 34879 [2025-03-16 15:12:11,213 INFO L226 Difference]: Without dead ends: 17769 [2025-03-16 15:12:11,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:11,225 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 337 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:11,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 420 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:12:11,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17769 states. [2025-03-16 15:12:11,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17769 to 16453. [2025-03-16 15:12:11,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16453 states, 16452 states have (on average 1.0444322878677363) internal successors, (17183), 16452 states have internal predecessors, (17183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:11,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16453 states to 16453 states and 17183 transitions. [2025-03-16 15:12:11,361 INFO L78 Accepts]: Start accepts. Automaton has 16453 states and 17183 transitions. Word has length 622 [2025-03-16 15:12:11,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:11,361 INFO L471 AbstractCegarLoop]: Abstraction has 16453 states and 17183 transitions. [2025-03-16 15:12:11,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:11,361 INFO L276 IsEmpty]: Start isEmpty. Operand 16453 states and 17183 transitions. [2025-03-16 15:12:11,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 821 [2025-03-16 15:12:11,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:11,369 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:11,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:12:11,370 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:11,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:11,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1820233121, now seen corresponding path program 1 times [2025-03-16 15:12:11,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:11,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531549746] [2025-03-16 15:12:11,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:11,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:11,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 820 statements into 1 equivalence classes. [2025-03-16 15:12:11,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 820 of 820 statements. [2025-03-16 15:12:11,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:11,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 24 proven. 555 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2025-03-16 15:12:12,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:12,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531549746] [2025-03-16 15:12:12,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531549746] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:12:12,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370266729] [2025-03-16 15:12:12,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:12,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:12:12,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:12:12,104 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:12:12,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 15:12:12,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 820 statements into 1 equivalence classes. [2025-03-16 15:12:12,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 820 of 820 statements. [2025-03-16 15:12:12,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:12,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:12,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:12:12,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:12:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 923 trivial. 0 not checked. [2025-03-16 15:12:12,362 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:12:12,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370266729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:12,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:12:12,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-16 15:12:12,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244664770] [2025-03-16 15:12:12,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:12,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:12,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:12,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:12,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:12:12,365 INFO L87 Difference]: Start difference. First operand 16453 states and 17183 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:12,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:12,928 INFO L93 Difference]: Finished difference Result 32247 states and 33701 transitions. [2025-03-16 15:12:12,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:12,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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 820 [2025-03-16 15:12:12,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:12,940 INFO L225 Difference]: With dead ends: 32247 [2025-03-16 15:12:12,940 INFO L226 Difference]: Without dead ends: 16453 [2025-03-16 15:12:12,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 824 GetRequests, 820 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:12:12,949 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 357 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:12,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 375 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:12:12,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16453 states. [2025-03-16 15:12:13,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16453 to 16453. [2025-03-16 15:12:13,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16453 states, 16452 states have (on average 1.037503039144177) internal successors, (17069), 16452 states have internal predecessors, (17069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:13,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16453 states to 16453 states and 17069 transitions. [2025-03-16 15:12:13,064 INFO L78 Accepts]: Start accepts. Automaton has 16453 states and 17069 transitions. Word has length 820 [2025-03-16 15:12:13,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:13,065 INFO L471 AbstractCegarLoop]: Abstraction has 16453 states and 17069 transitions. [2025-03-16 15:12:13,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:13,065 INFO L276 IsEmpty]: Start isEmpty. Operand 16453 states and 17069 transitions. [2025-03-16 15:12:13,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1222 [2025-03-16 15:12:13,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:13,114 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:13,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 15:12:13,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-16 15:12:13,315 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:13,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:13,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1225841217, now seen corresponding path program 1 times [2025-03-16 15:12:13,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:13,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625625925] [2025-03-16 15:12:13,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:13,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:13,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1221 statements into 1 equivalence classes. [2025-03-16 15:12:13,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1221 of 1221 statements. [2025-03-16 15:12:13,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:13,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:13,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 1845 proven. 0 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2025-03-16 15:12:13,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:13,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625625925] [2025-03-16 15:12:13,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625625925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:13,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:13,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:13,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520772449] [2025-03-16 15:12:13,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:13,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:13,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:13,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:13,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:13,818 INFO L87 Difference]: Start difference. First operand 16453 states and 17069 transitions. Second operand has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:14,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:14,413 INFO L93 Difference]: Finished difference Result 35537 states and 36891 transitions. [2025-03-16 15:12:14,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:14,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 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 1221 [2025-03-16 15:12:14,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:14,430 INFO L225 Difference]: With dead ends: 35537 [2025-03-16 15:12:14,430 INFO L226 Difference]: Without dead ends: 19743 [2025-03-16 15:12:14,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:14,442 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 220 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:14,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 430 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:12:14,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19743 states. [2025-03-16 15:12:14,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19743 to 17440. [2025-03-16 15:12:14,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17440 states, 17439 states have (on average 1.032972074086817) internal successors, (18014), 17439 states have internal predecessors, (18014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:14,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17440 states to 17440 states and 18014 transitions. [2025-03-16 15:12:14,619 INFO L78 Accepts]: Start accepts. Automaton has 17440 states and 18014 transitions. Word has length 1221 [2025-03-16 15:12:14,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:14,620 INFO L471 AbstractCegarLoop]: Abstraction has 17440 states and 18014 transitions. [2025-03-16 15:12:14,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:14,620 INFO L276 IsEmpty]: Start isEmpty. Operand 17440 states and 18014 transitions. [2025-03-16 15:12:14,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1223 [2025-03-16 15:12:14,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:14,634 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:14,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:12:14,634 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:14,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:14,635 INFO L85 PathProgramCache]: Analyzing trace with hash -115657591, now seen corresponding path program 1 times [2025-03-16 15:12:14,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:14,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209285538] [2025-03-16 15:12:14,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:14,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:14,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1222 statements into 1 equivalence classes. [2025-03-16 15:12:14,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1222 of 1222 statements. [2025-03-16 15:12:14,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:14,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2593 backedges. 1849 proven. 0 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2025-03-16 15:12:15,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:15,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209285538] [2025-03-16 15:12:15,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209285538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:15,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:15,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 15:12:15,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812260166] [2025-03-16 15:12:15,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:15,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 15:12:15,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:15,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 15:12:15,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:12:15,601 INFO L87 Difference]: Start difference. First operand 17440 states and 18014 transitions. Second operand has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:16,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:16,480 INFO L93 Difference]: Finished difference Result 34222 states and 35364 transitions. [2025-03-16 15:12:16,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 15:12:16,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 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 1222 [2025-03-16 15:12:16,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:16,497 INFO L225 Difference]: With dead ends: 34222 [2025-03-16 15:12:16,497 INFO L226 Difference]: Without dead ends: 17441 [2025-03-16 15:12:16,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:12:16,508 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 357 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 1802 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 1806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:16,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 566 Invalid, 1806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1802 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:12:16,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17441 states. [2025-03-16 15:12:16,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17441 to 17440. [2025-03-16 15:12:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17440 states, 17439 states have (on average 1.0327427031366478) internal successors, (18010), 17439 states have internal predecessors, (18010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:16,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17440 states to 17440 states and 18010 transitions. [2025-03-16 15:12:16,618 INFO L78 Accepts]: Start accepts. Automaton has 17440 states and 18010 transitions. Word has length 1222 [2025-03-16 15:12:16,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:16,618 INFO L471 AbstractCegarLoop]: Abstraction has 17440 states and 18010 transitions. [2025-03-16 15:12:16,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:16,618 INFO L276 IsEmpty]: Start isEmpty. Operand 17440 states and 18010 transitions. [2025-03-16 15:12:16,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1227 [2025-03-16 15:12:16,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:16,632 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 15:12:16,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:12:16,632 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:16,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:16,633 INFO L85 PathProgramCache]: Analyzing trace with hash -698343806, now seen corresponding path program 1 times [2025-03-16 15:12:16,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:16,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384743379] [2025-03-16 15:12:16,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:16,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:16,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1226 statements into 1 equivalence classes. [2025-03-16 15:12:16,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1226 of 1226 statements. [2025-03-16 15:12:16,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:16,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:17,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3093 backedges. 2134 proven. 0 refuted. 0 times theorem prover too weak. 959 trivial. 0 not checked. [2025-03-16 15:12:17,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:17,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384743379] [2025-03-16 15:12:17,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384743379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:17,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:17,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:17,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970011363] [2025-03-16 15:12:17,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:17,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:17,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:17,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:17,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:17,143 INFO L87 Difference]: Start difference. First operand 17440 states and 18010 transitions. Second operand has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:17,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:17,708 INFO L93 Difference]: Finished difference Result 34221 states and 35355 transitions. [2025-03-16 15:12:17,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:17,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 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 1226 [2025-03-16 15:12:17,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:17,724 INFO L225 Difference]: With dead ends: 34221 [2025-03-16 15:12:17,724 INFO L226 Difference]: Without dead ends: 17440 [2025-03-16 15:12:17,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:17,734 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 193 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:17,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 426 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:12:17,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17440 states. [2025-03-16 15:12:17,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17440 to 16453. [2025-03-16 15:12:17,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16453 states, 16452 states have (on average 1.0302698760029176) internal successors, (16950), 16452 states have internal predecessors, (16950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:17,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16453 states to 16453 states and 16950 transitions. [2025-03-16 15:12:17,845 INFO L78 Accepts]: Start accepts. Automaton has 16453 states and 16950 transitions. Word has length 1226 [2025-03-16 15:12:17,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:17,846 INFO L471 AbstractCegarLoop]: Abstraction has 16453 states and 16950 transitions. [2025-03-16 15:12:17,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:17,846 INFO L276 IsEmpty]: Start isEmpty. Operand 16453 states and 16950 transitions. [2025-03-16 15:12:17,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1237 [2025-03-16 15:12:17,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:17,859 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:17,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:12:17,859 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:17,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:17,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1405212016, now seen corresponding path program 1 times [2025-03-16 15:12:17,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:17,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77798850] [2025-03-16 15:12:17,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:17,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:17,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1236 statements into 1 equivalence classes. [2025-03-16 15:12:17,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1236 of 1236 statements. [2025-03-16 15:12:17,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:17,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:19,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2510 backedges. 1803 proven. 0 refuted. 0 times theorem prover too weak. 707 trivial. 0 not checked. [2025-03-16 15:12:19,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:19,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77798850] [2025-03-16 15:12:19,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77798850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:19,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:19,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:12:19,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460279009] [2025-03-16 15:12:19,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:19,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:12:19,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:19,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:12:19,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:12:19,101 INFO L87 Difference]: Start difference. First operand 16453 states and 16950 transitions. Second operand has 4 states, 4 states have (on average 182.75) internal successors, (731), 4 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:19,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:19,974 INFO L93 Difference]: Finished difference Result 32259 states and 33247 transitions. [2025-03-16 15:12:19,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:12:19,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 182.75) internal successors, (731), 4 states have internal predecessors, (731), 0 states have call successors, (0), 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 1236 [2025-03-16 15:12:19,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:19,989 INFO L225 Difference]: With dead ends: 32259 [2025-03-16 15:12:19,989 INFO L226 Difference]: Without dead ends: 16465 [2025-03-16 15:12:19,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:12:19,997 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 217 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:19,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 444 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:12:20,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16465 states. [2025-03-16 15:12:20,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16465 to 16453. [2025-03-16 15:12:20,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16453 states, 16452 states have (on average 1.0300267444687576) internal successors, (16946), 16452 states have internal predecessors, (16946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:20,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16453 states to 16453 states and 16946 transitions. [2025-03-16 15:12:20,102 INFO L78 Accepts]: Start accepts. Automaton has 16453 states and 16946 transitions. Word has length 1236 [2025-03-16 15:12:20,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:20,103 INFO L471 AbstractCegarLoop]: Abstraction has 16453 states and 16946 transitions. [2025-03-16 15:12:20,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 182.75) internal successors, (731), 4 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:20,103 INFO L276 IsEmpty]: Start isEmpty. Operand 16453 states and 16946 transitions. [2025-03-16 15:12:20,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1252 [2025-03-16 15:12:20,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:20,116 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:20,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:12:20,116 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:20,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:20,116 INFO L85 PathProgramCache]: Analyzing trace with hash 472833179, now seen corresponding path program 1 times [2025-03-16 15:12:20,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:20,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333102046] [2025-03-16 15:12:20,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:20,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:20,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1251 statements into 1 equivalence classes. [2025-03-16 15:12:20,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1251 of 1251 statements. [2025-03-16 15:12:20,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:20,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:20,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3245 backedges. 1864 proven. 0 refuted. 0 times theorem prover too weak. 1381 trivial. 0 not checked. [2025-03-16 15:12:20,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:20,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333102046] [2025-03-16 15:12:20,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333102046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:20,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:20,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:20,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589064599] [2025-03-16 15:12:20,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:20,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:20,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:20,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:20,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:20,910 INFO L87 Difference]: Start difference. First operand 16453 states and 16946 transitions. Second operand has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:21,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:21,432 INFO L93 Difference]: Finished difference Result 32905 states and 33893 transitions. [2025-03-16 15:12:21,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:21,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 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 1251 [2025-03-16 15:12:21,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:21,448 INFO L225 Difference]: With dead ends: 32905 [2025-03-16 15:12:21,449 INFO L226 Difference]: Without dead ends: 17111 [2025-03-16 15:12:21,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:21,458 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 224 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:21,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 439 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:12:21,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17111 states. [2025-03-16 15:12:21,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17111 to 17111. [2025-03-16 15:12:21,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17111 states, 17110 states have (on average 1.029105786090006) internal successors, (17608), 17110 states have internal predecessors, (17608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:21,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17111 states to 17111 states and 17608 transitions. [2025-03-16 15:12:21,575 INFO L78 Accepts]: Start accepts. Automaton has 17111 states and 17608 transitions. Word has length 1251 [2025-03-16 15:12:21,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:21,576 INFO L471 AbstractCegarLoop]: Abstraction has 17111 states and 17608 transitions. [2025-03-16 15:12:21,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:21,576 INFO L276 IsEmpty]: Start isEmpty. Operand 17111 states and 17608 transitions. [2025-03-16 15:12:21,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1277 [2025-03-16 15:12:21,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:21,589 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:21,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:12:21,589 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:21,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:21,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1160906208, now seen corresponding path program 1 times [2025-03-16 15:12:21,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:21,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066341929] [2025-03-16 15:12:21,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:21,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:21,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1276 statements into 1 equivalence classes. [2025-03-16 15:12:21,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1276 of 1276 statements. [2025-03-16 15:12:21,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:21,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:22,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2836 backedges. 1959 proven. 0 refuted. 0 times theorem prover too weak. 877 trivial. 0 not checked. [2025-03-16 15:12:22,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:22,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066341929] [2025-03-16 15:12:22,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066341929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:22,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:22,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:12:22,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416683013] [2025-03-16 15:12:22,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:22,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:12:22,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:22,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:12:22,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:12:22,359 INFO L87 Difference]: Start difference. First operand 17111 states and 17608 transitions. Second operand has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:23,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:23,031 INFO L93 Difference]: Finished difference Result 33563 states and 34551 transitions. [2025-03-16 15:12:23,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:12:23,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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 1276 [2025-03-16 15:12:23,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:23,046 INFO L225 Difference]: With dead ends: 33563 [2025-03-16 15:12:23,046 INFO L226 Difference]: Without dead ends: 17111 [2025-03-16 15:12:23,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:12:23,056 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 120 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:23,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 564 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1327 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:12:23,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17111 states. [2025-03-16 15:12:23,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17111 to 17111. [2025-03-16 15:12:23,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17111 states, 17110 states have (on average 1.0285213325540619) internal successors, (17598), 17110 states have internal predecessors, (17598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:23,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17111 states to 17111 states and 17598 transitions. [2025-03-16 15:12:23,167 INFO L78 Accepts]: Start accepts. Automaton has 17111 states and 17598 transitions. Word has length 1276 [2025-03-16 15:12:23,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:23,168 INFO L471 AbstractCegarLoop]: Abstraction has 17111 states and 17598 transitions. [2025-03-16 15:12:23,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:23,168 INFO L276 IsEmpty]: Start isEmpty. Operand 17111 states and 17598 transitions. [2025-03-16 15:12:23,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1306 [2025-03-16 15:12:23,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:23,179 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:23,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 15:12:23,179 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:23,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:23,180 INFO L85 PathProgramCache]: Analyzing trace with hash 383161504, now seen corresponding path program 1 times [2025-03-16 15:12:23,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:23,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69766254] [2025-03-16 15:12:23,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:23,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:23,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1305 statements into 1 equivalence classes. [2025-03-16 15:12:23,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1305 of 1305 statements. [2025-03-16 15:12:23,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:23,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:24,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3264 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 2728 trivial. 0 not checked. [2025-03-16 15:12:24,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:24,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69766254] [2025-03-16 15:12:24,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69766254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:24,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:24,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:24,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346986172] [2025-03-16 15:12:24,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:24,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:24,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:24,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:24,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:24,224 INFO L87 Difference]: Start difference. First operand 17111 states and 17598 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:24,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:24,741 INFO L93 Difference]: Finished difference Result 33892 states and 34864 transitions. [2025-03-16 15:12:24,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:24,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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 1305 [2025-03-16 15:12:24,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:24,754 INFO L225 Difference]: With dead ends: 33892 [2025-03-16 15:12:24,754 INFO L226 Difference]: Without dead ends: 17111 [2025-03-16 15:12:24,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:24,763 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 272 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:24,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 372 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:12:24,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17111 states. [2025-03-16 15:12:24,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17111 to 16453. [2025-03-16 15:12:24,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16453 states, 16452 states have (on average 1.024920982251398) internal successors, (16862), 16452 states have internal predecessors, (16862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:24,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16453 states to 16453 states and 16862 transitions. [2025-03-16 15:12:24,858 INFO L78 Accepts]: Start accepts. Automaton has 16453 states and 16862 transitions. Word has length 1305 [2025-03-16 15:12:24,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:24,858 INFO L471 AbstractCegarLoop]: Abstraction has 16453 states and 16862 transitions. [2025-03-16 15:12:24,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:24,858 INFO L276 IsEmpty]: Start isEmpty. Operand 16453 states and 16862 transitions. [2025-03-16 15:12:24,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1404 [2025-03-16 15:12:24,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:24,893 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:24,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 15:12:24,893 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:24,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:24,894 INFO L85 PathProgramCache]: Analyzing trace with hash -871570229, now seen corresponding path program 1 times [2025-03-16 15:12:24,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:24,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639725156] [2025-03-16 15:12:24,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:24,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:24,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1403 statements into 1 equivalence classes. [2025-03-16 15:12:24,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1403 of 1403 statements. [2025-03-16 15:12:24,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:24,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:25,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3737 backedges. 1001 proven. 0 refuted. 0 times theorem prover too weak. 2736 trivial. 0 not checked. [2025-03-16 15:12:25,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:25,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639725156] [2025-03-16 15:12:25,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639725156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:25,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:25,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:25,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610849390] [2025-03-16 15:12:25,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:25,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:25,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:25,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:25,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:25,421 INFO L87 Difference]: Start difference. First operand 16453 states and 16862 transitions. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:25,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:25,943 INFO L93 Difference]: Finished difference Result 32905 states and 33731 transitions. [2025-03-16 15:12:25,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:25,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 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 1403 [2025-03-16 15:12:25,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:25,958 INFO L225 Difference]: With dead ends: 32905 [2025-03-16 15:12:25,958 INFO L226 Difference]: Without dead ends: 15795 [2025-03-16 15:12:25,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:25,968 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 168 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:25,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 420 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:12:25,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15795 states. [2025-03-16 15:12:26,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15795 to 15466. [2025-03-16 15:12:26,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15466 states, 15465 states have (on average 1.019592628516004) internal successors, (15768), 15465 states have internal predecessors, (15768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:26,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15466 states to 15466 states and 15768 transitions. [2025-03-16 15:12:26,065 INFO L78 Accepts]: Start accepts. Automaton has 15466 states and 15768 transitions. Word has length 1403 [2025-03-16 15:12:26,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:26,066 INFO L471 AbstractCegarLoop]: Abstraction has 15466 states and 15768 transitions. [2025-03-16 15:12:26,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:26,066 INFO L276 IsEmpty]: Start isEmpty. Operand 15466 states and 15768 transitions. [2025-03-16 15:12:26,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1723 [2025-03-16 15:12:26,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:26,082 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:12:26,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 15:12:26,082 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:26,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:26,083 INFO L85 PathProgramCache]: Analyzing trace with hash 894701140, now seen corresponding path program 1 times [2025-03-16 15:12:26,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:26,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144559941] [2025-03-16 15:12:26,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:26,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:26,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1722 statements into 1 equivalence classes. [2025-03-16 15:12:26,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1722 of 1722 statements. [2025-03-16 15:12:26,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:26,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:27,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4650 backedges. 3204 proven. 202 refuted. 0 times theorem prover too weak. 1244 trivial. 0 not checked. [2025-03-16 15:12:27,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:27,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144559941] [2025-03-16 15:12:27,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144559941] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:12:27,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856393100] [2025-03-16 15:12:27,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:27,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:12:27,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:12:27,205 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:12:27,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 15:12:27,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1722 statements into 1 equivalence classes. [2025-03-16 15:12:27,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1722 of 1722 statements. [2025-03-16 15:12:27,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:27,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:27,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 1956 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 15:12:27,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:12:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4650 backedges. 2227 proven. 201 refuted. 0 times theorem prover too weak. 2222 trivial. 0 not checked. [2025-03-16 15:12:29,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:12:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4650 backedges. 2227 proven. 201 refuted. 0 times theorem prover too weak. 2222 trivial. 0 not checked. [2025-03-16 15:12:32,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856393100] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:12:32,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:12:32,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-03-16 15:12:32,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001032729] [2025-03-16 15:12:32,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:12:32,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 15:12:32,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:32,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 15:12:32,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:12:32,333 INFO L87 Difference]: Start difference. First operand 15466 states and 15768 transitions. Second operand has 10 states, 10 states have (on average 178.9) internal successors, (1789), 9 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:35,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:35,407 INFO L93 Difference]: Finished difference Result 31589 states and 32202 transitions. [2025-03-16 15:12:35,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 15:12:35,407 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 178.9) internal successors, (1789), 9 states have internal predecessors, (1789), 0 states have call successors, (0), 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 1722 [2025-03-16 15:12:35,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:35,419 INFO L225 Difference]: With dead ends: 31589 [2025-03-16 15:12:35,419 INFO L226 Difference]: Without dead ends: 16782 [2025-03-16 15:12:35,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3453 GetRequests, 3439 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2025-03-16 15:12:35,426 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 1491 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 7816 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 8022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 7816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:35,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 92 Invalid, 8022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 7816 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-16 15:12:35,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16782 states. [2025-03-16 15:12:35,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16782 to 16124. [2025-03-16 15:12:35,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16124 states, 16123 states have (on average 1.0182348198226137) internal successors, (16417), 16123 states have internal predecessors, (16417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:35,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16124 states to 16124 states and 16417 transitions. [2025-03-16 15:12:35,524 INFO L78 Accepts]: Start accepts. Automaton has 16124 states and 16417 transitions. Word has length 1722 [2025-03-16 15:12:35,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:35,524 INFO L471 AbstractCegarLoop]: Abstraction has 16124 states and 16417 transitions. [2025-03-16 15:12:35,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 178.9) internal successors, (1789), 9 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:35,524 INFO L276 IsEmpty]: Start isEmpty. Operand 16124 states and 16417 transitions. [2025-03-16 15:12:35,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1841 [2025-03-16 15:12:35,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:35,543 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:35,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 15:12:35,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-16 15:12:35,748 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:35,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:35,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1237764006, now seen corresponding path program 1 times [2025-03-16 15:12:35,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:35,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113723409] [2025-03-16 15:12:35,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:35,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:35,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1840 statements into 1 equivalence classes. [2025-03-16 15:12:35,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1840 of 1840 statements. [2025-03-16 15:12:35,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:35,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:38,230 INFO L134 CoverageAnalysis]: Checked inductivity of 5566 backedges. 3459 proven. 1346 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2025-03-16 15:12:38,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:38,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113723409] [2025-03-16 15:12:38,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113723409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:12:38,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525864323] [2025-03-16 15:12:38,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:38,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:12:38,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:12:38,234 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:12:38,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 15:12:38,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1840 statements into 1 equivalence classes. [2025-03-16 15:12:38,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1840 of 1840 statements. [2025-03-16 15:12:38,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:38,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:38,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 2095 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:12:38,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:12:38,724 INFO L134 CoverageAnalysis]: Checked inductivity of 5566 backedges. 3746 proven. 0 refuted. 0 times theorem prover too weak. 1820 trivial. 0 not checked. [2025-03-16 15:12:38,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:12:38,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525864323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:38,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:12:38,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-16 15:12:38,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428490929] [2025-03-16 15:12:38,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:38,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:38,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:38,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:38,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:12:38,727 INFO L87 Difference]: Start difference. First operand 16124 states and 16417 transitions. Second operand has 3 states, 3 states have (on average 283.6666666666667) internal successors, (851), 3 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:39,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:39,215 INFO L93 Difference]: Finished difference Result 31589 states and 32171 transitions. [2025-03-16 15:12:39,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:39,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 283.6666666666667) internal successors, (851), 3 states have internal predecessors, (851), 0 states have call successors, (0), 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 1840 [2025-03-16 15:12:39,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:39,228 INFO L225 Difference]: With dead ends: 31589 [2025-03-16 15:12:39,228 INFO L226 Difference]: Without dead ends: 16124 [2025-03-16 15:12:39,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1846 GetRequests, 1841 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:12:39,236 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 66 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:39,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 410 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:12:39,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16124 states. [2025-03-16 15:12:39,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16124 to 16124. [2025-03-16 15:12:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16124 states, 16123 states have (on average 1.0166222167090493) internal successors, (16391), 16123 states have internal predecessors, (16391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:39,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16124 states to 16124 states and 16391 transitions. [2025-03-16 15:12:39,362 INFO L78 Accepts]: Start accepts. Automaton has 16124 states and 16391 transitions. Word has length 1840 [2025-03-16 15:12:39,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:39,362 INFO L471 AbstractCegarLoop]: Abstraction has 16124 states and 16391 transitions. [2025-03-16 15:12:39,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.6666666666667) internal successors, (851), 3 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:39,362 INFO L276 IsEmpty]: Start isEmpty. Operand 16124 states and 16391 transitions. [2025-03-16 15:12:39,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1886 [2025-03-16 15:12:39,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:39,395 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 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] [2025-03-16 15:12:39,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 15:12:39,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:12:39,595 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:39,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:39,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1836699289, now seen corresponding path program 1 times [2025-03-16 15:12:39,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:39,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43428777] [2025-03-16 15:12:39,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:39,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:39,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1885 statements into 1 equivalence classes. [2025-03-16 15:12:39,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1885 of 1885 statements. [2025-03-16 15:12:39,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:39,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:41,152 INFO L134 CoverageAnalysis]: Checked inductivity of 6657 backedges. 3465 proven. 0 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2025-03-16 15:12:41,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:41,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43428777] [2025-03-16 15:12:41,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43428777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:41,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:41,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:41,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730200604] [2025-03-16 15:12:41,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:41,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:41,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:41,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:41,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:41,153 INFO L87 Difference]: Start difference. First operand 16124 states and 16391 transitions. Second operand has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:41,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:41,700 INFO L93 Difference]: Finished difference Result 35208 states and 35789 transitions. [2025-03-16 15:12:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:41,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1885 [2025-03-16 15:12:41,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:41,715 INFO L225 Difference]: With dead ends: 35208 [2025-03-16 15:12:41,715 INFO L226 Difference]: Without dead ends: 19414 [2025-03-16 15:12:41,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:41,724 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 206 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:41,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 46 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:12:41,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19414 states. [2025-03-16 15:12:41,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19414 to 16453. [2025-03-16 15:12:41,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16453 states, 16452 states have (on average 1.0159251154874787) internal successors, (16714), 16452 states have internal predecessors, (16714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:41,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16453 states to 16453 states and 16714 transitions. [2025-03-16 15:12:41,892 INFO L78 Accepts]: Start accepts. Automaton has 16453 states and 16714 transitions. Word has length 1885 [2025-03-16 15:12:41,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:41,892 INFO L471 AbstractCegarLoop]: Abstraction has 16453 states and 16714 transitions. [2025-03-16 15:12:41,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:41,892 INFO L276 IsEmpty]: Start isEmpty. Operand 16453 states and 16714 transitions. [2025-03-16 15:12:41,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1927 [2025-03-16 15:12:41,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:41,913 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:41,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 15:12:41,914 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:41,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:41,915 INFO L85 PathProgramCache]: Analyzing trace with hash -415017567, now seen corresponding path program 1 times [2025-03-16 15:12:41,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:41,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328803211] [2025-03-16 15:12:41,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:41,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:42,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1926 statements into 1 equivalence classes. [2025-03-16 15:12:42,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1926 of 1926 statements. [2025-03-16 15:12:42,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:42,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:44,002 INFO L134 CoverageAnalysis]: Checked inductivity of 7339 backedges. 5440 proven. 4 refuted. 0 times theorem prover too weak. 1895 trivial. 0 not checked. [2025-03-16 15:12:44,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:44,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328803211] [2025-03-16 15:12:44,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328803211] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:12:44,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20290625] [2025-03-16 15:12:44,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:44,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:12:44,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:12:44,005 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:12:44,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 15:12:44,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1926 statements into 1 equivalence classes. [2025-03-16 15:12:44,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1926 of 1926 statements. [2025-03-16 15:12:44,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:44,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:44,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 2233 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:12:44,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:12:44,702 INFO L134 CoverageAnalysis]: Checked inductivity of 7339 backedges. 3942 proven. 0 refuted. 0 times theorem prover too weak. 3397 trivial. 0 not checked. [2025-03-16 15:12:44,703 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:12:44,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20290625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:44,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:12:44,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-16 15:12:44,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978396307] [2025-03-16 15:12:44,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:44,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:44,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:44,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:44,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:12:44,705 INFO L87 Difference]: Start difference. First operand 16453 states and 16714 transitions. Second operand has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:45,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:45,214 INFO L93 Difference]: Finished difference Result 31918 states and 32429 transitions. [2025-03-16 15:12:45,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:45,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 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 1926 [2025-03-16 15:12:45,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:45,228 INFO L225 Difference]: With dead ends: 31918 [2025-03-16 15:12:45,228 INFO L226 Difference]: Without dead ends: 15466 [2025-03-16 15:12:45,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1931 GetRequests, 1926 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:12:45,239 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 120 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:45,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 424 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:12:45,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15466 states. [2025-03-16 15:12:45,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15466 to 15466. [2025-03-16 15:12:45,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15466 states, 15465 states have (on average 1.0151309408341416) internal successors, (15699), 15465 states have internal predecessors, (15699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:45,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15466 states to 15466 states and 15699 transitions. [2025-03-16 15:12:45,334 INFO L78 Accepts]: Start accepts. Automaton has 15466 states and 15699 transitions. Word has length 1926 [2025-03-16 15:12:45,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:45,335 INFO L471 AbstractCegarLoop]: Abstraction has 15466 states and 15699 transitions. [2025-03-16 15:12:45,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:45,335 INFO L276 IsEmpty]: Start isEmpty. Operand 15466 states and 15699 transitions. [2025-03-16 15:12:45,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2157 [2025-03-16 15:12:45,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:45,357 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:45,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 15:12:45,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-16 15:12:45,558 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:45,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:45,559 INFO L85 PathProgramCache]: Analyzing trace with hash 271076947, now seen corresponding path program 1 times [2025-03-16 15:12:45,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:45,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617009058] [2025-03-16 15:12:45,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:45,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:45,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2156 statements into 1 equivalence classes. [2025-03-16 15:12:45,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2156 of 2156 statements. [2025-03-16 15:12:45,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:45,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:48,453 INFO L134 CoverageAnalysis]: Checked inductivity of 8812 backedges. 5407 proven. 576 refuted. 0 times theorem prover too weak. 2829 trivial. 0 not checked. [2025-03-16 15:12:48,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:48,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617009058] [2025-03-16 15:12:48,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617009058] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:12:48,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271528546] [2025-03-16 15:12:48,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:48,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:12:48,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:12:48,455 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:12:48,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 15:12:48,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2156 statements into 1 equivalence classes. [2025-03-16 15:12:48,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2156 of 2156 statements. [2025-03-16 15:12:48,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:48,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:48,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 2481 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:12:48,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:12:48,996 INFO L134 CoverageAnalysis]: Checked inductivity of 8812 backedges. 4509 proven. 0 refuted. 0 times theorem prover too weak. 4303 trivial. 0 not checked. [2025-03-16 15:12:48,996 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:12:48,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271528546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:48,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:12:48,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-16 15:12:48,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817867776] [2025-03-16 15:12:48,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:48,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:48,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:48,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:48,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:12:48,998 INFO L87 Difference]: Start difference. First operand 15466 states and 15699 transitions. Second operand has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:49,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:49,543 INFO L93 Difference]: Finished difference Result 29615 states and 30074 transitions. [2025-03-16 15:12:49,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:49,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 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 2156 [2025-03-16 15:12:49,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:49,554 INFO L225 Difference]: With dead ends: 29615 [2025-03-16 15:12:49,554 INFO L226 Difference]: Without dead ends: 15466 [2025-03-16 15:12:49,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2163 GetRequests, 2158 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:12:49,560 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 119 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:49,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 414 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:12:49,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15466 states. [2025-03-16 15:12:49,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15466 to 15466. [2025-03-16 15:12:49,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15466 states, 15465 states have (on average 1.0139670223084385) internal successors, (15681), 15465 states have internal predecessors, (15681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:49,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15466 states to 15466 states and 15681 transitions. [2025-03-16 15:12:49,646 INFO L78 Accepts]: Start accepts. Automaton has 15466 states and 15681 transitions. Word has length 2156 [2025-03-16 15:12:49,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:49,646 INFO L471 AbstractCegarLoop]: Abstraction has 15466 states and 15681 transitions. [2025-03-16 15:12:49,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:49,646 INFO L276 IsEmpty]: Start isEmpty. Operand 15466 states and 15681 transitions. [2025-03-16 15:12:49,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2230 [2025-03-16 15:12:49,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:49,670 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 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-16 15:12:49,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 15:12:49,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-16 15:12:49,870 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:49,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:49,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1774071130, now seen corresponding path program 1 times [2025-03-16 15:12:49,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:49,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628645598] [2025-03-16 15:12:49,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:49,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:49,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2229 statements into 1 equivalence classes. [2025-03-16 15:12:50,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2229 of 2229 statements. [2025-03-16 15:12:50,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:50,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:52,028 INFO L134 CoverageAnalysis]: Checked inductivity of 10422 backedges. 7606 proven. 91 refuted. 0 times theorem prover too weak. 2725 trivial. 0 not checked. [2025-03-16 15:12:52,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:52,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628645598] [2025-03-16 15:12:52,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628645598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:12:52,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248834332] [2025-03-16 15:12:52,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:52,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:12:52,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:12:52,030 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:12:52,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 15:12:52,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2229 statements into 1 equivalence classes. [2025-03-16 15:12:52,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2229 of 2229 statements. [2025-03-16 15:12:52,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:52,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:52,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 2571 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:12:52,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:12:52,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10422 backedges. 1947 proven. 0 refuted. 0 times theorem prover too weak. 8475 trivial. 0 not checked. [2025-03-16 15:12:52,614 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:12:52,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248834332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:52,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:12:52,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-16 15:12:52,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709429713] [2025-03-16 15:12:52,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:52,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:52,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:52,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:52,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:12:52,616 INFO L87 Difference]: Start difference. First operand 15466 states and 15681 transitions. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:53,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:53,204 INFO L93 Difference]: Finished difference Result 32247 states and 32715 transitions. [2025-03-16 15:12:53,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:53,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 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 2229 [2025-03-16 15:12:53,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:53,220 INFO L225 Difference]: With dead ends: 32247 [2025-03-16 15:12:53,220 INFO L226 Difference]: Without dead ends: 18098 [2025-03-16 15:12:53,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2234 GetRequests, 2229 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:12:53,227 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 138 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:53,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 49 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:12:53,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18098 states. [2025-03-16 15:12:53,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18098 to 15137. [2025-03-16 15:12:53,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15137 states, 15136 states have (on average 1.013345665961945) internal successors, (15338), 15136 states have internal predecessors, (15338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:53,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15137 states to 15137 states and 15338 transitions. [2025-03-16 15:12:53,330 INFO L78 Accepts]: Start accepts. Automaton has 15137 states and 15338 transitions. Word has length 2229 [2025-03-16 15:12:53,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:53,332 INFO L471 AbstractCegarLoop]: Abstraction has 15137 states and 15338 transitions. [2025-03-16 15:12:53,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:53,332 INFO L276 IsEmpty]: Start isEmpty. Operand 15137 states and 15338 transitions. [2025-03-16 15:12:53,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2343 [2025-03-16 15:12:53,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:53,414 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:53,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 15:12:53,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-16 15:12:53,614 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:53,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:53,615 INFO L85 PathProgramCache]: Analyzing trace with hash -628489718, now seen corresponding path program 1 times [2025-03-16 15:12:53,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:53,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028551297] [2025-03-16 15:12:53,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:53,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:53,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2342 statements into 1 equivalence classes. [2025-03-16 15:12:53,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2342 of 2342 statements. [2025-03-16 15:12:53,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:53,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:56,104 INFO L134 CoverageAnalysis]: Checked inductivity of 10581 backedges. 7716 proven. 91 refuted. 0 times theorem prover too weak. 2774 trivial. 0 not checked. [2025-03-16 15:12:56,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:56,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028551297] [2025-03-16 15:12:56,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028551297] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:12:56,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393634246] [2025-03-16 15:12:56,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:56,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:12:56,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:12:56,106 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:12:56,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 15:12:56,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2342 statements into 1 equivalence classes. [2025-03-16 15:12:56,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2342 of 2342 statements. [2025-03-16 15:12:56,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:56,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:56,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 2692 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:12:56,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:13:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 10581 backedges. 6876 proven. 67 refuted. 0 times theorem prover too weak. 3638 trivial. 0 not checked. [2025-03-16 15:13:03,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:13:05,926 INFO L134 CoverageAnalysis]: Checked inductivity of 10581 backedges. 5868 proven. 0 refuted. 0 times theorem prover too weak. 4713 trivial. 0 not checked. [2025-03-16 15:13:05,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393634246] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:13:05,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:13:05,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 4] total 9 [2025-03-16 15:13:05,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689200353] [2025-03-16 15:13:05,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:05,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:05,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:05,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:05,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:13:05,928 INFO L87 Difference]: Start difference. First operand 15137 states and 15338 transitions. Second operand has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:06,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:06,518 INFO L93 Difference]: Finished difference Result 29615 states and 30015 transitions. [2025-03-16 15:13:06,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:06,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 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 2342 [2025-03-16 15:13:06,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:06,530 INFO L225 Difference]: With dead ends: 29615 [2025-03-16 15:13:06,530 INFO L226 Difference]: Without dead ends: 15795 [2025-03-16 15:13:06,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4688 GetRequests, 4681 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:13:06,537 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 266 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:06,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 35 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:13:06,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15795 states. [2025-03-16 15:13:06,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15795 to 15137. [2025-03-16 15:13:06,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15137 states, 15136 states have (on average 1.0124207188160677) internal successors, (15324), 15136 states have internal predecessors, (15324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:06,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15137 states to 15137 states and 15324 transitions. [2025-03-16 15:13:06,627 INFO L78 Accepts]: Start accepts. Automaton has 15137 states and 15324 transitions. Word has length 2342 [2025-03-16 15:13:06,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:06,628 INFO L471 AbstractCegarLoop]: Abstraction has 15137 states and 15324 transitions. [2025-03-16 15:13:06,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:06,628 INFO L276 IsEmpty]: Start isEmpty. Operand 15137 states and 15324 transitions. [2025-03-16 15:13:06,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2393 [2025-03-16 15:13:06,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:06,654 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:06,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 15:13:06,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:06,854 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:06,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:06,855 INFO L85 PathProgramCache]: Analyzing trace with hash 779274848, now seen corresponding path program 1 times [2025-03-16 15:13:06,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:06,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514939891] [2025-03-16 15:13:06,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:06,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:06,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2392 statements into 1 equivalence classes. [2025-03-16 15:13:07,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2392 of 2392 statements. [2025-03-16 15:13:07,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:07,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:09,688 INFO L134 CoverageAnalysis]: Checked inductivity of 11023 backedges. 6650 proven. 79 refuted. 0 times theorem prover too weak. 4294 trivial. 0 not checked. [2025-03-16 15:13:09,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:09,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514939891] [2025-03-16 15:13:09,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514939891] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:13:09,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866145263] [2025-03-16 15:13:09,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:09,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:09,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:13:09,698 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:13:09,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 15:13:09,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2392 statements into 1 equivalence classes. [2025-03-16 15:13:10,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2392 of 2392 statements. [2025-03-16 15:13:10,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:10,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:10,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 2744 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:13:10,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:13:10,684 INFO L134 CoverageAnalysis]: Checked inductivity of 11023 backedges. 7046 proven. 250 refuted. 0 times theorem prover too weak. 3727 trivial. 0 not checked. [2025-03-16 15:13:10,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:13:11,876 INFO L134 CoverageAnalysis]: Checked inductivity of 11023 backedges. 6115 proven. 0 refuted. 0 times theorem prover too weak. 4908 trivial. 0 not checked. [2025-03-16 15:13:11,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866145263] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:13:11,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:13:11,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 7 [2025-03-16 15:13:11,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985875713] [2025-03-16 15:13:11,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:11,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:11,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:11,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:11,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:13:11,879 INFO L87 Difference]: Start difference. First operand 15137 states and 15324 transitions. Second operand has 3 states, 3 states have (on average 285.6666666666667) internal successors, (857), 3 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:12,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:12,522 INFO L93 Difference]: Finished difference Result 29286 states and 29657 transitions. [2025-03-16 15:13:12,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:12,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 285.6666666666667) internal successors, (857), 3 states have internal predecessors, (857), 0 states have call successors, (0), 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 2392 [2025-03-16 15:13:12,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:12,537 INFO L225 Difference]: With dead ends: 29286 [2025-03-16 15:13:12,537 INFO L226 Difference]: Without dead ends: 15466 [2025-03-16 15:13:12,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4786 GetRequests, 4781 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:13:12,548 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 85 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:12,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 15 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:13:12,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15466 states. [2025-03-16 15:13:12,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15466 to 15137. [2025-03-16 15:13:12,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15137 states, 15136 states have (on average 1.0122225158562368) internal successors, (15321), 15136 states have internal predecessors, (15321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:12,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15137 states to 15137 states and 15321 transitions. [2025-03-16 15:13:12,706 INFO L78 Accepts]: Start accepts. Automaton has 15137 states and 15321 transitions. Word has length 2392 [2025-03-16 15:13:12,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:12,707 INFO L471 AbstractCegarLoop]: Abstraction has 15137 states and 15321 transitions. [2025-03-16 15:13:12,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.6666666666667) internal successors, (857), 3 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:12,707 INFO L276 IsEmpty]: Start isEmpty. Operand 15137 states and 15321 transitions. [2025-03-16 15:13:12,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2460 [2025-03-16 15:13:12,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:12,734 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:12,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 15:13:12,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:12,935 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:12,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:12,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1709492302, now seen corresponding path program 1 times [2025-03-16 15:13:12,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:12,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128421311] [2025-03-16 15:13:12,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:12,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:13,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2459 statements into 1 equivalence classes. [2025-03-16 15:13:13,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2459 of 2459 statements. [2025-03-16 15:13:13,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:13,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat