./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label21.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/Problem13_label21.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 14f7b86bfc883455824a54ae68bb832997924960967cf306b251b3f457d9ff4b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:42:06,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:42:06,444 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:42:06,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:42:06,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:42:06,473 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:42:06,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:42:06,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:42:06,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:42:06,474 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:42:06,474 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:42:06,474 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:42:06,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:42:06,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:42:06,474 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:42:06,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:42:06,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:42:06,474 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:42:06,475 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:42:06,475 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:42:06,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:42:06,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:42:06,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:42:06,475 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:42:06,475 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:42:06,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:42:06,475 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:42:06,475 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:42:06,475 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:42:06,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:42:06,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:42:06,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:42:06,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:42:06,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:42:06,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:42:06,476 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:42:06,476 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:42:06,476 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:42:06,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:42:06,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:42:06,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:42:06,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:42:06,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:42:06,477 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 -> 14f7b86bfc883455824a54ae68bb832997924960967cf306b251b3f457d9ff4b [2025-03-03 10:42:06,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:42:06,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:42:06,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:42:06,701 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:42:06,701 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:42:06,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label21.c [2025-03-03 10:42:07,781 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bb59cc3a/ae88a1e7487149039839f3e0f39f24e0/FLAGca9a89d21 [2025-03-03 10:42:08,213 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:42:08,214 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label21.c [2025-03-03 10:42:08,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bb59cc3a/ae88a1e7487149039839f3e0f39f24e0/FLAGca9a89d21 [2025-03-03 10:42:08,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bb59cc3a/ae88a1e7487149039839f3e0f39f24e0 [2025-03-03 10:42:08,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:42:08,260 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:42:08,261 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:42:08,261 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:42:08,265 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:42:08,267 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:42:08" (1/1) ... [2025-03-03 10:42:08,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34dc6e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:08, skipping insertion in model container [2025-03-03 10:42:08,269 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:42:08" (1/1) ... [2025-03-03 10:42:08,354 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:42:08,548 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/Problem13_label21.c[3130,3143] [2025-03-03 10:42:09,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:42:09,086 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:42:09,098 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/Problem13_label21.c[3130,3143] [2025-03-03 10:42:09,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:42:09,422 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:42:09,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:09 WrapperNode [2025-03-03 10:42:09,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:42:09,424 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:42:09,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:42:09,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:42:09,430 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:42:09" (1/1) ... [2025-03-03 10:42:09,470 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:42:09" (1/1) ... [2025-03-03 10:42:09,785 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-03 10:42:09,785 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:42:09,786 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:42:09,786 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:42:09,786 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:42:09,792 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:09" (1/1) ... [2025-03-03 10:42:09,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:09" (1/1) ... [2025-03-03 10:42:09,867 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:09" (1/1) ... [2025-03-03 10:42:10,133 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:42:10,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:09" (1/1) ... [2025-03-03 10:42:10,134 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:09" (1/1) ... [2025-03-03 10:42:10,228 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:09" (1/1) ... [2025-03-03 10:42:10,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:09" (1/1) ... [2025-03-03 10:42:10,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:09" (1/1) ... [2025-03-03 10:42:10,285 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:09" (1/1) ... [2025-03-03 10:42:10,325 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:42:10,326 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:42:10,326 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:42:10,327 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:42:10,327 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:09" (1/1) ... [2025-03-03 10:42:10,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:42:10,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:42:10,350 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:42:10,354 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:42:10,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:42:10,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:42:10,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:42:10,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:42:10,415 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:42:10,416 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:42:14,303 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-03 10:42:14,303 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:42:14,303 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:42:14,434 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-03 10:42:14,434 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:42:14,469 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:42:14,469 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:42:14,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:42:14 BoogieIcfgContainer [2025-03-03 10:42:14,469 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:42:14,471 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:42:14,471 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:42:14,475 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:42:14,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:42:08" (1/3) ... [2025-03-03 10:42:14,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42208bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:42:14, skipping insertion in model container [2025-03-03 10:42:14,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:09" (2/3) ... [2025-03-03 10:42:14,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42208bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:42:14, skipping insertion in model container [2025-03-03 10:42:14,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:42:14" (3/3) ... [2025-03-03 10:42:14,477 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label21.c [2025-03-03 10:42:14,490 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:42:14,491 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label21.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:42:14,556 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:42:14,566 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;@59f67d76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:42:14,566 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:42:14,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states 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:42:14,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 10:42:14,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:14,578 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:14,578 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:14,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:14,583 INFO L85 PathProgramCache]: Analyzing trace with hash -10876247, now seen corresponding path program 1 times [2025-03-03 10:42:14,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:14,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496179533] [2025-03-03 10:42:14,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:14,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:14,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 10:42:14,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 10:42:14,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:14,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:14,794 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:42:14,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:14,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496179533] [2025-03-03 10:42:14,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496179533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:14,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:14,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:42:14,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394006815] [2025-03-03 10:42:14,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:14,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:14,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:14,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:14,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:14,818 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 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.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states 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:42:18,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:18,191 INFO L93 Difference]: Finished difference Result 3121 states and 5801 transitions. [2025-03-03 10:42:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:18,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-03-03 10:42:18,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:18,217 INFO L225 Difference]: With dead ends: 3121 [2025-03-03 10:42:18,217 INFO L226 Difference]: Without dead ends: 1944 [2025-03-03 10:42:18,225 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:42:18,230 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 969 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 3124 mSolverCounterSat, 577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 3701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 577 IncrementalHoareTripleChecker+Valid, 3124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:18,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 571 Invalid, 3701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [577 Valid, 3124 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-03 10:42:18,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2025-03-03 10:42:18,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1873. [2025-03-03 10:42:18,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1872 states have (on average 1.7393162393162394) internal successors, (3256), 1872 states have internal predecessors, (3256), 0 states have call successors, (0), 0 states 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:42:18,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 3256 transitions. [2025-03-03 10:42:18,346 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 3256 transitions. Word has length 20 [2025-03-03 10:42:18,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:18,346 INFO L471 AbstractCegarLoop]: Abstraction has 1873 states and 3256 transitions. [2025-03-03 10:42:18,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states 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:42:18,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 3256 transitions. [2025-03-03 10:42:18,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 10:42:18,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:18,348 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:42:18,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:42:18,349 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:18,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:18,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2117954402, now seen corresponding path program 1 times [2025-03-03 10:42:18,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:18,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551108741] [2025-03-03 10:42:18,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:18,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:18,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 10:42:18,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 10:42:18,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:18,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:18,701 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:42:18,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:18,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551108741] [2025-03-03 10:42:18,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551108741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:18,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:18,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:42:18,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413373676] [2025-03-03 10:42:18,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:18,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:18,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:18,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:18,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:18,704 INFO L87 Difference]: Start difference. First operand 1873 states and 3256 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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:42:21,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:21,401 INFO L93 Difference]: Finished difference Result 4604 states and 7964 transitions. [2025-03-03 10:42:21,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:21,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-03 10:42:21,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:21,410 INFO L225 Difference]: With dead ends: 4604 [2025-03-03 10:42:21,411 INFO L226 Difference]: Without dead ends: 2733 [2025-03-03 10:42:21,413 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:42:21,414 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 815 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 3016 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 3180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 3016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:21,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 738 Invalid, 3180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 3016 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 10:42:21,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2025-03-03 10:42:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 2670. [2025-03-03 10:42:21,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2670 states, 2669 states have (on average 1.6579243162233046) internal successors, (4425), 2669 states have internal predecessors, (4425), 0 states have call successors, (0), 0 states 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:42:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 4425 transitions. [2025-03-03 10:42:21,466 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 4425 transitions. Word has length 85 [2025-03-03 10:42:21,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:21,467 INFO L471 AbstractCegarLoop]: Abstraction has 2670 states and 4425 transitions. [2025-03-03 10:42:21,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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:42:21,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 4425 transitions. [2025-03-03 10:42:21,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 10:42:21,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:21,472 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:42:21,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:42:21,472 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:21,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:21,473 INFO L85 PathProgramCache]: Analyzing trace with hash 464732720, now seen corresponding path program 1 times [2025-03-03 10:42:21,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:21,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442161613] [2025-03-03 10:42:21,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:21,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:21,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 10:42:21,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 10:42:21,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:21,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:21,599 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:42:21,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:21,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442161613] [2025-03-03 10:42:21,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442161613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:21,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:21,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:42:21,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287337643] [2025-03-03 10:42:21,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:21,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:21,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:21,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:21,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:21,603 INFO L87 Difference]: Start difference. First operand 2670 states and 4425 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:42:23,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:23,991 INFO L93 Difference]: Finished difference Result 7732 states and 12864 transitions. [2025-03-03 10:42:23,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:23,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-03 10:42:23,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:24,005 INFO L225 Difference]: With dead ends: 7732 [2025-03-03 10:42:24,005 INFO L226 Difference]: Without dead ends: 5064 [2025-03-03 10:42:24,009 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:42:24,010 INFO L435 NwaCegarLoop]: 983 mSDtfsCounter, 870 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 3255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:24,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 1136 Invalid, 3255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:42:24,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5064 states. [2025-03-03 10:42:24,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5064 to 5063. [2025-03-03 10:42:24,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5063 states, 5062 states have (on average 1.454563413670486) internal successors, (7363), 5062 states have internal predecessors, (7363), 0 states have call successors, (0), 0 states 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:42:24,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5063 states to 5063 states and 7363 transitions. [2025-03-03 10:42:24,077 INFO L78 Accepts]: Start accepts. Automaton has 5063 states and 7363 transitions. Word has length 86 [2025-03-03 10:42:24,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:24,077 INFO L471 AbstractCegarLoop]: Abstraction has 5063 states and 7363 transitions. [2025-03-03 10:42:24,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:42:24,078 INFO L276 IsEmpty]: Start isEmpty. Operand 5063 states and 7363 transitions. [2025-03-03 10:42:24,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 10:42:24,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:24,078 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:42:24,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:42:24,079 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:24,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:24,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1317417816, now seen corresponding path program 1 times [2025-03-03 10:42:24,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:24,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359308398] [2025-03-03 10:42:24,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:24,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:24,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 10:42:24,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 10:42:24,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:24,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:24,213 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:42:24,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:24,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359308398] [2025-03-03 10:42:24,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359308398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:24,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:24,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:42:24,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755798626] [2025-03-03 10:42:24,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:24,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:24,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:24,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:24,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:24,216 INFO L87 Difference]: Start difference. First operand 5063 states and 7363 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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:42:27,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:27,101 INFO L93 Difference]: Finished difference Result 12513 states and 18431 transitions. [2025-03-03 10:42:27,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:27,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-03 10:42:27,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:27,119 INFO L225 Difference]: With dead ends: 12513 [2025-03-03 10:42:27,119 INFO L226 Difference]: Without dead ends: 7452 [2025-03-03 10:42:27,126 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:42:27,126 INFO L435 NwaCegarLoop]: 1042 mSDtfsCounter, 871 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2661 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 3380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 2661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:27,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1175 Invalid, 3380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 2661 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 10:42:27,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7452 states. [2025-03-03 10:42:27,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7452 to 7444. [2025-03-03 10:42:27,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7444 states, 7443 states have (on average 1.336826548434771) internal successors, (9950), 7443 states have internal predecessors, (9950), 0 states have call successors, (0), 0 states 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:42:27,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7444 states to 7444 states and 9950 transitions. [2025-03-03 10:42:27,222 INFO L78 Accepts]: Start accepts. Automaton has 7444 states and 9950 transitions. Word has length 89 [2025-03-03 10:42:27,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:27,222 INFO L471 AbstractCegarLoop]: Abstraction has 7444 states and 9950 transitions. [2025-03-03 10:42:27,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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:42:27,222 INFO L276 IsEmpty]: Start isEmpty. Operand 7444 states and 9950 transitions. [2025-03-03 10:42:27,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 10:42:27,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:27,223 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:27,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:42:27,224 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:27,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:27,224 INFO L85 PathProgramCache]: Analyzing trace with hash -260184084, now seen corresponding path program 1 times [2025-03-03 10:42:27,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:27,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753972193] [2025-03-03 10:42:27,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:27,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:27,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 10:42:27,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 10:42:27,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:27,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:27,318 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:42:27,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:27,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753972193] [2025-03-03 10:42:27,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753972193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:27,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:27,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:42:27,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311620385] [2025-03-03 10:42:27,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:27,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:27,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:27,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:27,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:27,320 INFO L87 Difference]: Start difference. First operand 7444 states and 9950 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:42:29,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:29,693 INFO L93 Difference]: Finished difference Result 20424 states and 27781 transitions. [2025-03-03 10:42:29,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:29,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-03-03 10:42:29,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:29,722 INFO L225 Difference]: With dead ends: 20424 [2025-03-03 10:42:29,722 INFO L226 Difference]: Without dead ends: 13769 [2025-03-03 10:42:29,727 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:42:29,728 INFO L435 NwaCegarLoop]: 1010 mSDtfsCounter, 806 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2489 mSolverCounterSat, 784 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 3273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 784 IncrementalHoareTripleChecker+Valid, 2489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:29,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 1160 Invalid, 3273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [784 Valid, 2489 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:42:29,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13769 states. [2025-03-03 10:42:29,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13769 to 13751. [2025-03-03 10:42:29,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13751 states, 13750 states have (on average 1.2261090909090908) internal successors, (16859), 13750 states have internal predecessors, (16859), 0 states have call successors, (0), 0 states 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:42:29,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13751 states to 13751 states and 16859 transitions. [2025-03-03 10:42:29,891 INFO L78 Accepts]: Start accepts. Automaton has 13751 states and 16859 transitions. Word has length 93 [2025-03-03 10:42:29,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:29,892 INFO L471 AbstractCegarLoop]: Abstraction has 13751 states and 16859 transitions. [2025-03-03 10:42:29,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:42:29,892 INFO L276 IsEmpty]: Start isEmpty. Operand 13751 states and 16859 transitions. [2025-03-03 10:42:29,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 10:42:29,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:29,893 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:42:29,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:42:29,895 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:29,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:29,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1913643200, now seen corresponding path program 1 times [2025-03-03 10:42:29,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:29,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842315196] [2025-03-03 10:42:29,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:29,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:29,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 10:42:29,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 10:42:29,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:29,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:29,990 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:42:29,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:29,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842315196] [2025-03-03 10:42:29,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842315196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:29,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:29,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:42:29,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478491928] [2025-03-03 10:42:29,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:29,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:29,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:29,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:29,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:29,994 INFO L87 Difference]: Start difference. First operand 13751 states and 16859 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states 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:42:32,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:32,408 INFO L93 Difference]: Finished difference Result 33022 states and 41589 transitions. [2025-03-03 10:42:32,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:32,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-03 10:42:32,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:32,442 INFO L225 Difference]: With dead ends: 33022 [2025-03-03 10:42:32,442 INFO L226 Difference]: Without dead ends: 20060 [2025-03-03 10:42:32,454 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:42:32,456 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 977 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 2549 mSolverCounterSat, 822 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 3371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 822 IncrementalHoareTripleChecker+Valid, 2549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:32,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 1671 Invalid, 3371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [822 Valid, 2549 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:42:32,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20060 states. [2025-03-03 10:42:32,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20060 to 20050. [2025-03-03 10:42:32,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20050 states, 20049 states have (on average 1.2318320115716495) internal successors, (24697), 20049 states have internal predecessors, (24697), 0 states have call successors, (0), 0 states 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:42:32,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20050 states to 20050 states and 24697 transitions. [2025-03-03 10:42:32,763 INFO L78 Accepts]: Start accepts. Automaton has 20050 states and 24697 transitions. Word has length 109 [2025-03-03 10:42:32,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:32,763 INFO L471 AbstractCegarLoop]: Abstraction has 20050 states and 24697 transitions. [2025-03-03 10:42:32,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states 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:42:32,764 INFO L276 IsEmpty]: Start isEmpty. Operand 20050 states and 24697 transitions. [2025-03-03 10:42:32,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 10:42:32,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:32,765 INFO L218 NwaCegarLoop]: trace histogram [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:42:32,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:42:32,765 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:32,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:32,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1330541308, now seen corresponding path program 1 times [2025-03-03 10:42:32,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:32,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622834761] [2025-03-03 10:42:32,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:32,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:32,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 10:42:32,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 10:42:32,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:32,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:42:32,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:32,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622834761] [2025-03-03 10:42:32,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622834761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:32,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:32,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:42:32,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583236975] [2025-03-03 10:42:32,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:32,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:32,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:32,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:32,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:32,856 INFO L87 Difference]: Start difference. First operand 20050 states and 24697 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:42:35,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:35,507 INFO L93 Difference]: Finished difference Result 39329 states and 48628 transitions. [2025-03-03 10:42:35,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:35,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2025-03-03 10:42:35,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:35,539 INFO L225 Difference]: With dead ends: 39329 [2025-03-03 10:42:35,540 INFO L226 Difference]: Without dead ends: 20068 [2025-03-03 10:42:35,556 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:42:35,557 INFO L435 NwaCegarLoop]: 1320 mSDtfsCounter, 1104 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 2469 mSolverCounterSat, 608 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1104 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 3077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 608 IncrementalHoareTripleChecker+Valid, 2469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:35,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1104 Valid, 1373 Invalid, 3077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [608 Valid, 2469 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:42:35,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20068 states. [2025-03-03 10:42:35,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20068 to 20050. [2025-03-03 10:42:35,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20050 states, 20049 states have (on average 1.2169185495535937) internal successors, (24398), 20049 states have internal predecessors, (24398), 0 states have call successors, (0), 0 states 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:42:35,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20050 states to 20050 states and 24398 transitions. [2025-03-03 10:42:35,746 INFO L78 Accepts]: Start accepts. Automaton has 20050 states and 24398 transitions. Word has length 116 [2025-03-03 10:42:35,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:35,747 INFO L471 AbstractCegarLoop]: Abstraction has 20050 states and 24398 transitions. [2025-03-03 10:42:35,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:42:35,747 INFO L276 IsEmpty]: Start isEmpty. Operand 20050 states and 24398 transitions. [2025-03-03 10:42:35,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 10:42:35,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:35,748 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:35,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:42:35,749 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:35,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:35,749 INFO L85 PathProgramCache]: Analyzing trace with hash -211676871, now seen corresponding path program 1 times [2025-03-03 10:42:35,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:35,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227611055] [2025-03-03 10:42:35,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:35,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:35,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 10:42:35,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 10:42:35,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:35,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:36,036 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 10:42:36,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:36,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227611055] [2025-03-03 10:42:36,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227611055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:36,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:36,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:42:36,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33154394] [2025-03-03 10:42:36,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:36,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:36,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:36,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:36,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:36,039 INFO L87 Difference]: Start difference. First operand 20050 states and 24398 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:42:38,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:38,142 INFO L93 Difference]: Finished difference Result 39311 states and 47997 transitions. [2025-03-03 10:42:38,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:38,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 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 191 [2025-03-03 10:42:38,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:38,166 INFO L225 Difference]: With dead ends: 39311 [2025-03-03 10:42:38,166 INFO L226 Difference]: Without dead ends: 20050 [2025-03-03 10:42:38,181 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:42:38,182 INFO L435 NwaCegarLoop]: 1077 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2514 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 2518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:38,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1206 Invalid, 2518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2514 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:42:38,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20050 states. [2025-03-03 10:42:38,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20050 to 20050. [2025-03-03 10:42:38,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20050 states, 20049 states have (on average 1.2166691605566362) internal successors, (24393), 20049 states have internal predecessors, (24393), 0 states have call successors, (0), 0 states 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:42:38,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20050 states to 20050 states and 24393 transitions. [2025-03-03 10:42:38,361 INFO L78 Accepts]: Start accepts. Automaton has 20050 states and 24393 transitions. Word has length 191 [2025-03-03 10:42:38,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:38,362 INFO L471 AbstractCegarLoop]: Abstraction has 20050 states and 24393 transitions. [2025-03-03 10:42:38,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:42:38,363 INFO L276 IsEmpty]: Start isEmpty. Operand 20050 states and 24393 transitions. [2025-03-03 10:42:38,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 10:42:38,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:38,366 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:38,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:42:38,366 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:38,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:38,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1882354187, now seen corresponding path program 1 times [2025-03-03 10:42:38,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:38,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219251579] [2025-03-03 10:42:38,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:38,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:38,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 10:42:38,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 10:42:38,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:38,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:38,470 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:42:38,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:38,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219251579] [2025-03-03 10:42:38,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219251579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:38,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:38,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:42:38,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268307491] [2025-03-03 10:42:38,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:38,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:38,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:38,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:38,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:38,473 INFO L87 Difference]: Start difference. First operand 20050 states and 24393 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states 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:42:40,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:40,898 INFO L93 Difference]: Finished difference Result 39321 states and 48009 transitions. [2025-03-03 10:42:40,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:40,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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 198 [2025-03-03 10:42:40,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:40,919 INFO L225 Difference]: With dead ends: 39321 [2025-03-03 10:42:40,920 INFO L226 Difference]: Without dead ends: 20060 [2025-03-03 10:42:40,929 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:42:40,930 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 887 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 3145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:40,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 928 Invalid, 3145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:42:40,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20060 states. [2025-03-03 10:42:41,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20060 to 20050. [2025-03-03 10:42:41,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20050 states, 20049 states have (on average 1.1535737443264003) internal successors, (23128), 20049 states have internal predecessors, (23128), 0 states have call successors, (0), 0 states 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:42:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20050 states to 20050 states and 23128 transitions. [2025-03-03 10:42:41,080 INFO L78 Accepts]: Start accepts. Automaton has 20050 states and 23128 transitions. Word has length 198 [2025-03-03 10:42:41,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:41,080 INFO L471 AbstractCegarLoop]: Abstraction has 20050 states and 23128 transitions. [2025-03-03 10:42:41,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states 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:42:41,080 INFO L276 IsEmpty]: Start isEmpty. Operand 20050 states and 23128 transitions. [2025-03-03 10:42:41,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-03 10:42:41,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:41,086 INFO L218 NwaCegarLoop]: trace histogram [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, 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:42:41,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:42:41,086 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:41,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:41,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1127809798, now seen corresponding path program 1 times [2025-03-03 10:42:41,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:41,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660817737] [2025-03-03 10:42:41,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:41,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:41,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-03 10:42:41,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-03 10:42:41,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:41,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-03 10:42:41,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:41,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660817737] [2025-03-03 10:42:41,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660817737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:41,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:41,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:42:41,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030480289] [2025-03-03 10:42:41,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:41,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:41,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:41,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:41,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:41,216 INFO L87 Difference]: Start difference. First operand 20050 states and 23128 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:43,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:43,591 INFO L93 Difference]: Finished difference Result 45630 states and 53337 transitions. [2025-03-03 10:42:43,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:43,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 287 [2025-03-03 10:42:43,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:43,616 INFO L225 Difference]: With dead ends: 45630 [2025-03-03 10:42:43,617 INFO L226 Difference]: Without dead ends: 26369 [2025-03-03 10:42:43,626 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:42:43,626 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 968 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 844 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 3227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 844 IncrementalHoareTripleChecker+Valid, 2383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:43,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 787 Invalid, 3227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [844 Valid, 2383 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:42:43,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26369 states. [2025-03-03 10:42:43,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26369 to 26357. [2025-03-03 10:42:43,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26357 states, 26356 states have (on average 1.145204128092275) internal successors, (30183), 26356 states have internal predecessors, (30183), 0 states have call successors, (0), 0 states 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:42:43,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26357 states to 26357 states and 30183 transitions. [2025-03-03 10:42:43,833 INFO L78 Accepts]: Start accepts. Automaton has 26357 states and 30183 transitions. Word has length 287 [2025-03-03 10:42:43,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:43,833 INFO L471 AbstractCegarLoop]: Abstraction has 26357 states and 30183 transitions. [2025-03-03 10:42:43,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:43,833 INFO L276 IsEmpty]: Start isEmpty. Operand 26357 states and 30183 transitions. [2025-03-03 10:42:43,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-03-03 10:42:43,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:43,838 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-03 10:42:43,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:42:43,838 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:43,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:43,838 INFO L85 PathProgramCache]: Analyzing trace with hash 176812785, now seen corresponding path program 1 times [2025-03-03 10:42:43,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:43,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621742357] [2025-03-03 10:42:43,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:43,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:43,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-03 10:42:43,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-03 10:42:43,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:43,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:44,078 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 10:42:44,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:44,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621742357] [2025-03-03 10:42:44,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621742357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:44,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:44,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:42:44,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380480549] [2025-03-03 10:42:44,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:44,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:44,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:44,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:44,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:44,080 INFO L87 Difference]: Start difference. First operand 26357 states and 30183 transitions. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states 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:42:46,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:46,382 INFO L93 Difference]: Finished difference Result 51951 states and 59618 transitions. [2025-03-03 10:42:46,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:46,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 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 339 [2025-03-03 10:42:46,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:46,410 INFO L225 Difference]: With dead ends: 51951 [2025-03-03 10:42:46,410 INFO L226 Difference]: Without dead ends: 26383 [2025-03-03 10:42:46,423 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:42:46,423 INFO L435 NwaCegarLoop]: 1775 mSDtfsCounter, 780 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 2543 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 1916 SdHoareTripleChecker+Invalid, 2730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 2543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:46,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 1916 Invalid, 2730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 2543 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:42:46,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26383 states. [2025-03-03 10:42:46,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26383 to 26357. [2025-03-03 10:42:46,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26357 states, 26356 states have (on average 1.140992563363181) internal successors, (30072), 26356 states have internal predecessors, (30072), 0 states have call successors, (0), 0 states 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:42:46,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26357 states to 26357 states and 30072 transitions. [2025-03-03 10:42:46,694 INFO L78 Accepts]: Start accepts. Automaton has 26357 states and 30072 transitions. Word has length 339 [2025-03-03 10:42:46,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:46,695 INFO L471 AbstractCegarLoop]: Abstraction has 26357 states and 30072 transitions. [2025-03-03 10:42:46,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states 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:42:46,695 INFO L276 IsEmpty]: Start isEmpty. Operand 26357 states and 30072 transitions. [2025-03-03 10:42:46,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-03-03 10:42:46,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:46,699 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:46,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:42:46,699 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:46,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:46,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1649326024, now seen corresponding path program 1 times [2025-03-03 10:42:46,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:46,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166609844] [2025-03-03 10:42:46,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:46,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:46,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-03 10:42:46,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-03 10:42:46,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:46,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:46,850 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-03 10:42:46,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:46,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166609844] [2025-03-03 10:42:46,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166609844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:46,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:46,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:42:46,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761584975] [2025-03-03 10:42:46,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:46,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:46,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:46,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:46,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:46,852 INFO L87 Difference]: Start difference. First operand 26357 states and 30072 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states 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:42:49,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:49,278 INFO L93 Difference]: Finished difference Result 77099 states and 88119 transitions. [2025-03-03 10:42:49,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:49,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 347 [2025-03-03 10:42:49,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:49,332 INFO L225 Difference]: With dead ends: 77099 [2025-03-03 10:42:49,333 INFO L226 Difference]: Without dead ends: 49953 [2025-03-03 10:42:49,354 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:42:49,355 INFO L435 NwaCegarLoop]: 1671 mSDtfsCounter, 1000 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2407 mSolverCounterSat, 810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 1808 SdHoareTripleChecker+Invalid, 3217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 810 IncrementalHoareTripleChecker+Valid, 2407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:49,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1000 Valid, 1808 Invalid, 3217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [810 Valid, 2407 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:42:49,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49953 states. [2025-03-03 10:42:49,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49953 to 46010. [2025-03-03 10:42:49,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46010 states, 46009 states have (on average 1.1187159034102023) internal successors, (51471), 46009 states have internal predecessors, (51471), 0 states have call successors, (0), 0 states 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:42:49,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46010 states to 46010 states and 51471 transitions. [2025-03-03 10:42:49,796 INFO L78 Accepts]: Start accepts. Automaton has 46010 states and 51471 transitions. Word has length 347 [2025-03-03 10:42:49,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:49,796 INFO L471 AbstractCegarLoop]: Abstraction has 46010 states and 51471 transitions. [2025-03-03 10:42:49,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states 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:42:49,797 INFO L276 IsEmpty]: Start isEmpty. Operand 46010 states and 51471 transitions. [2025-03-03 10:42:49,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-03-03 10:42:49,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:49,800 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:49,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:42:49,800 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:49,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:49,800 INFO L85 PathProgramCache]: Analyzing trace with hash -13039463, now seen corresponding path program 1 times [2025-03-03 10:42:49,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:49,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458856871] [2025-03-03 10:42:49,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:49,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:49,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-03 10:42:49,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-03 10:42:49,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:49,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:50,142 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 71 proven. 75 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-03 10:42:50,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:50,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458856871] [2025-03-03 10:42:50,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458856871] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:42:50,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459548548] [2025-03-03 10:42:50,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:50,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:42:50,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:42:50,147 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:42:50,148 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:42:50,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-03 10:42:50,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-03 10:42:50,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:50,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:50,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:42:50,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:42:50,601 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2025-03-03 10:42:50,602 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:42:50,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459548548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:50,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:42:50,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 10:42:50,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896819012] [2025-03-03 10:42:50,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:50,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:50,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:50,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:50,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:42:50,603 INFO L87 Difference]: Start difference. First operand 46010 states and 51471 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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:42:52,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:52,953 INFO L93 Difference]: Finished difference Result 91222 states and 102140 transitions. [2025-03-03 10:42:52,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:52,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 347 [2025-03-03 10:42:52,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:53,002 INFO L225 Difference]: With dead ends: 91222 [2025-03-03 10:42:53,003 INFO L226 Difference]: Without dead ends: 46001 [2025-03-03 10:42:53,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:42:53,029 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 1041 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2386 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 2386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:53,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 792 Invalid, 2912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 2386 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:42:53,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46001 states. [2025-03-03 10:42:53,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46001 to 46000. [2025-03-03 10:42:53,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46000 states, 45999 states have (on average 1.0863497032544185) internal successors, (49971), 45999 states have internal predecessors, (49971), 0 states have call successors, (0), 0 states 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:42:53,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46000 states to 46000 states and 49971 transitions. [2025-03-03 10:42:53,371 INFO L78 Accepts]: Start accepts. Automaton has 46000 states and 49971 transitions. Word has length 347 [2025-03-03 10:42:53,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:53,372 INFO L471 AbstractCegarLoop]: Abstraction has 46000 states and 49971 transitions. [2025-03-03 10:42:53,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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:42:53,372 INFO L276 IsEmpty]: Start isEmpty. Operand 46000 states and 49971 transitions. [2025-03-03 10:42:53,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-03-03 10:42:53,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:53,375 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-03 10:42:53,382 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:42:53,576 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,SelfDestructingSolverStorable12 [2025-03-03 10:42:53,576 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:53,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:53,577 INFO L85 PathProgramCache]: Analyzing trace with hash -795452880, now seen corresponding path program 1 times [2025-03-03 10:42:53,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:53,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287842219] [2025-03-03 10:42:53,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:53,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:53,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-03-03 10:42:53,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-03-03 10:42:53,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:53,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:54,245 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 251 proven. 110 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 10:42:54,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:54,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287842219] [2025-03-03 10:42:54,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287842219] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:42:54,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402024901] [2025-03-03 10:42:54,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:54,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:42:54,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:42:54,248 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:42:54,249 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:42:54,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-03-03 10:42:54,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-03-03 10:42:54,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:54,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:54,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:42:54,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:42:54,458 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-03 10:42:54,458 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:42:54,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402024901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:54,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:42:54,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:42:54,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746529489] [2025-03-03 10:42:54,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:54,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:54,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:54,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:54,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:42:54,459 INFO L87 Difference]: Start difference. First operand 46000 states and 49971 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states 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:42:57,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:57,321 INFO L93 Difference]: Finished difference Result 101431 states and 110493 transitions. [2025-03-03 10:42:57,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:57,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 368 [2025-03-03 10:42:57,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:57,387 INFO L225 Difference]: With dead ends: 101431 [2025-03-03 10:42:57,387 INFO L226 Difference]: Without dead ends: 56220 [2025-03-03 10:42:57,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:42:57,401 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 1217 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 961 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 3225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 961 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:57,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 399 Invalid, 3225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [961 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 10:42:57,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56220 states. [2025-03-03 10:42:57,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56220 to 56220. [2025-03-03 10:42:57,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56220 states, 56219 states have (on average 1.0820718974012344) internal successors, (60833), 56219 states have internal predecessors, (60833), 0 states have call successors, (0), 0 states 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:42:57,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56220 states to 56220 states and 60833 transitions. [2025-03-03 10:42:57,987 INFO L78 Accepts]: Start accepts. Automaton has 56220 states and 60833 transitions. Word has length 368 [2025-03-03 10:42:57,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:57,987 INFO L471 AbstractCegarLoop]: Abstraction has 56220 states and 60833 transitions. [2025-03-03 10:42:57,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states 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:42:57,987 INFO L276 IsEmpty]: Start isEmpty. Operand 56220 states and 60833 transitions. [2025-03-03 10:42:57,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-03-03 10:42:57,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:57,991 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:58,000 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:42:58,191 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,SelfDestructingSolverStorable13 [2025-03-03 10:42:58,191 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:58,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:58,192 INFO L85 PathProgramCache]: Analyzing trace with hash 87781800, now seen corresponding path program 1 times [2025-03-03 10:42:58,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:58,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300843663] [2025-03-03 10:42:58,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:58,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:58,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-03-03 10:42:58,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-03-03 10:42:58,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:58,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:58,322 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-03 10:42:58,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:58,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300843663] [2025-03-03 10:42:58,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300843663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:58,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:58,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:42:58,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266226061] [2025-03-03 10:42:58,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:58,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:58,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:58,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:58,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:58,323 INFO L87 Difference]: Start difference. First operand 56220 states and 60833 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states 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:43:00,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:00,659 INFO L93 Difference]: Finished difference Result 123460 states and 134160 transitions. [2025-03-03 10:43:00,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:00,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 377 [2025-03-03 10:43:00,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:00,740 INFO L225 Difference]: With dead ends: 123460 [2025-03-03 10:43:00,740 INFO L226 Difference]: Without dead ends: 68029 [2025-03-03 10:43:00,779 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:43:00,780 INFO L435 NwaCegarLoop]: 1744 mSDtfsCounter, 788 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2478 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 1884 SdHoareTripleChecker+Invalid, 2920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 2478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:00,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 1884 Invalid, 2920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [442 Valid, 2478 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:43:00,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68029 states. [2025-03-03 10:43:01,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68029 to 67236. [2025-03-03 10:43:01,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67236 states, 67235 states have (on average 1.0782479363426787) internal successors, (72496), 67235 states have internal predecessors, (72496), 0 states have call successors, (0), 0 states 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:43:01,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67236 states to 67236 states and 72496 transitions. [2025-03-03 10:43:01,435 INFO L78 Accepts]: Start accepts. Automaton has 67236 states and 72496 transitions. Word has length 377 [2025-03-03 10:43:01,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:01,436 INFO L471 AbstractCegarLoop]: Abstraction has 67236 states and 72496 transitions. [2025-03-03 10:43:01,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states 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:43:01,436 INFO L276 IsEmpty]: Start isEmpty. Operand 67236 states and 72496 transitions. [2025-03-03 10:43:01,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-03-03 10:43:01,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:01,439 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:43:01,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:43:01,440 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:01,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:01,441 INFO L85 PathProgramCache]: Analyzing trace with hash -360691240, now seen corresponding path program 1 times [2025-03-03 10:43:01,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:01,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453844171] [2025-03-03 10:43:01,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:01,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:01,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-03-03 10:43:01,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-03-03 10:43:01,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:01,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:01,592 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 454 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-03-03 10:43:01,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:01,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453844171] [2025-03-03 10:43:01,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453844171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:01,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:43:01,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:43:01,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13643812] [2025-03-03 10:43:01,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:01,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:43:01,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:01,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:43:01,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:43:01,595 INFO L87 Difference]: Start difference. First operand 67236 states and 72496 transitions. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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:43:06,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:06,265 INFO L93 Difference]: Finished difference Result 184993 states and 199773 transitions. [2025-03-03 10:43:06,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:43:06,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 382 [2025-03-03 10:43:06,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:06,394 INFO L225 Difference]: With dead ends: 184993 [2025-03-03 10:43:06,394 INFO L226 Difference]: Without dead ends: 118546 [2025-03-03 10:43:06,446 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:43:06,447 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 1672 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 5850 mSolverCounterSat, 956 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1672 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 6806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 956 IncrementalHoareTripleChecker+Valid, 5850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:06,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1672 Valid, 832 Invalid, 6806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [956 Valid, 5850 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-03 10:43:06,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118546 states. [2025-03-03 10:43:07,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118546 to 116870. [2025-03-03 10:43:07,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116870 states, 116869 states have (on average 1.073937485560756) internal successors, (125510), 116869 states have internal predecessors, (125510), 0 states have call successors, (0), 0 states 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:43:07,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116870 states to 116870 states and 125510 transitions. [2025-03-03 10:43:07,565 INFO L78 Accepts]: Start accepts. Automaton has 116870 states and 125510 transitions. Word has length 382 [2025-03-03 10:43:07,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:07,565 INFO L471 AbstractCegarLoop]: Abstraction has 116870 states and 125510 transitions. [2025-03-03 10:43:07,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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:43:07,565 INFO L276 IsEmpty]: Start isEmpty. Operand 116870 states and 125510 transitions. [2025-03-03 10:43:07,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-03-03 10:43:07,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:07,569 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:43:07,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:43:07,569 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:07,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:07,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1643441034, now seen corresponding path program 1 times [2025-03-03 10:43:07,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:07,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713641862] [2025-03-03 10:43:07,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:07,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:07,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-03-03 10:43:07,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-03-03 10:43:07,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:07,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-03 10:43:08,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:08,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713641862] [2025-03-03 10:43:08,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713641862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:08,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:43:08,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:43:08,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777007042] [2025-03-03 10:43:08,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:08,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:08,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:08,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:08,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:43:08,086 INFO L87 Difference]: Start difference. First operand 116870 states and 125510 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states 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:43:10,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:10,952 INFO L93 Difference]: Finished difference Result 232162 states and 249323 transitions. [2025-03-03 10:43:10,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:10,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 415 [2025-03-03 10:43:10,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:11,090 INFO L225 Difference]: With dead ends: 232162 [2025-03-03 10:43:11,090 INFO L226 Difference]: Without dead ends: 116081 [2025-03-03 10:43:11,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:43:11,130 INFO L435 NwaCegarLoop]: 1327 mSDtfsCounter, 1110 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 2430 mSolverCounterSat, 438 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 2430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:11,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 1403 Invalid, 2868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 2430 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:43:11,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116081 states. [2025-03-03 10:43:12,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116081 to 116080. [2025-03-03 10:43:12,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116080 states, 116079 states have (on average 1.0558498953299047) internal successors, (122562), 116079 states have internal predecessors, (122562), 0 states have call successors, (0), 0 states 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:43:12,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116080 states to 116080 states and 122562 transitions. [2025-03-03 10:43:12,307 INFO L78 Accepts]: Start accepts. Automaton has 116080 states and 122562 transitions. Word has length 415 [2025-03-03 10:43:12,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:12,307 INFO L471 AbstractCegarLoop]: Abstraction has 116080 states and 122562 transitions. [2025-03-03 10:43:12,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states 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:43:12,307 INFO L276 IsEmpty]: Start isEmpty. Operand 116080 states and 122562 transitions. [2025-03-03 10:43:12,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2025-03-03 10:43:12,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:12,312 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:43:12,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:43:12,312 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:12,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:12,313 INFO L85 PathProgramCache]: Analyzing trace with hash 191023685, now seen corresponding path program 1 times [2025-03-03 10:43:12,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:12,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152618917] [2025-03-03 10:43:12,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:12,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:12,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-03-03 10:43:12,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-03-03 10:43:12,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:12,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:12,483 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2025-03-03 10:43:12,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:12,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152618917] [2025-03-03 10:43:12,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152618917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:12,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:43:12,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:43:12,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371549715] [2025-03-03 10:43:12,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:12,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:43:12,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:12,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:43:12,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:43:12,485 INFO L87 Difference]: Start difference. First operand 116080 states and 122562 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states 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:43:18,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:18,616 INFO L93 Difference]: Finished difference Result 284218 states and 300085 transitions. [2025-03-03 10:43:18,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:43:18,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 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 451 [2025-03-03 10:43:18,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:18,805 INFO L225 Difference]: With dead ends: 284218 [2025-03-03 10:43:18,805 INFO L226 Difference]: Without dead ends: 168927 [2025-03-03 10:43:18,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:43:18,878 INFO L435 NwaCegarLoop]: 1432 mSDtfsCounter, 1785 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 7912 mSolverCounterSat, 833 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1785 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 8745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 833 IncrementalHoareTripleChecker+Valid, 7912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:18,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1785 Valid, 1677 Invalid, 8745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [833 Valid, 7912 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-03-03 10:43:18,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168927 states. [2025-03-03 10:43:20,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168927 to 164102. [2025-03-03 10:43:20,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164102 states, 164101 states have (on average 1.052875972724115) internal successors, (172778), 164101 states have internal predecessors, (172778), 0 states have call successors, (0), 0 states 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:43:20,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164102 states to 164102 states and 172778 transitions. [2025-03-03 10:43:20,544 INFO L78 Accepts]: Start accepts. Automaton has 164102 states and 172778 transitions. Word has length 451 [2025-03-03 10:43:20,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:20,544 INFO L471 AbstractCegarLoop]: Abstraction has 164102 states and 172778 transitions. [2025-03-03 10:43:20,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states 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:43:20,544 INFO L276 IsEmpty]: Start isEmpty. Operand 164102 states and 172778 transitions. [2025-03-03 10:43:20,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-03-03 10:43:20,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:20,552 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:43:20,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:43:20,552 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:20,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:20,552 INFO L85 PathProgramCache]: Analyzing trace with hash -672122728, now seen corresponding path program 1 times [2025-03-03 10:43:20,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:20,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607497147] [2025-03-03 10:43:20,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:20,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:20,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-03 10:43:20,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-03 10:43:20,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:20,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:21,755 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 273 proven. 113 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 10:43:21,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:21,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607497147] [2025-03-03 10:43:21,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607497147] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:43:21,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625045364] [2025-03-03 10:43:21,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:21,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:43:21,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:43:21,758 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:43:21,759 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:43:21,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-03 10:43:21,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-03 10:43:21,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:21,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:21,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:43:21,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:43:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2025-03-03 10:43:21,916 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:43:21,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625045364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:21,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:43:21,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-03 10:43:21,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711958696] [2025-03-03 10:43:21,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:21,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:21,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:21,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:21,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:43:21,917 INFO L87 Difference]: Start difference. First operand 164102 states and 172778 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:43:25,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:25,391 INFO L93 Difference]: Finished difference Result 358105 states and 377376 transitions. [2025-03-03 10:43:25,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:25,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 483 [2025-03-03 10:43:25,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:25,626 INFO L225 Difference]: With dead ends: 358105 [2025-03-03 10:43:25,627 INFO L226 Difference]: Without dead ends: 194792 [2025-03-03 10:43:25,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:43:25,701 INFO L435 NwaCegarLoop]: 1699 mSDtfsCounter, 791 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 2614 mSolverCounterSat, 431 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 3045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 431 IncrementalHoareTripleChecker+Valid, 2614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:25,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 1855 Invalid, 3045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [431 Valid, 2614 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 10:43:25,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194792 states. [2025-03-03 10:43:27,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194792 to 193218. [2025-03-03 10:43:27,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193218 states, 193217 states have (on average 1.0483963626388981) internal successors, (202568), 193217 states have internal predecessors, (202568), 0 states have call successors, (0), 0 states 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:43:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193218 states to 193218 states and 202568 transitions. [2025-03-03 10:43:28,025 INFO L78 Accepts]: Start accepts. Automaton has 193218 states and 202568 transitions. Word has length 483 [2025-03-03 10:43:28,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:28,025 INFO L471 AbstractCegarLoop]: Abstraction has 193218 states and 202568 transitions. [2025-03-03 10:43:28,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:43:28,025 INFO L276 IsEmpty]: Start isEmpty. Operand 193218 states and 202568 transitions. [2025-03-03 10:43:28,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-03-03 10:43:28,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:28,054 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:43:28,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 10:43:28,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:43:28,259 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:28,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:28,259 INFO L85 PathProgramCache]: Analyzing trace with hash -520125517, now seen corresponding path program 1 times [2025-03-03 10:43:28,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:28,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202942066] [2025-03-03 10:43:28,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:28,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:28,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-03-03 10:43:28,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-03-03 10:43:28,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:28,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:28,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1145 backedges. 855 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-03 10:43:28,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:28,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202942066] [2025-03-03 10:43:28,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202942066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:28,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:43:28,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:43:28,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133582442] [2025-03-03 10:43:28,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:28,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:28,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:28,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:28,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:43:28,647 INFO L87 Difference]: Start difference. First operand 193218 states and 202568 transitions. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states 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:43:31,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:31,625 INFO L93 Difference]: Finished difference Result 378559 states and 396862 transitions. [2025-03-03 10:43:31,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:31,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 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 663 [2025-03-03 10:43:31,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:31,861 INFO L225 Difference]: With dead ends: 378559 [2025-03-03 10:43:31,861 INFO L226 Difference]: Without dead ends: 184556 [2025-03-03 10:43:31,966 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:43:31,967 INFO L435 NwaCegarLoop]: 1639 mSDtfsCounter, 697 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2450 mSolverCounterSat, 405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 2855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 405 IncrementalHoareTripleChecker+Valid, 2450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:31,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 1768 Invalid, 2855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [405 Valid, 2450 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:43:32,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184556 states. [2025-03-03 10:43:33,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184556 to 180605. [2025-03-03 10:43:33,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180605 states, 180604 states have (on average 1.037723416978583) internal successors, (187417), 180604 states have internal predecessors, (187417), 0 states have call successors, (0), 0 states 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:43:33,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180605 states to 180605 states and 187417 transitions. [2025-03-03 10:43:33,855 INFO L78 Accepts]: Start accepts. Automaton has 180605 states and 187417 transitions. Word has length 663 [2025-03-03 10:43:33,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:33,855 INFO L471 AbstractCegarLoop]: Abstraction has 180605 states and 187417 transitions. [2025-03-03 10:43:33,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states 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:43:33,855 INFO L276 IsEmpty]: Start isEmpty. Operand 180605 states and 187417 transitions. [2025-03-03 10:43:33,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2025-03-03 10:43:33,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:33,876 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:43:33,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 10:43:33,877 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:33,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:33,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1045079933, now seen corresponding path program 1 times [2025-03-03 10:43:33,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:33,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786583521] [2025-03-03 10:43:33,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:33,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms