./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem16_label05.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 0645d92d946523ae7f73519b10a8044529081b14933ba5ba70a68277fba7b19b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:53:18,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:53:18,609 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:53:18,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:53:18,613 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:53:18,627 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:53:18,628 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:53:18,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:53:18,628 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:53:18,629 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:53:18,629 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:53:18,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:53:18,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:53:18,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:53:18,630 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:53:18,630 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:53:18,630 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:53:18,631 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:53:18,631 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:53:18,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:53:18,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:53:18,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:53:18,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:53:18,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:53:18,631 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:53:18,631 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:53:18,631 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:53:18,631 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:53:18,631 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:53:18,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:53:18,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:53:18,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:53:18,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:53:18,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:53:18,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:53:18,632 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:53:18,632 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:53:18,632 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:53:18,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:53:18,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:53:18,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:53:18,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:53:18,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:53:18,633 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 -> 0645d92d946523ae7f73519b10a8044529081b14933ba5ba70a68277fba7b19b [2025-03-03 10:53:18,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:53:18,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:53:18,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:53:18,853 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:53:18,853 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:53:18,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label05.c [2025-03-03 10:53:19,988 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a36de5ba4/2219f203445748fcb1620f270cfaceff/FLAG9d17f7263 [2025-03-03 10:53:20,325 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:53:20,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label05.c [2025-03-03 10:53:20,349 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a36de5ba4/2219f203445748fcb1620f270cfaceff/FLAG9d17f7263 [2025-03-03 10:53:20,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a36de5ba4/2219f203445748fcb1620f270cfaceff [2025-03-03 10:53:20,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:53:20,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:53:20,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:53:20,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:53:20,555 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:53:20,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:53:20" (1/1) ... [2025-03-03 10:53:20,556 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d58bc37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:20, skipping insertion in model container [2025-03-03 10:53:20,556 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:53:20" (1/1) ... [2025-03-03 10:53:20,593 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:53:20,723 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_label05.c[2198,2211] [2025-03-03 10:53:21,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:53:21,015 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:53:21,025 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_label05.c[2198,2211] [2025-03-03 10:53:21,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:53:21,152 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:53:21,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:21 WrapperNode [2025-03-03 10:53:21,153 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:53:21,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:53:21,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:53:21,155 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:53:21,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:21" (1/1) ... [2025-03-03 10:53:21,189 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:21" (1/1) ... [2025-03-03 10:53:21,295 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-03 10:53:21,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:53:21,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:53:21,296 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:53:21,296 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:53:21,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:21" (1/1) ... [2025-03-03 10:53:21,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:21" (1/1) ... [2025-03-03 10:53:21,314 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:21" (1/1) ... [2025-03-03 10:53:21,365 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:53:21,365 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:21" (1/1) ... [2025-03-03 10:53:21,365 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:21" (1/1) ... [2025-03-03 10:53:21,400 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:21" (1/1) ... [2025-03-03 10:53:21,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:21" (1/1) ... [2025-03-03 10:53:21,413 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:21" (1/1) ... [2025-03-03 10:53:21,422 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:21" (1/1) ... [2025-03-03 10:53:21,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:53:21,434 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:53:21,434 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:53:21,435 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:53:21,436 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:21" (1/1) ... [2025-03-03 10:53:21,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:53:21,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:53:21,460 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:53:21,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:53:21,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:53:21,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:53:21,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:53:21,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:53:21,519 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:53:21,520 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:53:23,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-03 10:53:23,214 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-03 10:53:23,215 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:53:23,234 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:53:23,234 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:53:23,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:53:23 BoogieIcfgContainer [2025-03-03 10:53:23,235 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:53:23,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:53:23,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:53:23,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:53:23,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:53:20" (1/3) ... [2025-03-03 10:53:23,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274a166d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:53:23, skipping insertion in model container [2025-03-03 10:53:23,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:21" (2/3) ... [2025-03-03 10:53:23,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274a166d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:53:23, skipping insertion in model container [2025-03-03 10:53:23,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:53:23" (3/3) ... [2025-03-03 10:53:23,242 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label05.c [2025-03-03 10:53:23,254 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:53:23,256 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label05.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:53:23,313 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:53:23,322 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;@3697ba34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:53:23,323 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:53:23,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:23,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 10:53:23,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:23,332 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:23,333 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:23,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:23,337 INFO L85 PathProgramCache]: Analyzing trace with hash 240627047, now seen corresponding path program 1 times [2025-03-03 10:53:23,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:23,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55651638] [2025-03-03 10:53:23,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:23,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:23,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 10:53:23,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 10:53:23,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:23,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:23,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:53:23,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:23,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55651638] [2025-03-03 10:53:23,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55651638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:23,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:23,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:53:23,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943714951] [2025-03-03 10:53:23,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:23,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:23,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:23,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:23,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:23,568 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:24,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:24,827 INFO L93 Difference]: Finished difference Result 1122 states and 2100 transitions. [2025-03-03 10:53:24,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:24,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-03-03 10:53:24,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:24,840 INFO L225 Difference]: With dead ends: 1122 [2025-03-03 10:53:24,841 INFO L226 Difference]: Without dead ends: 662 [2025-03-03 10:53:24,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:24,848 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 341 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:24,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 223 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:53:24,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-03 10:53:24,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-03-03 10:53:24,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.5824508320726172) internal successors, (1046), 661 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:24,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1046 transitions. [2025-03-03 10:53:24,911 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1046 transitions. Word has length 19 [2025-03-03 10:53:24,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:24,912 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1046 transitions. [2025-03-03 10:53:24,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:24,913 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1046 transitions. [2025-03-03 10:53:24,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 10:53:24,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:24,915 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:53:24,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:53:24,915 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:24,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:24,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1553177212, now seen corresponding path program 1 times [2025-03-03 10:53:24,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:24,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162690876] [2025-03-03 10:53:24,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:24,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:24,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 10:53:24,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 10:53:24,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:24,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:25,127 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:53:25,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:25,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162690876] [2025-03-03 10:53:25,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162690876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:25,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:25,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:53:25,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599926396] [2025-03-03 10:53:25,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:25,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:25,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:25,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:25,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:25,131 INFO L87 Difference]: Start difference. First operand 662 states and 1046 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:26,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:26,267 INFO L93 Difference]: Finished difference Result 1980 states and 3133 transitions. [2025-03-03 10:53:26,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:26,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-03-03 10:53:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:26,272 INFO L225 Difference]: With dead ends: 1980 [2025-03-03 10:53:26,272 INFO L226 Difference]: Without dead ends: 1320 [2025-03-03 10:53:26,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:26,275 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 277 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:26,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 79 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:53:26,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-03-03 10:53:26,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2025-03-03 10:53:26,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.5056861258529188) internal successors, (1986), 1319 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:26,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1986 transitions. [2025-03-03 10:53:26,303 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1986 transitions. Word has length 90 [2025-03-03 10:53:26,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:26,303 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1986 transitions. [2025-03-03 10:53:26,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:26,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1986 transitions. [2025-03-03 10:53:26,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 10:53:26,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:26,310 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:26,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:53:26,311 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:26,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:26,314 INFO L85 PathProgramCache]: Analyzing trace with hash 658153075, now seen corresponding path program 1 times [2025-03-03 10:53:26,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:26,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045661692] [2025-03-03 10:53:26,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:26,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:26,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 10:53:26,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 10:53:26,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:26,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:26,551 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 10:53:26,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:26,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045661692] [2025-03-03 10:53:26,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045661692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:26,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:26,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:53:26,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153923911] [2025-03-03 10:53:26,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:26,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:26,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:26,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:26,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:26,555 INFO L87 Difference]: Start difference. First operand 1320 states and 1986 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:27,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:27,522 INFO L93 Difference]: Finished difference Result 3954 states and 5953 transitions. [2025-03-03 10:53:27,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:27,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 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 161 [2025-03-03 10:53:27,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:27,531 INFO L225 Difference]: With dead ends: 3954 [2025-03-03 10:53:27,531 INFO L226 Difference]: Without dead ends: 2636 [2025-03-03 10:53:27,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:27,533 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 293 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:27,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 205 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:53:27,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2025-03-03 10:53:27,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2636. [2025-03-03 10:53:27,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 2635 states have (on average 1.323719165085389) internal successors, (3488), 2635 states have internal predecessors, (3488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:27,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3488 transitions. [2025-03-03 10:53:27,571 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3488 transitions. Word has length 161 [2025-03-03 10:53:27,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:27,572 INFO L471 AbstractCegarLoop]: Abstraction has 2636 states and 3488 transitions. [2025-03-03 10:53:27,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:27,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3488 transitions. [2025-03-03 10:53:27,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-03 10:53:27,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:27,574 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:53:27,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:53:27,574 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:27,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:27,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1571841741, now seen corresponding path program 1 times [2025-03-03 10:53:27,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:27,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101117238] [2025-03-03 10:53:27,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:27,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:27,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-03 10:53:27,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-03 10:53:27,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:27,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:27,784 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-03 10:53:27,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:27,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101117238] [2025-03-03 10:53:27,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101117238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:27,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:27,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:53:27,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995675482] [2025-03-03 10:53:27,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:27,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:27,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:27,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:27,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:27,787 INFO L87 Difference]: Start difference. First operand 2636 states and 3488 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:28,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:28,741 INFO L93 Difference]: Finished difference Result 6586 states and 8891 transitions. [2025-03-03 10:53:28,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:28,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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 185 [2025-03-03 10:53:28,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:28,753 INFO L225 Difference]: With dead ends: 6586 [2025-03-03 10:53:28,753 INFO L226 Difference]: Without dead ends: 3952 [2025-03-03 10:53:28,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:28,759 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 358 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:28,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 156 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:53:28,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2025-03-03 10:53:28,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 2965. [2025-03-03 10:53:28,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2964 states have (on average 1.3286099865047234) internal successors, (3938), 2964 states have internal predecessors, (3938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:28,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 3938 transitions. [2025-03-03 10:53:28,802 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 3938 transitions. Word has length 185 [2025-03-03 10:53:28,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:28,803 INFO L471 AbstractCegarLoop]: Abstraction has 2965 states and 3938 transitions. [2025-03-03 10:53:28,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:28,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 3938 transitions. [2025-03-03 10:53:28,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-03 10:53:28,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:28,807 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:53:28,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:53:28,807 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:28,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:28,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1117057612, now seen corresponding path program 1 times [2025-03-03 10:53:28,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:28,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114632211] [2025-03-03 10:53:28,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:28,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:28,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-03 10:53:28,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-03 10:53:28,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:28,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:29,003 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-03 10:53:29,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:29,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114632211] [2025-03-03 10:53:29,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114632211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:29,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:29,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:53:29,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591288970] [2025-03-03 10:53:29,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:29,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:29,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:29,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:29,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:29,005 INFO L87 Difference]: Start difference. First operand 2965 states and 3938 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:29,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:29,915 INFO L93 Difference]: Finished difference Result 7244 states and 9442 transitions. [2025-03-03 10:53:29,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:29,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 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 328 [2025-03-03 10:53:29,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:29,926 INFO L225 Difference]: With dead ends: 7244 [2025-03-03 10:53:29,926 INFO L226 Difference]: Without dead ends: 4281 [2025-03-03 10:53:29,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:29,929 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:29,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 83 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:53:29,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2025-03-03 10:53:29,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 4281. [2025-03-03 10:53:29,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4281 states, 4280 states have (on average 1.2121495327102805) internal successors, (5188), 4280 states have internal predecessors, (5188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:29,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 5188 transitions. [2025-03-03 10:53:29,983 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 5188 transitions. Word has length 328 [2025-03-03 10:53:29,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:29,984 INFO L471 AbstractCegarLoop]: Abstraction has 4281 states and 5188 transitions. [2025-03-03 10:53:29,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:29,984 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 5188 transitions. [2025-03-03 10:53:29,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-03-03 10:53:29,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:29,989 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:53:29,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:53:29,989 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:29,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:29,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1385382793, now seen corresponding path program 1 times [2025-03-03 10:53:29,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:29,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838551723] [2025-03-03 10:53:29,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:29,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:30,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-03-03 10:53:30,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-03-03 10:53:30,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:30,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-03 10:53:30,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:30,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838551723] [2025-03-03 10:53:30,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838551723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:30,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:30,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:53:30,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233054047] [2025-03-03 10:53:30,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:30,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:30,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:30,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:30,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:30,532 INFO L87 Difference]: Start difference. First operand 4281 states and 5188 transitions. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 2 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:31,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:31,407 INFO L93 Difference]: Finished difference Result 9218 states and 11086 transitions. [2025-03-03 10:53:31,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:31,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 2 states have internal predecessors, (360), 0 states have call successors, (0), 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 442 [2025-03-03 10:53:31,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:31,417 INFO L225 Difference]: With dead ends: 9218 [2025-03-03 10:53:31,417 INFO L226 Difference]: Without dead ends: 4939 [2025-03-03 10:53:31,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:31,420 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 87 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:31,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 248 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:53:31,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2025-03-03 10:53:31,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4939. [2025-03-03 10:53:31,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4939 states, 4938 states have (on average 1.191170514378291) internal successors, (5882), 4938 states have internal predecessors, (5882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:31,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4939 states to 4939 states and 5882 transitions. [2025-03-03 10:53:31,478 INFO L78 Accepts]: Start accepts. Automaton has 4939 states and 5882 transitions. Word has length 442 [2025-03-03 10:53:31,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:31,479 INFO L471 AbstractCegarLoop]: Abstraction has 4939 states and 5882 transitions. [2025-03-03 10:53:31,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 2 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:31,480 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 5882 transitions. [2025-03-03 10:53:31,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-03-03 10:53:31,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:31,487 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:31,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:53:31,488 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:31,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:31,488 INFO L85 PathProgramCache]: Analyzing trace with hash -187763548, now seen corresponding path program 1 times [2025-03-03 10:53:31,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:31,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803328569] [2025-03-03 10:53:31,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:31,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:31,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-03 10:53:31,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-03 10:53:31,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:31,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:32,006 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 389 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-03 10:53:32,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:32,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803328569] [2025-03-03 10:53:32,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803328569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:32,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:32,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 10:53:32,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940531956] [2025-03-03 10:53:32,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:32,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 10:53:32,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:32,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 10:53:32,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:53:32,008 INFO L87 Difference]: Start difference. First operand 4939 states and 5882 transitions. Second operand has 7 states, 7 states have (on average 56.57142857142857) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:33,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:33,306 INFO L93 Difference]: Finished difference Result 9077 states and 10915 transitions. [2025-03-03 10:53:33,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 10:53:33,307 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 56.57142857142857) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 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 529 [2025-03-03 10:53:33,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:33,316 INFO L225 Difference]: With dead ends: 9077 [2025-03-03 10:53:33,316 INFO L226 Difference]: Without dead ends: 4610 [2025-03-03 10:53:33,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:53:33,319 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 307 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1957 mSolverCounterSat, 343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 2300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 1957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:33,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 287 Invalid, 2300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 1957 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:53:33,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4610 states. [2025-03-03 10:53:33,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4610 to 4610. [2025-03-03 10:53:33,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4610 states, 4609 states have (on average 1.0735517465827729) internal successors, (4948), 4609 states have internal predecessors, (4948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:33,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4610 states to 4610 states and 4948 transitions. [2025-03-03 10:53:33,380 INFO L78 Accepts]: Start accepts. Automaton has 4610 states and 4948 transitions. Word has length 529 [2025-03-03 10:53:33,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:33,380 INFO L471 AbstractCegarLoop]: Abstraction has 4610 states and 4948 transitions. [2025-03-03 10:53:33,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 56.57142857142857) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:33,381 INFO L276 IsEmpty]: Start isEmpty. Operand 4610 states and 4948 transitions. [2025-03-03 10:53:33,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2025-03-03 10:53:33,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:33,390 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:33,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:53:33,390 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:33,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:33,391 INFO L85 PathProgramCache]: Analyzing trace with hash 104341894, now seen corresponding path program 1 times [2025-03-03 10:53:33,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:33,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208466986] [2025-03-03 10:53:33,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:33,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:33,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-03-03 10:53:33,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-03-03 10:53:33,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:33,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:33,728 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 471 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-03-03 10:53:33,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:33,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208466986] [2025-03-03 10:53:33,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208466986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:33,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:33,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:33,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349705326] [2025-03-03 10:53:33,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:33,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:33,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:33,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:33,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:33,729 INFO L87 Difference]: Start difference. First operand 4610 states and 4948 transitions. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:34,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:34,441 INFO L93 Difference]: Finished difference Result 10863 states and 11778 transitions. [2025-03-03 10:53:34,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:34,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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 557 [2025-03-03 10:53:34,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:34,457 INFO L225 Difference]: With dead ends: 10863 [2025-03-03 10:53:34,460 INFO L226 Difference]: Without dead ends: 6913 [2025-03-03 10:53:34,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:34,465 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 219 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:34,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 434 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:53:34,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6913 states. [2025-03-03 10:53:34,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6913 to 6584. [2025-03-03 10:53:34,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6584 states, 6583 states have (on average 1.058332067446453) internal successors, (6967), 6583 states have internal predecessors, (6967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:34,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6584 states to 6584 states and 6967 transitions. [2025-03-03 10:53:34,545 INFO L78 Accepts]: Start accepts. Automaton has 6584 states and 6967 transitions. Word has length 557 [2025-03-03 10:53:34,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:34,546 INFO L471 AbstractCegarLoop]: Abstraction has 6584 states and 6967 transitions. [2025-03-03 10:53:34,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:34,550 INFO L276 IsEmpty]: Start isEmpty. Operand 6584 states and 6967 transitions. [2025-03-03 10:53:34,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2025-03-03 10:53:34,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:34,571 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:34,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:53:34,571 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:34,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:34,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1153071623, now seen corresponding path program 1 times [2025-03-03 10:53:34,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:34,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211759606] [2025-03-03 10:53:34,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:34,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:34,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 661 statements into 1 equivalence classes. [2025-03-03 10:53:34,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 661 of 661 statements. [2025-03-03 10:53:34,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:34,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:34,828 INFO L134 CoverageAnalysis]: Checked inductivity of 827 backedges. 685 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-03-03 10:53:34,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:34,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211759606] [2025-03-03 10:53:34,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211759606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:34,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:34,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:34,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837436044] [2025-03-03 10:53:34,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:34,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:34,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:34,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:34,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:34,830 INFO L87 Difference]: Start difference. First operand 6584 states and 6967 transitions. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:35,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:35,470 INFO L93 Difference]: Finished difference Result 14482 states and 15462 transitions. [2025-03-03 10:53:35,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:35,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 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 661 [2025-03-03 10:53:35,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:35,484 INFO L225 Difference]: With dead ends: 14482 [2025-03-03 10:53:35,484 INFO L226 Difference]: Without dead ends: 8558 [2025-03-03 10:53:35,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:35,490 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 190 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:35,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 52 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:53:35,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8558 states. [2025-03-03 10:53:35,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8558 to 8558. [2025-03-03 10:53:35,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8558 states, 8557 states have (on average 1.0620544583382026) internal successors, (9088), 8557 states have internal predecessors, (9088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:35,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8558 states to 8558 states and 9088 transitions. [2025-03-03 10:53:35,568 INFO L78 Accepts]: Start accepts. Automaton has 8558 states and 9088 transitions. Word has length 661 [2025-03-03 10:53:35,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:35,568 INFO L471 AbstractCegarLoop]: Abstraction has 8558 states and 9088 transitions. [2025-03-03 10:53:35,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:35,569 INFO L276 IsEmpty]: Start isEmpty. Operand 8558 states and 9088 transitions. [2025-03-03 10:53:35,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2025-03-03 10:53:35,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:35,577 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:53:35,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:53:35,578 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:35,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:35,578 INFO L85 PathProgramCache]: Analyzing trace with hash 147981528, now seen corresponding path program 1 times [2025-03-03 10:53:35,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:35,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633751466] [2025-03-03 10:53:35,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:35,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:35,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 821 statements into 1 equivalence classes. [2025-03-03 10:53:35,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 821 of 821 statements. [2025-03-03 10:53:35,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:35,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:35,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 801 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-03-03 10:53:35,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:35,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633751466] [2025-03-03 10:53:35,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633751466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:35,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:35,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:35,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124927082] [2025-03-03 10:53:35,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:35,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:35,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:35,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:35,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:35,978 INFO L87 Difference]: Start difference. First operand 8558 states and 9088 transitions. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:36,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:36,676 INFO L93 Difference]: Finished difference Result 18759 states and 20060 transitions. [2025-03-03 10:53:36,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:36,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 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 821 [2025-03-03 10:53:36,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:36,692 INFO L225 Difference]: With dead ends: 18759 [2025-03-03 10:53:36,692 INFO L226 Difference]: Without dead ends: 10861 [2025-03-03 10:53:36,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:36,699 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 192 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:36,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 442 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:53:36,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10861 states. [2025-03-03 10:53:36,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10861 to 10203. [2025-03-03 10:53:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10203 states, 10202 states have (on average 1.0575377376984905) internal successors, (10789), 10202 states have internal predecessors, (10789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:36,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10203 states to 10203 states and 10789 transitions. [2025-03-03 10:53:36,779 INFO L78 Accepts]: Start accepts. Automaton has 10203 states and 10789 transitions. Word has length 821 [2025-03-03 10:53:36,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:36,780 INFO L471 AbstractCegarLoop]: Abstraction has 10203 states and 10789 transitions. [2025-03-03 10:53:36,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:36,780 INFO L276 IsEmpty]: Start isEmpty. Operand 10203 states and 10789 transitions. [2025-03-03 10:53:36,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 831 [2025-03-03 10:53:36,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:36,789 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:53:36,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:53:36,789 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:36,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:36,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1500258498, now seen corresponding path program 1 times [2025-03-03 10:53:36,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:36,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864778784] [2025-03-03 10:53:36,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:36,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:36,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 830 statements into 1 equivalence classes. [2025-03-03 10:53:36,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 830 of 830 statements. [2025-03-03 10:53:36,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:36,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:37,536 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 51 proven. 564 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2025-03-03 10:53:37,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:37,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864778784] [2025-03-03 10:53:37,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864778784] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:53:37,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563088140] [2025-03-03 10:53:37,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:37,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:53:37,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:53:37,539 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:53:37,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:53:37,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 830 statements into 1 equivalence classes. [2025-03-03 10:53:37,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 830 of 830 statements. [2025-03-03 10:53:37,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:37,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:37,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:53:37,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:53:37,811 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 923 trivial. 0 not checked. [2025-03-03 10:53:37,811 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:53:37,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563088140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:37,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:53:37,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 10:53:37,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294977756] [2025-03-03 10:53:37,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:37,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:37,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:37,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:37,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:53:37,814 INFO L87 Difference]: Start difference. First operand 10203 states and 10789 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:38,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:38,471 INFO L93 Difference]: Finished difference Result 19746 states and 20909 transitions. [2025-03-03 10:53:38,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:38,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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 830 [2025-03-03 10:53:38,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:38,485 INFO L225 Difference]: With dead ends: 19746 [2025-03-03 10:53:38,485 INFO L226 Difference]: Without dead ends: 10203 [2025-03-03 10:53:38,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 834 GetRequests, 830 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-03 10:53:38,494 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 348 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:38,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 377 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:53:38,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10203 states. [2025-03-03 10:53:38,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10203 to 10203. [2025-03-03 10:53:38,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10203 states, 10202 states have (on average 1.0512644579494217) internal successors, (10725), 10202 states have internal predecessors, (10725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:38,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10203 states to 10203 states and 10725 transitions. [2025-03-03 10:53:38,606 INFO L78 Accepts]: Start accepts. Automaton has 10203 states and 10725 transitions. Word has length 830 [2025-03-03 10:53:38,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:38,607 INFO L471 AbstractCegarLoop]: Abstraction has 10203 states and 10725 transitions. [2025-03-03 10:53:38,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:38,608 INFO L276 IsEmpty]: Start isEmpty. Operand 10203 states and 10725 transitions. [2025-03-03 10:53:38,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2025-03-03 10:53:38,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:38,622 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2025-03-03 10:53:38,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 10:53:38,823 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,SelfDestructingSolverStorable10 [2025-03-03 10:53:38,823 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:38,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:38,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1844241520, now seen corresponding path program 1 times [2025-03-03 10:53:38,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:38,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64537597] [2025-03-03 10:53:38,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:38,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:38,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 847 statements into 1 equivalence classes. [2025-03-03 10:53:38,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 847 of 847 statements. [2025-03-03 10:53:38,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:38,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:39,262 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2025-03-03 10:53:39,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:39,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64537597] [2025-03-03 10:53:39,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64537597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:39,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:39,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:39,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489903902] [2025-03-03 10:53:39,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:39,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:39,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:39,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:39,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:39,263 INFO L87 Difference]: Start difference. First operand 10203 states and 10725 transitions. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:39,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:39,830 INFO L93 Difference]: Finished difference Result 24681 states and 26060 transitions. [2025-03-03 10:53:39,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:39,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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 847 [2025-03-03 10:53:39,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:39,847 INFO L225 Difference]: With dead ends: 24681 [2025-03-03 10:53:39,847 INFO L226 Difference]: Without dead ends: 14151 [2025-03-03 10:53:39,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:39,856 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 270 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:39,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 429 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:53:39,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14151 states. [2025-03-03 10:53:39,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14151 to 13822. [2025-03-03 10:53:39,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13822 states, 13821 states have (on average 1.0426886621807394) internal successors, (14411), 13821 states have internal predecessors, (14411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:39,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14411 transitions. [2025-03-03 10:53:39,965 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 14411 transitions. Word has length 847 [2025-03-03 10:53:39,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:39,966 INFO L471 AbstractCegarLoop]: Abstraction has 13822 states and 14411 transitions. [2025-03-03 10:53:39,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:39,966 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 14411 transitions. [2025-03-03 10:53:39,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1104 [2025-03-03 10:53:39,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:39,979 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:39,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:53:39,980 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:39,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:39,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1420486644, now seen corresponding path program 1 times [2025-03-03 10:53:39,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:39,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743570634] [2025-03-03 10:53:39,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:39,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:40,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1103 statements into 1 equivalence classes. [2025-03-03 10:53:40,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1103 of 1103 statements. [2025-03-03 10:53:40,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:40,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:40,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2330 backedges. 1666 proven. 0 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2025-03-03 10:53:40,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:40,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743570634] [2025-03-03 10:53:40,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743570634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:40,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:40,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:40,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216971755] [2025-03-03 10:53:40,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:40,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:40,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:40,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:40,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:40,428 INFO L87 Difference]: Start difference. First operand 13822 states and 14411 transitions. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:41,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:41,038 INFO L93 Difference]: Finished difference Result 27313 states and 28483 transitions. [2025-03-03 10:53:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:41,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 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 1103 [2025-03-03 10:53:41,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:41,054 INFO L225 Difference]: With dead ends: 27313 [2025-03-03 10:53:41,055 INFO L226 Difference]: Without dead ends: 13822 [2025-03-03 10:53:41,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:41,066 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 220 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:41,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 432 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:53:41,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13822 states. [2025-03-03 10:53:41,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13822 to 13164. [2025-03-03 10:53:41,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13163 states have (on average 1.0287928283825876) internal successors, (13542), 13163 states have internal predecessors, (13542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:41,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13542 transitions. [2025-03-03 10:53:41,220 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 13542 transitions. Word has length 1103 [2025-03-03 10:53:41,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:41,221 INFO L471 AbstractCegarLoop]: Abstraction has 13164 states and 13542 transitions. [2025-03-03 10:53:41,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:41,221 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 13542 transitions. [2025-03-03 10:53:41,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1105 [2025-03-03 10:53:41,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:41,235 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:41,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:53:41,235 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:41,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:41,236 INFO L85 PathProgramCache]: Analyzing trace with hash 340793866, now seen corresponding path program 1 times [2025-03-03 10:53:41,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:41,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926058837] [2025-03-03 10:53:41,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:41,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:41,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1104 statements into 1 equivalence classes. [2025-03-03 10:53:41,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1104 of 1104 statements. [2025-03-03 10:53:41,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:41,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:41,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2336 backedges. 523 proven. 0 refuted. 0 times theorem prover too weak. 1813 trivial. 0 not checked. [2025-03-03 10:53:41,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:41,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926058837] [2025-03-03 10:53:41,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926058837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:41,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:41,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:41,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427769328] [2025-03-03 10:53:41,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:41,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:41,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:41,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:41,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:41,714 INFO L87 Difference]: Start difference. First operand 13164 states and 13542 transitions. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:42,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:42,315 INFO L93 Difference]: Finished difference Result 28300 states and 29185 transitions. [2025-03-03 10:53:42,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:42,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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 1104 [2025-03-03 10:53:42,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:42,328 INFO L225 Difference]: With dead ends: 28300 [2025-03-03 10:53:42,328 INFO L226 Difference]: Without dead ends: 14151 [2025-03-03 10:53:42,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:42,338 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 273 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:42,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 414 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:53:42,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14151 states. [2025-03-03 10:53:42,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14151 to 12506. [2025-03-03 10:53:42,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12506 states, 12505 states have (on average 1.026469412235106) internal successors, (12836), 12505 states have internal predecessors, (12836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:42,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 12836 transitions. [2025-03-03 10:53:42,460 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 12836 transitions. Word has length 1104 [2025-03-03 10:53:42,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:42,461 INFO L471 AbstractCegarLoop]: Abstraction has 12506 states and 12836 transitions. [2025-03-03 10:53:42,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:42,461 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 12836 transitions. [2025-03-03 10:53:42,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1247 [2025-03-03 10:53:42,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:42,479 INFO L218 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1] [2025-03-03 10:53:42,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:53:42,480 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:42,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:42,481 INFO L85 PathProgramCache]: Analyzing trace with hash -563247155, now seen corresponding path program 1 times [2025-03-03 10:53:42,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:42,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565713251] [2025-03-03 10:53:42,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:42,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:42,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1246 statements into 1 equivalence classes. [2025-03-03 10:53:42,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1246 of 1246 statements. [2025-03-03 10:53:42,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:42,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:43,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2564 backedges. 1839 proven. 0 refuted. 0 times theorem prover too weak. 725 trivial. 0 not checked. [2025-03-03 10:53:43,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:43,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565713251] [2025-03-03 10:53:43,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565713251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:43,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:43,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:53:43,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972811998] [2025-03-03 10:53:43,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:43,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:53:43,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:43,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:53:43,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:53:43,480 INFO L87 Difference]: Start difference. First operand 12506 states and 12836 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-03 10:53:44,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:44,225 INFO L93 Difference]: Finished difference Result 24363 states and 25014 transitions. [2025-03-03 10:53:44,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:53:44,225 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 1246 [2025-03-03 10:53:44,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:44,234 INFO L225 Difference]: With dead ends: 24363 [2025-03-03 10:53:44,234 INFO L226 Difference]: Without dead ends: 12517 [2025-03-03 10:53:44,240 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-03 10:53:44,240 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 218 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:44,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 438 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:53:44,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12517 states. [2025-03-03 10:53:44,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12517 to 12506. [2025-03-03 10:53:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12506 states, 12505 states have (on average 1.0263094762095162) internal successors, (12834), 12505 states have internal predecessors, (12834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:44,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 12834 transitions. [2025-03-03 10:53:44,315 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 12834 transitions. Word has length 1246 [2025-03-03 10:53:44,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:44,316 INFO L471 AbstractCegarLoop]: Abstraction has 12506 states and 12834 transitions. [2025-03-03 10:53:44,316 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-03 10:53:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 12834 transitions. [2025-03-03 10:53:44,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1262 [2025-03-03 10:53:44,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:44,329 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1] [2025-03-03 10:53:44,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:53:44,329 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:44,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:44,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1124195504, now seen corresponding path program 1 times [2025-03-03 10:53:44,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:44,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73166813] [2025-03-03 10:53:44,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:44,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:44,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1261 statements into 1 equivalence classes. [2025-03-03 10:53:44,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1261 of 1261 statements. [2025-03-03 10:53:44,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:44,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:45,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3317 backedges. 1918 proven. 0 refuted. 0 times theorem prover too weak. 1399 trivial. 0 not checked. [2025-03-03 10:53:45,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:45,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73166813] [2025-03-03 10:53:45,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73166813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:45,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:45,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:45,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958531] [2025-03-03 10:53:45,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:45,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:45,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:45,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:45,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:45,199 INFO L87 Difference]: Start difference. First operand 12506 states and 12834 transitions. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:45,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:45,799 INFO L93 Difference]: Finished difference Result 25010 states and 25668 transitions. [2025-03-03 10:53:45,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:45,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 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 1261 [2025-03-03 10:53:45,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:45,812 INFO L225 Difference]: With dead ends: 25010 [2025-03-03 10:53:45,812 INFO L226 Difference]: Without dead ends: 13164 [2025-03-03 10:53:45,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:45,821 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:45,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 433 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:53:45,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2025-03-03 10:53:45,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 13164. [2025-03-03 10:53:45,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13163 states have (on average 1.0253741548279267) internal successors, (13497), 13163 states have internal predecessors, (13497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:45,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13497 transitions. [2025-03-03 10:53:45,953 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 13497 transitions. Word has length 1261 [2025-03-03 10:53:45,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:45,954 INFO L471 AbstractCegarLoop]: Abstraction has 13164 states and 13497 transitions. [2025-03-03 10:53:45,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:45,954 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 13497 transitions. [2025-03-03 10:53:45,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1287 [2025-03-03 10:53:45,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:45,978 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1] [2025-03-03 10:53:45,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:53:45,978 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:45,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:45,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1408170426, now seen corresponding path program 1 times [2025-03-03 10:53:45,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:45,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239085241] [2025-03-03 10:53:45,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:45,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:46,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1286 statements into 1 equivalence classes. [2025-03-03 10:53:46,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1286 of 1286 statements. [2025-03-03 10:53:46,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:46,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:46,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2899 backedges. 2004 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2025-03-03 10:53:46,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:46,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239085241] [2025-03-03 10:53:46,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239085241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:46,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:46,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:53:46,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161942976] [2025-03-03 10:53:46,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:46,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:53:46,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:46,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:53:46,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:53:46,884 INFO L87 Difference]: Start difference. First operand 13164 states and 13497 transitions. Second operand has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:47,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:47,585 INFO L93 Difference]: Finished difference Result 25997 states and 26665 transitions. [2025-03-03 10:53:47,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:53:47,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 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 1286 [2025-03-03 10:53:47,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:47,595 INFO L225 Difference]: With dead ends: 25997 [2025-03-03 10:53:47,595 INFO L226 Difference]: Without dead ends: 13493 [2025-03-03 10:53:47,601 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-03 10:53:47,602 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 120 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:47,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 557 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1313 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:53:47,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2025-03-03 10:53:47,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 13493. [2025-03-03 10:53:47,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13493 states, 13492 states have (on average 1.0248295286095463) internal successors, (13827), 13492 states have internal predecessors, (13827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:47,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 13827 transitions. [2025-03-03 10:53:47,680 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 13827 transitions. Word has length 1286 [2025-03-03 10:53:47,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:47,681 INFO L471 AbstractCegarLoop]: Abstraction has 13493 states and 13827 transitions. [2025-03-03 10:53:47,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:47,681 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 13827 transitions. [2025-03-03 10:53:47,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1316 [2025-03-03 10:53:47,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:47,693 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1] [2025-03-03 10:53:47,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:53:47,693 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:47,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:47,694 INFO L85 PathProgramCache]: Analyzing trace with hash 684922597, now seen corresponding path program 1 times [2025-03-03 10:53:47,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:47,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764501370] [2025-03-03 10:53:47,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:47,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:47,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1315 statements into 1 equivalence classes. [2025-03-03 10:53:47,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1315 of 1315 statements. [2025-03-03 10:53:47,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:47,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:48,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 608 proven. 0 refuted. 0 times theorem prover too weak. 2728 trivial. 0 not checked. [2025-03-03 10:53:48,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:48,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764501370] [2025-03-03 10:53:48,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764501370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:48,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:48,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:48,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153654589] [2025-03-03 10:53:48,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:48,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:48,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:48,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:48,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:48,203 INFO L87 Difference]: Start difference. First operand 13493 states and 13827 transitions. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:48,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:48,722 INFO L93 Difference]: Finished difference Result 26655 states and 27321 transitions. [2025-03-03 10:53:48,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:48,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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 1315 [2025-03-03 10:53:48,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:48,732 INFO L225 Difference]: With dead ends: 26655 [2025-03-03 10:53:48,732 INFO L226 Difference]: Without dead ends: 13493 [2025-03-03 10:53:48,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:48,739 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 268 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:48,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 408 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:53:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2025-03-03 10:53:48,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 13164. [2025-03-03 10:53:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13163 states have (on average 1.0192205424295373) internal successors, (13416), 13163 states have internal predecessors, (13416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:48,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13416 transitions. [2025-03-03 10:53:48,813 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 13416 transitions. Word has length 1315 [2025-03-03 10:53:48,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:48,814 INFO L471 AbstractCegarLoop]: Abstraction has 13164 states and 13416 transitions. [2025-03-03 10:53:48,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:48,814 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 13416 transitions. [2025-03-03 10:53:48,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1414 [2025-03-03 10:53:48,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:48,827 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1] [2025-03-03 10:53:48,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:53:48,827 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:48,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:48,828 INFO L85 PathProgramCache]: Analyzing trace with hash 257476122, now seen corresponding path program 1 times [2025-03-03 10:53:48,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:48,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553040971] [2025-03-03 10:53:48,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:48,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:48,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1413 statements into 1 equivalence classes. [2025-03-03 10:53:48,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1413 of 1413 statements. [2025-03-03 10:53:48,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:48,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:49,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3809 backedges. 1064 proven. 0 refuted. 0 times theorem prover too weak. 2745 trivial. 0 not checked. [2025-03-03 10:53:49,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:49,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553040971] [2025-03-03 10:53:49,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553040971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:49,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:49,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:49,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058057208] [2025-03-03 10:53:49,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:49,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:49,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:49,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:49,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:49,394 INFO L87 Difference]: Start difference. First operand 13164 states and 13416 transitions. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:49,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:49,931 INFO L93 Difference]: Finished difference Result 26984 states and 27499 transitions. [2025-03-03 10:53:49,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:49,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 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 1413 [2025-03-03 10:53:49,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:49,940 INFO L225 Difference]: With dead ends: 26984 [2025-03-03 10:53:49,940 INFO L226 Difference]: Without dead ends: 12835 [2025-03-03 10:53:49,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:49,947 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 168 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:49,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 417 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:53:49,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12835 states. [2025-03-03 10:53:50,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12835 to 12835. [2025-03-03 10:53:50,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12835 states, 12834 states have (on average 1.0152719339255103) internal successors, (13030), 12834 states have internal predecessors, (13030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:50,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12835 states to 12835 states and 13030 transitions. [2025-03-03 10:53:50,026 INFO L78 Accepts]: Start accepts. Automaton has 12835 states and 13030 transitions. Word has length 1413 [2025-03-03 10:53:50,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:50,027 INFO L471 AbstractCegarLoop]: Abstraction has 12835 states and 13030 transitions. [2025-03-03 10:53:50,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:50,027 INFO L276 IsEmpty]: Start isEmpty. Operand 12835 states and 13030 transitions. [2025-03-03 10:53:50,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1772 [2025-03-03 10:53:50,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:50,045 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2025-03-03 10:53:50,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 10:53:50,046 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:50,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:50,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1629725532, now seen corresponding path program 1 times [2025-03-03 10:53:50,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:50,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317070314] [2025-03-03 10:53:50,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:50,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:50,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1771 statements into 1 equivalence classes. [2025-03-03 10:53:50,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1771 of 1771 statements. [2025-03-03 10:53:50,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:50,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:52,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 1414 proven. 0 refuted. 0 times theorem prover too weak. 3955 trivial. 0 not checked. [2025-03-03 10:53:52,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:52,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317070314] [2025-03-03 10:53:52,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317070314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:52,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:52,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:53:52,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256406618] [2025-03-03 10:53:52,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:52,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:53:52,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:52,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:53:52,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:53:52,029 INFO L87 Difference]: Start difference. First operand 12835 states and 13030 transitions. Second operand has 4 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:52,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:52,787 INFO L93 Difference]: Finished difference Result 28308 states and 28747 transitions. [2025-03-03 10:53:52,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:53:52,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 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 1771 [2025-03-03 10:53:52,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:52,801 INFO L225 Difference]: With dead ends: 28308 [2025-03-03 10:53:52,801 INFO L226 Difference]: Without dead ends: 15796 [2025-03-03 10:53:52,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:53:52,809 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 139 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:52,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 32 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:53:52,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15796 states. [2025-03-03 10:53:52,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15796 to 13493. [2025-03-03 10:53:52,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13493 states, 13492 states have (on average 1.014749481174029) internal successors, (13691), 13492 states have internal predecessors, (13691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 13691 transitions. [2025-03-03 10:53:52,913 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 13691 transitions. Word has length 1771 [2025-03-03 10:53:52,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:52,913 INFO L471 AbstractCegarLoop]: Abstraction has 13493 states and 13691 transitions. [2025-03-03 10:53:52,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:52,914 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 13691 transitions. [2025-03-03 10:53:52,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1811 [2025-03-03 10:53:52,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:52,932 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 8, 8, 8, 8, 8, 8, 8, 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, 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, 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] [2025-03-03 10:53:52,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 10:53:52,933 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:52,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:52,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1913503319, now seen corresponding path program 1 times [2025-03-03 10:53:52,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:52,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480663255] [2025-03-03 10:53:52,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:52,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:53,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1810 statements into 1 equivalence classes. [2025-03-03 10:53:53,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1810 of 1810 statements. [2025-03-03 10:53:53,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:53,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:53,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 5430 trivial. 0 not checked. [2025-03-03 10:53:53,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:53,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480663255] [2025-03-03 10:53:53,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480663255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:53,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:53,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:53,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103100778] [2025-03-03 10:53:53,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:53,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:53,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:53,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:53,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:53,851 INFO L87 Difference]: Start difference. First operand 13493 states and 13691 transitions. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:54,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:54,407 INFO L93 Difference]: Finished difference Result 29945 states and 30401 transitions. [2025-03-03 10:53:54,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:54,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 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 1810 [2025-03-03 10:53:54,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:54,423 INFO L225 Difference]: With dead ends: 29945 [2025-03-03 10:53:54,423 INFO L226 Difference]: Without dead ends: 16454 [2025-03-03 10:53:54,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:54,433 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 317 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:54,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 56 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:53:54,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16454 states. [2025-03-03 10:53:54,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16454 to 12835. [2025-03-03 10:53:54,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12835 states, 12834 states have (on average 1.0148823437743495) internal successors, (13025), 12834 states have internal predecessors, (13025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:54,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12835 states to 12835 states and 13025 transitions. [2025-03-03 10:53:54,526 INFO L78 Accepts]: Start accepts. Automaton has 12835 states and 13025 transitions. Word has length 1810 [2025-03-03 10:53:54,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:54,527 INFO L471 AbstractCegarLoop]: Abstraction has 12835 states and 13025 transitions. [2025-03-03 10:53:54,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:54,527 INFO L276 IsEmpty]: Start isEmpty. Operand 12835 states and 13025 transitions. [2025-03-03 10:53:54,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1831 [2025-03-03 10:53:54,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:54,545 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 8, 8, 8, 8, 8, 8, 8, 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, 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, 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] [2025-03-03 10:53:54,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 10:53:54,545 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:54,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:54,546 INFO L85 PathProgramCache]: Analyzing trace with hash 133378694, now seen corresponding path program 1 times [2025-03-03 10:53:54,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:54,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980009625] [2025-03-03 10:53:54,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:54,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:54,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1830 statements into 1 equivalence classes. [2025-03-03 10:53:54,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1830 of 1830 statements. [2025-03-03 10:53:54,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:54,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:55,982 INFO L134 CoverageAnalysis]: Checked inductivity of 5589 backedges. 3067 proven. 66 refuted. 0 times theorem prover too weak. 2456 trivial. 0 not checked. [2025-03-03 10:53:55,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:55,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980009625] [2025-03-03 10:53:55,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980009625] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:53:55,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930730585] [2025-03-03 10:53:55,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:55,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:53:55,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:53:55,985 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:53:55,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:53:56,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1830 statements into 1 equivalence classes. [2025-03-03 10:53:56,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1830 of 1830 statements. [2025-03-03 10:53:56,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:56,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:56,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 2091 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 10:53:56,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:53:58,374 INFO L134 CoverageAnalysis]: Checked inductivity of 5589 backedges. 2478 proven. 201 refuted. 0 times theorem prover too weak. 2910 trivial. 0 not checked. [2025-03-03 10:53:58,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:54:01,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5589 backedges. 2478 proven. 201 refuted. 0 times theorem prover too weak. 2910 trivial. 0 not checked. [2025-03-03 10:54:01,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930730585] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:54:01,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:54:01,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-03-03 10:54:01,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267420114] [2025-03-03 10:54:01,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:54:01,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 10:54:01,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:01,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 10:54:01,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:54:01,291 INFO L87 Difference]: Start difference. First operand 12835 states and 13025 transitions. Second operand has 9 states, 9 states have (on average 198.77777777777777) internal successors, (1789), 8 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-03 10:54:04,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:04,577 INFO L93 Difference]: Finished difference Result 33893 states and 34404 transitions. [2025-03-03 10:54:04,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 10:54:04,578 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 198.77777777777777) internal successors, (1789), 8 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 1830 [2025-03-03 10:54:04,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:04,593 INFO L225 Difference]: With dead ends: 33893 [2025-03-03 10:54:04,593 INFO L226 Difference]: Without dead ends: 21389 [2025-03-03 10:54:04,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3670 GetRequests, 3655 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-03-03 10:54:04,600 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1927 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1927 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 5827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:04,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1927 Valid, 74 Invalid, 5827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-03 10:54:04,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21389 states. [2025-03-03 10:54:04,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21389 to 16454. [2025-03-03 10:54:04,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16454 states, 16453 states have (on average 1.0145870054093478) internal successors, (16693), 16453 states have internal predecessors, (16693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:04,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16454 states to 16454 states and 16693 transitions. [2025-03-03 10:54:04,753 INFO L78 Accepts]: Start accepts. Automaton has 16454 states and 16693 transitions. Word has length 1830 [2025-03-03 10:54:04,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:04,753 INFO L471 AbstractCegarLoop]: Abstraction has 16454 states and 16693 transitions. [2025-03-03 10:54:04,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 198.77777777777777) internal successors, (1789), 8 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-03 10:54:04,753 INFO L276 IsEmpty]: Start isEmpty. Operand 16454 states and 16693 transitions. [2025-03-03 10:54:04,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1861 [2025-03-03 10:54:04,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:04,774 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:54:04,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 10:54:04,974 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,SelfDestructingSolverStorable21 [2025-03-03 10:54:04,974 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:04,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:04,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1108873650, now seen corresponding path program 1 times [2025-03-03 10:54:04,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:04,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598143054] [2025-03-03 10:54:04,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:04,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:05,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1860 statements into 1 equivalence classes. [2025-03-03 10:54:05,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1860 of 1860 statements. [2025-03-03 10:54:05,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:05,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:06,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6215 backedges. 2546 proven. 0 refuted. 0 times theorem prover too weak. 3669 trivial. 0 not checked. [2025-03-03 10:54:06,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:06,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598143054] [2025-03-03 10:54:06,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598143054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:06,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:06,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:54:06,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622095934] [2025-03-03 10:54:06,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:06,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:54:06,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:06,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:54:06,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:54:06,685 INFO L87 Difference]: Start difference. First operand 16454 states and 16693 transitions. Second operand has 4 states, 4 states have (on average 182.75) internal successors, (731), 3 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-03 10:54:07,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:07,509 INFO L93 Difference]: Finished difference Result 32906 states and 33387 transitions. [2025-03-03 10:54:07,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:54:07,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 182.75) internal successors, (731), 3 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 1860 [2025-03-03 10:54:07,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:07,523 INFO L225 Difference]: With dead ends: 32906 [2025-03-03 10:54:07,523 INFO L226 Difference]: Without dead ends: 16783 [2025-03-03 10:54:07,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:54:07,532 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 268 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1388 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:07,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 99 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1388 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:54:07,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16783 states. [2025-03-03 10:54:07,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16783 to 16783. [2025-03-03 10:54:07,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16783 states, 16782 states have (on average 1.0144202121320463) internal successors, (17024), 16782 states have internal predecessors, (17024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:07,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16783 states to 16783 states and 17024 transitions. [2025-03-03 10:54:07,652 INFO L78 Accepts]: Start accepts. Automaton has 16783 states and 17024 transitions. Word has length 1860 [2025-03-03 10:54:07,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:07,652 INFO L471 AbstractCegarLoop]: Abstraction has 16783 states and 17024 transitions. [2025-03-03 10:54:07,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 182.75) internal successors, (731), 3 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-03 10:54:07,652 INFO L276 IsEmpty]: Start isEmpty. Operand 16783 states and 17024 transitions. [2025-03-03 10:54:07,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1924 [2025-03-03 10:54:07,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:07,679 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:54:07,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 10:54:07,679 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:07,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:07,680 INFO L85 PathProgramCache]: Analyzing trace with hash -667937980, now seen corresponding path program 1 times [2025-03-03 10:54:07,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:07,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660696555] [2025-03-03 10:54:07,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:07,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:07,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1923 statements into 1 equivalence classes. [2025-03-03 10:54:07,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1923 of 1923 statements. [2025-03-03 10:54:07,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:07,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:09,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6520 backedges. 3431 proven. 0 refuted. 0 times theorem prover too weak. 3089 trivial. 0 not checked. [2025-03-03 10:54:09,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:09,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660696555] [2025-03-03 10:54:09,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660696555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:09,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:09,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:54:09,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324035607] [2025-03-03 10:54:09,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:09,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:09,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:09,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:09,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:09,433 INFO L87 Difference]: Start difference. First operand 16783 states and 17024 transitions. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:10,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:10,005 INFO L93 Difference]: Finished difference Result 34880 states and 35390 transitions. [2025-03-03 10:54:10,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:10,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 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 1923 [2025-03-03 10:54:10,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:10,023 INFO L225 Difference]: With dead ends: 34880 [2025-03-03 10:54:10,023 INFO L226 Difference]: Without dead ends: 18757 [2025-03-03 10:54:10,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:10,034 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 209 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:10,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 44 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:54:10,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18757 states. [2025-03-03 10:54:10,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18757 to 17441. [2025-03-03 10:54:10,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17441 states, 17440 states have (on average 1.0142775229357799) internal successors, (17689), 17440 states have internal predecessors, (17689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:10,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17441 states to 17441 states and 17689 transitions. [2025-03-03 10:54:10,158 INFO L78 Accepts]: Start accepts. Automaton has 17441 states and 17689 transitions. Word has length 1923 [2025-03-03 10:54:10,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:10,159 INFO L471 AbstractCegarLoop]: Abstraction has 17441 states and 17689 transitions. [2025-03-03 10:54:10,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:10,159 INFO L276 IsEmpty]: Start isEmpty. Operand 17441 states and 17689 transitions. [2025-03-03 10:54:10,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1965 [2025-03-03 10:54:10,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:10,181 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2025-03-03 10:54:10,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 10:54:10,181 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:10,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:10,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1950552255, now seen corresponding path program 1 times [2025-03-03 10:54:10,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:10,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367317737] [2025-03-03 10:54:10,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:10,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:10,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1964 statements into 1 equivalence classes. [2025-03-03 10:54:10,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1964 of 1964 statements. [2025-03-03 10:54:10,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:10,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:12,436 INFO L134 CoverageAnalysis]: Checked inductivity of 7185 backedges. 5299 proven. 41 refuted. 0 times theorem prover too weak. 1845 trivial. 0 not checked. [2025-03-03 10:54:12,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:12,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367317737] [2025-03-03 10:54:12,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367317737] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:54:12,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762638349] [2025-03-03 10:54:12,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:12,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:54:12,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:54:12,441 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-03 10:54:12,443 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-03 10:54:12,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1964 statements into 1 equivalence classes. [2025-03-03 10:54:12,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1964 of 1964 statements. [2025-03-03 10:54:12,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:12,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:12,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 2269 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:54:12,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:54:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 7185 backedges. 3957 proven. 0 refuted. 0 times theorem prover too weak. 3228 trivial. 0 not checked. [2025-03-03 10:54:13,354 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:54:13,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762638349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:13,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:54:13,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 10:54:13,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663752527] [2025-03-03 10:54:13,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:13,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:13,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:13,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:13,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:54:13,355 INFO L87 Difference]: Start difference. First operand 17441 states and 17689 transitions. Second operand has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:13,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:13,879 INFO L93 Difference]: Finished difference Result 34222 states and 34714 transitions. [2025-03-03 10:54:13,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:13,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 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 1964 [2025-03-03 10:54:13,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:13,892 INFO L225 Difference]: With dead ends: 34222 [2025-03-03 10:54:13,892 INFO L226 Difference]: Without dead ends: 17441 [2025-03-03 10:54:13,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1968 GetRequests, 1964 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:54:13,900 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 120 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:13,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 418 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:54:13,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17441 states. [2025-03-03 10:54:13,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17441 to 17441. [2025-03-03 10:54:13,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17441 states, 17440 states have (on average 1.0141055045871559) internal successors, (17686), 17440 states have internal predecessors, (17686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17441 states to 17441 states and 17686 transitions. [2025-03-03 10:54:14,009 INFO L78 Accepts]: Start accepts. Automaton has 17441 states and 17686 transitions. Word has length 1964 [2025-03-03 10:54:14,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:14,010 INFO L471 AbstractCegarLoop]: Abstraction has 17441 states and 17686 transitions. [2025-03-03 10:54:14,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:14,010 INFO L276 IsEmpty]: Start isEmpty. Operand 17441 states and 17686 transitions. [2025-03-03 10:54:14,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2287 [2025-03-03 10:54:14,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:14,036 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:54:14,043 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-03 10:54:14,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:54:14,237 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:14,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:14,237 INFO L85 PathProgramCache]: Analyzing trace with hash 966543547, now seen corresponding path program 1 times [2025-03-03 10:54:14,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:14,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532947631] [2025-03-03 10:54:14,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:14,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:14,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2286 statements into 1 equivalence classes. [2025-03-03 10:54:14,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2286 of 2286 statements. [2025-03-03 10:54:14,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:14,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:15,879 INFO L134 CoverageAnalysis]: Checked inductivity of 10322 backedges. 6449 proven. 49 refuted. 0 times theorem prover too weak. 3824 trivial. 0 not checked. [2025-03-03 10:54:15,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:15,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532947631] [2025-03-03 10:54:15,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532947631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:54:15,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154435841] [2025-03-03 10:54:15,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:15,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:54:15,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:54:15,881 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-03 10:54:15,884 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-03 10:54:16,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2286 statements into 1 equivalence classes. [2025-03-03 10:54:16,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2286 of 2286 statements. [2025-03-03 10:54:16,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:16,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:16,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 2624 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:54:16,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:54:16,543 INFO L134 CoverageAnalysis]: Checked inductivity of 10322 backedges. 2217 proven. 0 refuted. 0 times theorem prover too weak. 8105 trivial. 0 not checked. [2025-03-03 10:54:16,543 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:54:16,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154435841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:16,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:54:16,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 10:54:16,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495384742] [2025-03-03 10:54:16,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:16,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:16,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:16,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:16,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:54:16,545 INFO L87 Difference]: Start difference. First operand 17441 states and 17686 transitions. Second operand has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:17,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:17,074 INFO L93 Difference]: Finished difference Result 35867 states and 36378 transitions. [2025-03-03 10:54:17,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:17,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 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 2286 [2025-03-03 10:54:17,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:17,091 INFO L225 Difference]: With dead ends: 35867 [2025-03-03 10:54:17,091 INFO L226 Difference]: Without dead ends: 19086 [2025-03-03 10:54:17,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2290 GetRequests, 2286 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:54:17,102 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 77 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:17,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 414 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:54:17,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19086 states. [2025-03-03 10:54:17,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19086 to 18757. [2025-03-03 10:54:17,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18757 states, 18756 states have (on average 1.0135956493921945) internal successors, (19011), 18756 states have internal predecessors, (19011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:17,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18757 states to 18757 states and 19011 transitions. [2025-03-03 10:54:17,234 INFO L78 Accepts]: Start accepts. Automaton has 18757 states and 19011 transitions. Word has length 2286 [2025-03-03 10:54:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:17,235 INFO L471 AbstractCegarLoop]: Abstraction has 18757 states and 19011 transitions. [2025-03-03 10:54:17,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 18757 states and 19011 transitions. [2025-03-03 10:54:17,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2334 [2025-03-03 10:54:17,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:17,263 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:54:17,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 10:54:17,463 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-03 10:54:17,463 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:17,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:17,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1188617671, now seen corresponding path program 1 times [2025-03-03 10:54:17,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:17,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950868028] [2025-03-03 10:54:17,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:17,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:17,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2333 statements into 1 equivalence classes. [2025-03-03 10:54:17,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2333 of 2333 statements. [2025-03-03 10:54:17,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:17,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 10608 backedges. 7345 proven. 153 refuted. 0 times theorem prover too weak. 3110 trivial. 0 not checked. [2025-03-03 10:54:20,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:20,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950868028] [2025-03-03 10:54:20,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950868028] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:54:20,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336146198] [2025-03-03 10:54:20,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:20,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:54:20,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:54:20,059 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-03 10:54:20,059 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-03 10:54:20,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2333 statements into 1 equivalence classes. [2025-03-03 10:54:20,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2333 of 2333 statements. [2025-03-03 10:54:20,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:20,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:20,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 2673 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:54:20,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:54:20,557 INFO L134 CoverageAnalysis]: Checked inductivity of 10608 backedges. 5725 proven. 0 refuted. 0 times theorem prover too weak. 4883 trivial. 0 not checked. [2025-03-03 10:54:20,557 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:54:20,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336146198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:20,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:54:20,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 10:54:20,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177126398] [2025-03-03 10:54:20,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:20,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:20,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:20,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:20,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:54:20,560 INFO L87 Difference]: Start difference. First operand 18757 states and 19011 transitions. Second operand has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:21,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:21,151 INFO L93 Difference]: Finished difference Result 38828 states and 39361 transitions. [2025-03-03 10:54:21,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:21,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 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 2333 [2025-03-03 10:54:21,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:21,168 INFO L225 Difference]: With dead ends: 38828 [2025-03-03 10:54:21,168 INFO L226 Difference]: Without dead ends: 20731 [2025-03-03 10:54:21,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2338 GetRequests, 2333 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-03 10:54:21,179 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 221 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:21,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 416 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:54:21,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20731 states. [2025-03-03 10:54:21,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20731 to 19744. [2025-03-03 10:54:21,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19744 states, 19743 states have (on average 1.0132198753988755) internal successors, (20004), 19743 states have internal predecessors, (20004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19744 states to 19744 states and 20004 transitions. [2025-03-03 10:54:21,319 INFO L78 Accepts]: Start accepts. Automaton has 19744 states and 20004 transitions. Word has length 2333 [2025-03-03 10:54:21,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:21,319 INFO L471 AbstractCegarLoop]: Abstraction has 19744 states and 20004 transitions. [2025-03-03 10:54:21,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:21,319 INFO L276 IsEmpty]: Start isEmpty. Operand 19744 states and 20004 transitions. [2025-03-03 10:54:21,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2458 [2025-03-03 10:54:21,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:21,391 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:54:21,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 10:54:21,591 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-03 10:54:21,591 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:21,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:21,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1177451685, now seen corresponding path program 1 times [2025-03-03 10:54:21,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:21,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022929314] [2025-03-03 10:54:21,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:21,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:21,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2457 statements into 1 equivalence classes. [2025-03-03 10:54:21,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2457 of 2457 statements. [2025-03-03 10:54:21,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:21,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:24,257 INFO L134 CoverageAnalysis]: Checked inductivity of 11347 backedges. 8002 proven. 153 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2025-03-03 10:54:24,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:24,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022929314] [2025-03-03 10:54:24,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022929314] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:54:24,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696015482] [2025-03-03 10:54:24,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:24,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:54:24,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:54:24,284 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-03 10:54:24,285 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-03 10:54:24,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2457 statements into 1 equivalence classes. [2025-03-03 10:54:24,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2457 of 2457 statements. [2025-03-03 10:54:24,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:24,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:24,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 2776 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 10:54:24,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:54:32,555 INFO L134 CoverageAnalysis]: Checked inductivity of 11347 backedges. 7451 proven. 67 refuted. 0 times theorem prover too weak. 3829 trivial. 0 not checked. [2025-03-03 10:54:32,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:54:35,107 INFO L134 CoverageAnalysis]: Checked inductivity of 11347 backedges. 6350 proven. 0 refuted. 0 times theorem prover too weak. 4997 trivial. 0 not checked. [2025-03-03 10:54:35,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696015482] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 10:54:35,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 10:54:35,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 4] total 9 [2025-03-03 10:54:35,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397081285] [2025-03-03 10:54:35,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:35,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:35,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:35,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:35,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:54:35,109 INFO L87 Difference]: Start difference. First operand 19744 states and 20004 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-03 10:54:35,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:35,721 INFO L93 Difference]: Finished difference Result 39486 states and 40007 transitions. [2025-03-03 10:54:35,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:35,722 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 2457 [2025-03-03 10:54:35,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:35,738 INFO L225 Difference]: With dead ends: 39486 [2025-03-03 10:54:35,738 INFO L226 Difference]: Without dead ends: 20402 [2025-03-03 10:54:35,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4918 GetRequests, 4911 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-03 10:54:35,750 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 269 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:35,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 32 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:54:35,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20402 states. [2025-03-03 10:54:35,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20402 to 19086. [2025-03-03 10:54:35,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19086 states, 19085 states have (on average 1.0121037463976945) internal successors, (19316), 19085 states have internal predecessors, (19316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:35,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19086 states to 19086 states and 19316 transitions. [2025-03-03 10:54:35,910 INFO L78 Accepts]: Start accepts. Automaton has 19086 states and 19316 transitions. Word has length 2457 [2025-03-03 10:54:35,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:35,910 INFO L471 AbstractCegarLoop]: Abstraction has 19086 states and 19316 transitions. [2025-03-03 10:54:35,911 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-03 10:54:35,911 INFO L276 IsEmpty]: Start isEmpty. Operand 19086 states and 19316 transitions. [2025-03-03 10:54:35,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2508 [2025-03-03 10:54:35,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:35,940 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:54:35,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 10:54:36,141 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-03 10:54:36,141 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:36,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:36,142 INFO L85 PathProgramCache]: Analyzing trace with hash -738905621, now seen corresponding path program 1 times [2025-03-03 10:54:36,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:36,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531143303] [2025-03-03 10:54:36,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:36,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:36,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2507 statements into 1 equivalence classes. [2025-03-03 10:54:36,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2507 of 2507 statements. [2025-03-03 10:54:36,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:36,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:39,543 INFO L134 CoverageAnalysis]: Checked inductivity of 11776 backedges. 7077 proven. 1844 refuted. 0 times theorem prover too weak. 2855 trivial. 0 not checked. [2025-03-03 10:54:39,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:39,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531143303] [2025-03-03 10:54:39,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531143303] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:54:39,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113276777] [2025-03-03 10:54:39,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:39,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:54:39,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:54:39,546 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-03 10:54:39,547 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-03 10:54:39,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2507 statements into 1 equivalence classes. [2025-03-03 10:54:39,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2507 of 2507 statements. [2025-03-03 10:54:39,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:39,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:39,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 2828 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 10:54:39,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:54:40,515 INFO L134 CoverageAnalysis]: Checked inductivity of 11776 backedges. 7757 proven. 250 refuted. 0 times theorem prover too weak. 3769 trivial. 0 not checked. [2025-03-03 10:54:40,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:54:41,519 INFO L134 CoverageAnalysis]: Checked inductivity of 11776 backedges. 6733 proven. 0 refuted. 0 times theorem prover too weak. 5043 trivial. 0 not checked. [2025-03-03 10:54:41,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113276777] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 10:54:41,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 10:54:41,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 8 [2025-03-03 10:54:41,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146955386] [2025-03-03 10:54:41,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:41,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:41,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:41,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:41,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:54:41,522 INFO L87 Difference]: Start difference. First operand 19086 states and 19316 transitions. Second operand has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)