./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label59.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label59.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 9689a0609fceafc63efca466da3c77b2a75cad0dc813552287d39be336e7ab21 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 11:03:04,341 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:03:04,390 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 11:03:04,394 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:03:04,394 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:03:04,421 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:03:04,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:03:04,424 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:03:04,424 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:03:04,424 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:03:04,424 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:03:04,424 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:03:04,424 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:03:04,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:03:04,424 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:03:04,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:03:04,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:03:04,424 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:03:04,425 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 11:03:04,425 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:03:04,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:03:04,425 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:03:04,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:03:04,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:03:04,425 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:03:04,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:03:04,425 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:03:04,425 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:03:04,425 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:03:04,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:03:04,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:03:04,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:03:04,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:03:04,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:03:04,425 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:03:04,425 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:03:04,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:03:04,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 11:03:04,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 11:03:04,426 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:03:04,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:03:04,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:03:04,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:03:04,426 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 -> 9689a0609fceafc63efca466da3c77b2a75cad0dc813552287d39be336e7ab21 [2025-03-03 11:03:04,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:03:04,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:03:04,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:03:04,627 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:03:04,627 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:03:04,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label59.c [2025-03-03 11:03:05,708 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f49f51df/ee031dbdad524871a04ddc36e687950e/FLAGc0042a907 [2025-03-03 11:03:06,061 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:03:06,062 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label59.c [2025-03-03 11:03:06,082 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f49f51df/ee031dbdad524871a04ddc36e687950e/FLAGc0042a907 [2025-03-03 11:03:06,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f49f51df/ee031dbdad524871a04ddc36e687950e [2025-03-03 11:03:06,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:03:06,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:03:06,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:03:06,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:03:06,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:03:06,291 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:03:06" (1/1) ... [2025-03-03 11:03:06,292 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f3a095d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:06, skipping insertion in model container [2025-03-03 11:03:06,292 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:03:06" (1/1) ... [2025-03-03 11:03:06,355 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:03:06,506 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label59.c[4894,4907] [2025-03-03 11:03:06,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:03:06,822 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:03:06,837 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label59.c[4894,4907] [2025-03-03 11:03:07,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:03:07,024 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:03:07,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:07 WrapperNode [2025-03-03 11:03:07,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:03:07,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:03:07,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:03:07,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:03:07,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:07" (1/1) ... [2025-03-03 11:03:07,068 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:07" (1/1) ... [2025-03-03 11:03:07,256 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-03 11:03:07,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:03:07,257 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:03:07,258 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:03:07,258 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:03:07,264 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:07" (1/1) ... [2025-03-03 11:03:07,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:07" (1/1) ... [2025-03-03 11:03:07,295 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:07" (1/1) ... [2025-03-03 11:03:07,432 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 11:03:07,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:07" (1/1) ... [2025-03-03 11:03:07,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:07" (1/1) ... [2025-03-03 11:03:07,496 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:07" (1/1) ... [2025-03-03 11:03:07,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:07" (1/1) ... [2025-03-03 11:03:07,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:07" (1/1) ... [2025-03-03 11:03:07,544 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:07" (1/1) ... [2025-03-03 11:03:07,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:03:07,587 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:03:07,588 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:03:07,588 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:03:07,589 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:07" (1/1) ... [2025-03-03 11:03:07,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:03:07,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:03:07,617 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 11:03:07,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 11:03:07,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:03:07,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 11:03:07,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:03:07,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:03:07,690 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:03:07,692 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:03:10,112 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-03 11:03:10,208 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-03 11:03:10,208 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:03:10,233 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:03:10,236 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:03:10,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:03:10 BoogieIcfgContainer [2025-03-03 11:03:10,236 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:03:10,238 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:03:10,238 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:03:10,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:03:10,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:03:06" (1/3) ... [2025-03-03 11:03:10,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c868ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:03:10, skipping insertion in model container [2025-03-03 11:03:10,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:07" (2/3) ... [2025-03-03 11:03:10,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c868ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:03:10, skipping insertion in model container [2025-03-03 11:03:10,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:03:10" (3/3) ... [2025-03-03 11:03:10,243 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label59.c [2025-03-03 11:03:10,254 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:03:10,256 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label59.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 11:03:10,318 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:03:10,325 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;@1258b90b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:03:10,326 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 11:03:10,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:10,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 11:03:10,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:10,337 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:10,338 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:10,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:10,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1329171671, now seen corresponding path program 1 times [2025-03-03 11:03:10,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:10,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96199354] [2025-03-03 11:03:10,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:10,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:10,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-03 11:03:10,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 11:03:10,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:10,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:10,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:03:10,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:10,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96199354] [2025-03-03 11:03:10,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96199354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:10,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:10,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:03:10,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675260619] [2025-03-03 11:03:10,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:10,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:10,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:10,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:10,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:10,607 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:12,564 INFO L93 Difference]: Finished difference Result 1680 states and 3071 transitions. [2025-03-03 11:03:12,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:12,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2025-03-03 11:03:12,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:12,580 INFO L225 Difference]: With dead ends: 1680 [2025-03-03 11:03:12,580 INFO L226 Difference]: Without dead ends: 1011 [2025-03-03 11:03:12,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:12,586 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 549 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:12,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 220 Invalid, 1958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 11:03:12,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2025-03-03 11:03:12,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 996. [2025-03-03 11:03:12,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 995 states have (on average 1.735678391959799) internal successors, (1727), 995 states have internal predecessors, (1727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:12,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1727 transitions. [2025-03-03 11:03:12,664 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1727 transitions. Word has length 32 [2025-03-03 11:03:12,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:12,665 INFO L471 AbstractCegarLoop]: Abstraction has 996 states and 1727 transitions. [2025-03-03 11:03:12,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:12,665 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1727 transitions. [2025-03-03 11:03:12,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 11:03:12,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:12,667 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:12,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 11:03:12,667 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:12,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:12,668 INFO L85 PathProgramCache]: Analyzing trace with hash 263392702, now seen corresponding path program 1 times [2025-03-03 11:03:12,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:12,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309355302] [2025-03-03 11:03:12,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:12,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:12,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 11:03:12,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 11:03:12,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:12,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:12,881 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:03:12,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:12,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309355302] [2025-03-03 11:03:12,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309355302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:12,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:12,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:03:12,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160242959] [2025-03-03 11:03:12,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:12,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:12,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:12,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:12,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:12,885 INFO L87 Difference]: Start difference. First operand 996 states and 1727 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:14,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:14,522 INFO L93 Difference]: Finished difference Result 2848 states and 4983 transitions. [2025-03-03 11:03:14,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:14,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-03 11:03:14,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:14,529 INFO L225 Difference]: With dead ends: 2848 [2025-03-03 11:03:14,529 INFO L226 Difference]: Without dead ends: 1854 [2025-03-03 11:03:14,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:14,532 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 394 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:14,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 589 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 11:03:14,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2025-03-03 11:03:14,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1854. [2025-03-03 11:03:14,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1853 states have (on average 1.4020507285483002) internal successors, (2598), 1853 states have internal predecessors, (2598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:14,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2598 transitions. [2025-03-03 11:03:14,573 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2598 transitions. Word has length 97 [2025-03-03 11:03:14,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:14,573 INFO L471 AbstractCegarLoop]: Abstraction has 1854 states and 2598 transitions. [2025-03-03 11:03:14,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:14,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2598 transitions. [2025-03-03 11:03:14,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 11:03:14,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:14,577 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:14,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 11:03:14,577 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:14,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:14,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1222058751, now seen corresponding path program 1 times [2025-03-03 11:03:14,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:14,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105845477] [2025-03-03 11:03:14,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:14,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:14,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 11:03:14,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 11:03:14,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:14,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:14,768 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:03:14,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:14,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105845477] [2025-03-03 11:03:14,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105845477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:14,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:14,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:14,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268350532] [2025-03-03 11:03:14,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:14,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:14,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:14,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:14,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:14,770 INFO L87 Difference]: Start difference. First operand 1854 states and 2598 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:16,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:16,339 INFO L93 Difference]: Finished difference Result 5418 states and 7597 transitions. [2025-03-03 11:03:16,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:16,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2025-03-03 11:03:16,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:16,348 INFO L225 Difference]: With dead ends: 5418 [2025-03-03 11:03:16,348 INFO L226 Difference]: Without dead ends: 2713 [2025-03-03 11:03:16,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:16,352 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 475 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:16,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 874 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 11:03:16,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2025-03-03 11:03:16,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 2710. [2025-03-03 11:03:16,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2710 states, 2709 states have (on average 1.2694721299372462) internal successors, (3439), 2709 states have internal predecessors, (3439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:16,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3439 transitions. [2025-03-03 11:03:16,406 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3439 transitions. Word has length 102 [2025-03-03 11:03:16,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:16,406 INFO L471 AbstractCegarLoop]: Abstraction has 2710 states and 3439 transitions. [2025-03-03 11:03:16,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:16,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3439 transitions. [2025-03-03 11:03:16,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-03 11:03:16,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:16,409 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 11:03:16,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 11:03:16,409 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:16,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:16,410 INFO L85 PathProgramCache]: Analyzing trace with hash -617744196, now seen corresponding path program 1 times [2025-03-03 11:03:16,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:16,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388276018] [2025-03-03 11:03:16,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:16,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:16,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-03 11:03:16,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-03 11:03:16,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:16,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:03:16,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:16,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388276018] [2025-03-03 11:03:16,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388276018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:16,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:16,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:16,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088162594] [2025-03-03 11:03:16,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:16,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:16,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:16,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:16,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:16,647 INFO L87 Difference]: Start difference. First operand 2710 states and 3439 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:17,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:17,858 INFO L93 Difference]: Finished difference Result 7123 states and 9245 transitions. [2025-03-03 11:03:17,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:17,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2025-03-03 11:03:17,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:17,869 INFO L225 Difference]: With dead ends: 7123 [2025-03-03 11:03:17,869 INFO L226 Difference]: Without dead ends: 4415 [2025-03-03 11:03:17,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:17,875 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:17,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 786 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:03:17,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4415 states. [2025-03-03 11:03:17,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4415 to 4415. [2025-03-03 11:03:17,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4415 states, 4414 states have (on average 1.2417308563661078) internal successors, (5481), 4414 states have internal predecessors, (5481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:17,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4415 states to 4415 states and 5481 transitions. [2025-03-03 11:03:17,932 INFO L78 Accepts]: Start accepts. Automaton has 4415 states and 5481 transitions. Word has length 184 [2025-03-03 11:03:17,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:17,932 INFO L471 AbstractCegarLoop]: Abstraction has 4415 states and 5481 transitions. [2025-03-03 11:03:17,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:17,933 INFO L276 IsEmpty]: Start isEmpty. Operand 4415 states and 5481 transitions. [2025-03-03 11:03:17,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-03 11:03:17,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:17,938 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:17,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 11:03:17,938 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:17,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:17,939 INFO L85 PathProgramCache]: Analyzing trace with hash -280996977, now seen corresponding path program 1 times [2025-03-03 11:03:17,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:17,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702395328] [2025-03-03 11:03:17,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:17,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:17,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-03 11:03:17,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-03 11:03:17,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:17,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:18,124 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2025-03-03 11:03:18,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:18,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702395328] [2025-03-03 11:03:18,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702395328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:18,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:18,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:18,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175672535] [2025-03-03 11:03:18,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:18,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:18,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:18,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:18,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:18,127 INFO L87 Difference]: Start difference. First operand 4415 states and 5481 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:19,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:19,326 INFO L93 Difference]: Finished difference Result 12654 states and 15711 transitions. [2025-03-03 11:03:19,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:19,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 261 [2025-03-03 11:03:19,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:19,345 INFO L225 Difference]: With dead ends: 12654 [2025-03-03 11:03:19,345 INFO L226 Difference]: Without dead ends: 7391 [2025-03-03 11:03:19,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:19,352 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 416 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:19,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 876 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:03:19,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7391 states. [2025-03-03 11:03:19,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7391 to 7391. [2025-03-03 11:03:19,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7391 states, 7390 states have (on average 1.1667117726657645) internal successors, (8622), 7390 states have internal predecessors, (8622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:19,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7391 states to 7391 states and 8622 transitions. [2025-03-03 11:03:19,443 INFO L78 Accepts]: Start accepts. Automaton has 7391 states and 8622 transitions. Word has length 261 [2025-03-03 11:03:19,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:19,443 INFO L471 AbstractCegarLoop]: Abstraction has 7391 states and 8622 transitions. [2025-03-03 11:03:19,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:19,443 INFO L276 IsEmpty]: Start isEmpty. Operand 7391 states and 8622 transitions. [2025-03-03 11:03:19,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-03 11:03:19,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:19,446 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:19,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 11:03:19,446 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:19,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:19,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1130725699, now seen corresponding path program 1 times [2025-03-03 11:03:19,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:19,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82308817] [2025-03-03 11:03:19,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:19,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:19,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-03 11:03:19,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-03 11:03:19,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:19,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:19,626 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-03-03 11:03:19,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:19,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82308817] [2025-03-03 11:03:19,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82308817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:19,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:19,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:19,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935212544] [2025-03-03 11:03:19,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:19,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:19,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:19,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:19,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:19,627 INFO L87 Difference]: Start difference. First operand 7391 states and 8622 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:21,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:21,033 INFO L93 Difference]: Finished difference Result 18609 states and 21941 transitions. [2025-03-03 11:03:21,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:21,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 278 [2025-03-03 11:03:21,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:21,058 INFO L225 Difference]: With dead ends: 18609 [2025-03-03 11:03:21,058 INFO L226 Difference]: Without dead ends: 10346 [2025-03-03 11:03:21,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:21,066 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 483 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:21,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 736 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 11:03:21,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10346 states. [2025-03-03 11:03:21,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10346 to 10344. [2025-03-03 11:03:21,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10344 states, 10343 states have (on average 1.1618485932514744) internal successors, (12017), 10343 states have internal predecessors, (12017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:21,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10344 states to 10344 states and 12017 transitions. [2025-03-03 11:03:21,192 INFO L78 Accepts]: Start accepts. Automaton has 10344 states and 12017 transitions. Word has length 278 [2025-03-03 11:03:21,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:21,192 INFO L471 AbstractCegarLoop]: Abstraction has 10344 states and 12017 transitions. [2025-03-03 11:03:21,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:21,193 INFO L276 IsEmpty]: Start isEmpty. Operand 10344 states and 12017 transitions. [2025-03-03 11:03:21,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-03-03 11:03:21,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:21,199 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:21,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 11:03:21,199 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:21,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:21,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1059777436, now seen corresponding path program 1 times [2025-03-03 11:03:21,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:21,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636947515] [2025-03-03 11:03:21,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:21,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:21,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-03 11:03:21,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-03 11:03:21,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:21,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:21,549 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:03:21,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:21,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636947515] [2025-03-03 11:03:21,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636947515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:21,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:21,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:21,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15320350] [2025-03-03 11:03:21,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:21,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:03:21,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:21,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:03:21,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:03:21,552 INFO L87 Difference]: Start difference. First operand 10344 states and 12017 transitions. Second operand has 4 states, 4 states have (on average 92.75) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:23,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:23,362 INFO L93 Difference]: Finished difference Result 24553 states and 28510 transitions. [2025-03-03 11:03:23,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:03:23,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.75) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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 371 [2025-03-03 11:03:23,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:23,388 INFO L225 Difference]: With dead ends: 24553 [2025-03-03 11:03:23,388 INFO L226 Difference]: Without dead ends: 13786 [2025-03-03 11:03:23,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:03:23,399 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 611 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 2353 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 2591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 2353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:23,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 259 Invalid, 2591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 2353 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 11:03:23,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13786 states. [2025-03-03 11:03:23,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13786 to 13781. [2025-03-03 11:03:23,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13781 states, 13780 states have (on average 1.165312046444122) internal successors, (16058), 13780 states have internal predecessors, (16058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:23,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13781 states to 13781 states and 16058 transitions. [2025-03-03 11:03:23,558 INFO L78 Accepts]: Start accepts. Automaton has 13781 states and 16058 transitions. Word has length 371 [2025-03-03 11:03:23,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:23,558 INFO L471 AbstractCegarLoop]: Abstraction has 13781 states and 16058 transitions. [2025-03-03 11:03:23,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.75) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:23,559 INFO L276 IsEmpty]: Start isEmpty. Operand 13781 states and 16058 transitions. [2025-03-03 11:03:23,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2025-03-03 11:03:23,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:23,568 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:23,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 11:03:23,569 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:23,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:23,569 INFO L85 PathProgramCache]: Analyzing trace with hash -865507624, now seen corresponding path program 1 times [2025-03-03 11:03:23,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:23,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004535724] [2025-03-03 11:03:23,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:23,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:23,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 399 statements into 1 equivalence classes. [2025-03-03 11:03:23,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 399 of 399 statements. [2025-03-03 11:03:23,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:23,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:24,038 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 59 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:03:24,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:24,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004535724] [2025-03-03 11:03:24,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004535724] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:03:24,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211153570] [2025-03-03 11:03:24,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:24,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:03:24,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:03:24,041 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:03:24,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 11:03:24,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 399 statements into 1 equivalence classes. [2025-03-03 11:03:24,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 399 of 399 statements. [2025-03-03 11:03:24,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:24,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:24,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 11:03:24,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:03:24,551 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 59 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:03:24,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:03:24,938 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:03:24,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211153570] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 11:03:24,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 11:03:24,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-03 11:03:24,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694809830] [2025-03-03 11:03:24,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:24,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:03:24,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:24,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:03:24,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:03:24,942 INFO L87 Difference]: Start difference. First operand 13781 states and 16058 transitions. Second operand has 4 states, 4 states have (on average 99.75) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:27,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:27,044 INFO L93 Difference]: Finished difference Result 33090 states and 38283 transitions. [2025-03-03 11:03:27,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:03:27,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 99.75) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 399 [2025-03-03 11:03:27,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:27,071 INFO L225 Difference]: With dead ends: 33090 [2025-03-03 11:03:27,072 INFO L226 Difference]: Without dead ends: 18034 [2025-03-03 11:03:27,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 795 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:03:27,081 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 759 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 2205 mSolverCounterSat, 813 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 3018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 813 IncrementalHoareTripleChecker+Valid, 2205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:27,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 136 Invalid, 3018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [813 Valid, 2205 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 11:03:27,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18034 states. [2025-03-03 11:03:27,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18034 to 14204. [2025-03-03 11:03:27,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14204 states, 14203 states have (on average 1.160529465605858) internal successors, (16483), 14203 states have internal predecessors, (16483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:27,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14204 states to 14204 states and 16483 transitions. [2025-03-03 11:03:27,211 INFO L78 Accepts]: Start accepts. Automaton has 14204 states and 16483 transitions. Word has length 399 [2025-03-03 11:03:27,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:27,212 INFO L471 AbstractCegarLoop]: Abstraction has 14204 states and 16483 transitions. [2025-03-03 11:03:27,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.75) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:27,212 INFO L276 IsEmpty]: Start isEmpty. Operand 14204 states and 16483 transitions. [2025-03-03 11:03:27,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-03 11:03:27,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:27,221 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:27,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 11:03:27,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:03:27,422 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:27,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:27,423 INFO L85 PathProgramCache]: Analyzing trace with hash 977937782, now seen corresponding path program 1 times [2025-03-03 11:03:27,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:27,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702095730] [2025-03-03 11:03:27,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:27,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:27,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-03 11:03:27,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-03 11:03:27,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:27,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 89 proven. 229 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:03:27,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:27,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702095730] [2025-03-03 11:03:27,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702095730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:03:27,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610572090] [2025-03-03 11:03:27,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:27,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:03:27,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:03:27,959 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:03:27,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 11:03:28,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-03 11:03:28,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-03 11:03:28,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:28,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:28,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 11:03:28,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:03:28,275 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 215 proven. 73 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 11:03:28,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:03:28,466 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 11:03:28,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610572090] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 11:03:28,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 11:03:28,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 6 [2025-03-03 11:03:28,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490735303] [2025-03-03 11:03:28,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:28,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:03:28,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:28,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:03:28,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:03:28,468 INFO L87 Difference]: Start difference. First operand 14204 states and 16483 transitions. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:30,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:30,414 INFO L93 Difference]: Finished difference Result 35671 states and 41487 transitions. [2025-03-03 11:03:30,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:03:30,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 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 473 [2025-03-03 11:03:30,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:30,440 INFO L225 Difference]: With dead ends: 35671 [2025-03-03 11:03:30,440 INFO L226 Difference]: Without dead ends: 21894 [2025-03-03 11:03:30,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 943 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:03:30,456 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 884 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 2232 mSolverCounterSat, 535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 2767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 535 IncrementalHoareTripleChecker+Valid, 2232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:30,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 167 Invalid, 2767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [535 Valid, 2232 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 11:03:30,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21894 states. [2025-03-03 11:03:30,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21894 to 20187. [2025-03-03 11:03:30,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20187 states, 20186 states have (on average 1.164519964331715) internal successors, (23507), 20186 states have internal predecessors, (23507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:30,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20187 states to 20187 states and 23507 transitions. [2025-03-03 11:03:30,701 INFO L78 Accepts]: Start accepts. Automaton has 20187 states and 23507 transitions. Word has length 473 [2025-03-03 11:03:30,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:30,702 INFO L471 AbstractCegarLoop]: Abstraction has 20187 states and 23507 transitions. [2025-03-03 11:03:30,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:30,702 INFO L276 IsEmpty]: Start isEmpty. Operand 20187 states and 23507 transitions. [2025-03-03 11:03:30,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-03-03 11:03:30,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:30,715 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:30,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 11:03:30,920 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,SelfDestructingSolverStorable8 [2025-03-03 11:03:30,920 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:30,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:30,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1172967376, now seen corresponding path program 1 times [2025-03-03 11:03:30,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:30,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170999004] [2025-03-03 11:03:30,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:30,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:30,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-03 11:03:30,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-03 11:03:30,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:30,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:31,092 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2025-03-03 11:03:31,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:31,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170999004] [2025-03-03 11:03:31,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170999004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:31,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:31,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:31,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598245860] [2025-03-03 11:03:31,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:31,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:31,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:31,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:31,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:31,095 INFO L87 Difference]: Start difference. First operand 20187 states and 23507 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:32,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:32,254 INFO L93 Difference]: Finished difference Result 47604 states and 55424 transitions. [2025-03-03 11:03:32,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:32,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 529 [2025-03-03 11:03:32,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:32,280 INFO L225 Difference]: With dead ends: 47604 [2025-03-03 11:03:32,280 INFO L226 Difference]: Without dead ends: 25284 [2025-03-03 11:03:32,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:32,297 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 492 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:32,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 718 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 11:03:32,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25284 states. [2025-03-03 11:03:32,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25284 to 25278. [2025-03-03 11:03:32,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25278 states, 25277 states have (on average 1.140799936701349) internal successors, (28836), 25277 states have internal predecessors, (28836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:32,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25278 states to 25278 states and 28836 transitions. [2025-03-03 11:03:32,706 INFO L78 Accepts]: Start accepts. Automaton has 25278 states and 28836 transitions. Word has length 529 [2025-03-03 11:03:32,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:32,708 INFO L471 AbstractCegarLoop]: Abstraction has 25278 states and 28836 transitions. [2025-03-03 11:03:32,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:32,708 INFO L276 IsEmpty]: Start isEmpty. Operand 25278 states and 28836 transitions. [2025-03-03 11:03:32,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-03-03 11:03:32,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:32,719 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:32,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 11:03:32,720 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:32,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:32,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1817586375, now seen corresponding path program 1 times [2025-03-03 11:03:32,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:32,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487125886] [2025-03-03 11:03:32,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:32,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:32,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-03-03 11:03:32,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-03-03 11:03:32,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:32,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:33,013 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 515 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-03 11:03:33,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:33,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487125886] [2025-03-03 11:03:33,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487125886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:33,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:33,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:33,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072978779] [2025-03-03 11:03:33,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:33,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:33,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:33,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:33,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:33,015 INFO L87 Difference]: Start difference. First operand 25278 states and 28836 transitions. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:34,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:34,303 INFO L93 Difference]: Finished difference Result 59509 states and 68275 transitions. [2025-03-03 11:03:34,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:34,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 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 579 [2025-03-03 11:03:34,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:34,336 INFO L225 Difference]: With dead ends: 59509 [2025-03-03 11:03:34,336 INFO L226 Difference]: Without dead ends: 32101 [2025-03-03 11:03:34,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 11:03:34,355 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 426 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:34,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 641 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:03:34,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32101 states. [2025-03-03 11:03:34,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32101 to 32097. [2025-03-03 11:03:34,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32097 states, 32096 states have (on average 1.1451271186440677) internal successors, (36754), 32096 states have internal predecessors, (36754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:34,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32097 states to 32097 states and 36754 transitions. [2025-03-03 11:03:34,712 INFO L78 Accepts]: Start accepts. Automaton has 32097 states and 36754 transitions. Word has length 579 [2025-03-03 11:03:34,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:34,712 INFO L471 AbstractCegarLoop]: Abstraction has 32097 states and 36754 transitions. [2025-03-03 11:03:34,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:34,713 INFO L276 IsEmpty]: Start isEmpty. Operand 32097 states and 36754 transitions. [2025-03-03 11:03:34,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2025-03-03 11:03:34,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:34,729 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:34,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 11:03:34,730 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:34,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:34,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1634364397, now seen corresponding path program 1 times [2025-03-03 11:03:34,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:34,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242926794] [2025-03-03 11:03:34,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:34,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:34,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-03-03 11:03:34,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-03-03 11:03:34,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:34,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:34,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1079 backedges. 544 proven. 0 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2025-03-03 11:03:34,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:34,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242926794] [2025-03-03 11:03:34,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242926794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:34,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:34,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:34,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258852771] [2025-03-03 11:03:34,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:34,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:34,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:34,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:34,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:34,945 INFO L87 Difference]: Start difference. First operand 32097 states and 36754 transitions. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:36,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:36,419 INFO L93 Difference]: Finished difference Result 77826 states and 89364 transitions. [2025-03-03 11:03:36,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:36,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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 658 [2025-03-03 11:03:36,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:36,470 INFO L225 Difference]: With dead ends: 77826 [2025-03-03 11:03:36,470 INFO L226 Difference]: Without dead ends: 46156 [2025-03-03 11:03:36,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:36,500 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 487 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 1429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:36,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 292 Invalid, 1429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 11:03:36,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46156 states. [2025-03-03 11:03:36,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46156 to 46134. [2025-03-03 11:03:37,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46134 states, 46133 states have (on average 1.1360197689289662) internal successors, (52408), 46133 states have internal predecessors, (52408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:37,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46134 states to 46134 states and 52408 transitions. [2025-03-03 11:03:37,066 INFO L78 Accepts]: Start accepts. Automaton has 46134 states and 52408 transitions. Word has length 658 [2025-03-03 11:03:37,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:37,066 INFO L471 AbstractCegarLoop]: Abstraction has 46134 states and 52408 transitions. [2025-03-03 11:03:37,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:37,067 INFO L276 IsEmpty]: Start isEmpty. Operand 46134 states and 52408 transitions. [2025-03-03 11:03:37,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 716 [2025-03-03 11:03:37,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:37,088 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:37,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 11:03:37,089 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:37,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:37,089 INFO L85 PathProgramCache]: Analyzing trace with hash -536435880, now seen corresponding path program 1 times [2025-03-03 11:03:37,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:37,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394326824] [2025-03-03 11:03:37,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:37,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:37,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 715 statements into 1 equivalence classes. [2025-03-03 11:03:37,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 715 of 715 statements. [2025-03-03 11:03:37,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:37,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:37,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1048 backedges. 816 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-03-03 11:03:37,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:37,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394326824] [2025-03-03 11:03:37,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394326824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:37,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:37,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:37,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824804684] [2025-03-03 11:03:37,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:37,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:37,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:37,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:37,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:37,493 INFO L87 Difference]: Start difference. First operand 46134 states and 52408 transitions. Second operand has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:38,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:38,777 INFO L93 Difference]: Finished difference Result 110990 states and 125961 transitions. [2025-03-03 11:03:38,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:38,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 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 715 [2025-03-03 11:03:38,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:38,845 INFO L225 Difference]: With dead ends: 110990 [2025-03-03 11:03:38,845 INFO L226 Difference]: Without dead ends: 65283 [2025-03-03 11:03:38,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:38,877 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 392 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:38,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 262 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 11:03:38,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65283 states. [2025-03-03 11:03:39,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65283 to 62722. [2025-03-03 11:03:39,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62722 states, 62721 states have (on average 1.121617958897339) internal successors, (70349), 62721 states have internal predecessors, (70349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:39,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62722 states to 62722 states and 70349 transitions. [2025-03-03 11:03:39,620 INFO L78 Accepts]: Start accepts. Automaton has 62722 states and 70349 transitions. Word has length 715 [2025-03-03 11:03:39,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:39,620 INFO L471 AbstractCegarLoop]: Abstraction has 62722 states and 70349 transitions. [2025-03-03 11:03:39,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:39,621 INFO L276 IsEmpty]: Start isEmpty. Operand 62722 states and 70349 transitions. [2025-03-03 11:03:39,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 738 [2025-03-03 11:03:39,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:39,643 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:39,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 11:03:39,644 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:39,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:39,644 INFO L85 PathProgramCache]: Analyzing trace with hash 415251109, now seen corresponding path program 1 times [2025-03-03 11:03:39,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:39,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370703217] [2025-03-03 11:03:39,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:39,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:39,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 737 statements into 1 equivalence classes. [2025-03-03 11:03:39,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 737 of 737 statements. [2025-03-03 11:03:39,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:39,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:40,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1075 backedges. 925 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-03-03 11:03:40,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:40,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370703217] [2025-03-03 11:03:40,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370703217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:40,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:40,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:03:40,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035446882] [2025-03-03 11:03:40,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:40,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:03:40,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:40,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:03:40,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:03:40,173 INFO L87 Difference]: Start difference. First operand 62722 states and 70349 transitions. Second operand has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:42,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:42,126 INFO L93 Difference]: Finished difference Result 155695 states and 174288 transitions. [2025-03-03 11:03:42,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:03:42,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 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 737 [2025-03-03 11:03:42,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:42,221 INFO L225 Difference]: With dead ends: 155695 [2025-03-03 11:03:42,221 INFO L226 Difference]: Without dead ends: 93400 [2025-03-03 11:03:42,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:03:42,269 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 774 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2286 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 2673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 2286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:42,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 183 Invalid, 2673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 2286 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 11:03:42,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93400 states. [2025-03-03 11:03:43,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93400 to 91691. [2025-03-03 11:03:43,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91691 states, 91690 states have (on average 1.1132075471698113) internal successors, (102070), 91690 states have internal predecessors, (102070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91691 states to 91691 states and 102070 transitions. [2025-03-03 11:03:43,572 INFO L78 Accepts]: Start accepts. Automaton has 91691 states and 102070 transitions. Word has length 737 [2025-03-03 11:03:43,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:43,572 INFO L471 AbstractCegarLoop]: Abstraction has 91691 states and 102070 transitions. [2025-03-03 11:03:43,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:43,573 INFO L276 IsEmpty]: Start isEmpty. Operand 91691 states and 102070 transitions. [2025-03-03 11:03:43,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 809 [2025-03-03 11:03:43,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:43,606 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:43,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 11:03:43,607 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:43,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:43,607 INFO L85 PathProgramCache]: Analyzing trace with hash -388965379, now seen corresponding path program 1 times [2025-03-03 11:03:43,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:43,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918088347] [2025-03-03 11:03:43,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:43,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:43,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 808 statements into 1 equivalence classes. [2025-03-03 11:03:43,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 808 of 808 statements. [2025-03-03 11:03:43,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:43,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:44,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1159 backedges. 847 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 11:03:44,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:44,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918088347] [2025-03-03 11:03:44,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918088347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:44,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:44,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:03:44,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194446494] [2025-03-03 11:03:44,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:44,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:03:44,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:44,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:03:44,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:03:44,288 INFO L87 Difference]: Start difference. First operand 91691 states and 102070 transitions. Second operand has 4 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:46,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:46,411 INFO L93 Difference]: Finished difference Result 192731 states and 213926 transitions. [2025-03-03 11:03:46,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:03:46,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 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 808 [2025-03-03 11:03:46,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:46,522 INFO L225 Difference]: With dead ends: 192731 [2025-03-03 11:03:46,522 INFO L226 Difference]: Without dead ends: 101465 [2025-03-03 11:03:46,575 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 11:03:46,576 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 623 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 2796 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 3147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 2796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:46,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 367 Invalid, 3147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 2796 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 11:03:46,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101465 states. [2025-03-03 11:03:47,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101465 to 94654. [2025-03-03 11:03:47,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94654 states, 94653 states have (on average 1.097619726791544) internal successors, (103893), 94653 states have internal predecessors, (103893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:47,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94654 states to 94654 states and 103893 transitions. [2025-03-03 11:03:47,847 INFO L78 Accepts]: Start accepts. Automaton has 94654 states and 103893 transitions. Word has length 808 [2025-03-03 11:03:47,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:47,847 INFO L471 AbstractCegarLoop]: Abstraction has 94654 states and 103893 transitions. [2025-03-03 11:03:47,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:47,847 INFO L276 IsEmpty]: Start isEmpty. Operand 94654 states and 103893 transitions. [2025-03-03 11:03:47,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 810 [2025-03-03 11:03:47,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:47,891 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:47,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 11:03:47,891 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:47,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:47,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1928015423, now seen corresponding path program 1 times [2025-03-03 11:03:47,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:47,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713823429] [2025-03-03 11:03:47,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:47,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:47,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 809 statements into 1 equivalence classes. [2025-03-03 11:03:47,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 809 of 809 statements. [2025-03-03 11:03:47,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:47,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:48,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1189 backedges. 728 proven. 0 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2025-03-03 11:03:48,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:48,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713823429] [2025-03-03 11:03:48,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713823429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:48,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:48,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:48,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650836570] [2025-03-03 11:03:48,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:48,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:48,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:48,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:48,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:48,337 INFO L87 Difference]: Start difference. First operand 94654 states and 103893 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 11:03:49,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:49,771 INFO L93 Difference]: Finished difference Result 194829 states and 213548 transitions. [2025-03-03 11:03:49,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:49,772 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 809 [2025-03-03 11:03:49,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:49,870 INFO L225 Difference]: With dead ends: 194829 [2025-03-03 11:03:49,870 INFO L226 Difference]: Without dead ends: 100602 [2025-03-03 11:03:49,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:49,905 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 505 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:49,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 208 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:03:49,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100602 states. [2025-03-03 11:03:50,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100602 to 95492. [2025-03-03 11:03:50,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95492 states, 95491 states have (on average 1.0874846844205213) internal successors, (103845), 95491 states have internal predecessors, (103845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:50,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95492 states to 95492 states and 103845 transitions. [2025-03-03 11:03:50,846 INFO L78 Accepts]: Start accepts. Automaton has 95492 states and 103845 transitions. Word has length 809 [2025-03-03 11:03:50,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:50,847 INFO L471 AbstractCegarLoop]: Abstraction has 95492 states and 103845 transitions. [2025-03-03 11:03:50,847 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 11:03:50,847 INFO L276 IsEmpty]: Start isEmpty. Operand 95492 states and 103845 transitions. [2025-03-03 11:03:50,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 829 [2025-03-03 11:03:50,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:50,878 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:50,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 11:03:50,878 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:50,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:50,878 INFO L85 PathProgramCache]: Analyzing trace with hash 960336200, now seen corresponding path program 1 times [2025-03-03 11:03:50,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:50,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824550961] [2025-03-03 11:03:50,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:50,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:50,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 828 statements into 1 equivalence classes. [2025-03-03 11:03:51,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 828 of 828 statements. [2025-03-03 11:03:51,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:51,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:51,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1138 backedges. 909 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-03-03 11:03:51,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:51,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824550961] [2025-03-03 11:03:51,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824550961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:51,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:51,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:03:51,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748032743] [2025-03-03 11:03:51,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:51,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:03:51,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:51,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:03:51,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:03:51,663 INFO L87 Difference]: Start difference. First operand 95492 states and 103845 transitions. Second operand has 4 states, 4 states have (on average 168.5) internal successors, (674), 4 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:53,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:53,785 INFO L93 Difference]: Finished difference Result 222501 states and 241466 transitions. [2025-03-03 11:03:53,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:03:53,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 168.5) internal successors, (674), 4 states have internal predecessors, (674), 0 states have call successors, (0), 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 828 [2025-03-03 11:03:53,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:53,924 INFO L225 Difference]: With dead ends: 222501 [2025-03-03 11:03:53,924 INFO L226 Difference]: Without dead ends: 127011 [2025-03-03 11:03:53,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:03:53,992 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 469 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 2325 mSolverCounterSat, 371 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 2696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 371 IncrementalHoareTripleChecker+Valid, 2325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:53,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 202 Invalid, 2696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [371 Valid, 2325 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 11:03:54,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127011 states. [2025-03-03 11:03:55,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127011 to 119780. [2025-03-03 11:03:55,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119780 states, 119779 states have (on average 1.0811744963641372) internal successors, (129502), 119779 states have internal predecessors, (129502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:55,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119780 states to 119780 states and 129502 transitions. [2025-03-03 11:03:55,367 INFO L78 Accepts]: Start accepts. Automaton has 119780 states and 129502 transitions. Word has length 828 [2025-03-03 11:03:55,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:55,368 INFO L471 AbstractCegarLoop]: Abstraction has 119780 states and 129502 transitions. [2025-03-03 11:03:55,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 168.5) internal successors, (674), 4 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:55,368 INFO L276 IsEmpty]: Start isEmpty. Operand 119780 states and 129502 transitions. [2025-03-03 11:03:55,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 834 [2025-03-03 11:03:55,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:55,406 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:55,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 11:03:55,406 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:55,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:55,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1919232176, now seen corresponding path program 1 times [2025-03-03 11:03:55,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:55,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613055894] [2025-03-03 11:03:55,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:55,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:55,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 833 statements into 1 equivalence classes. [2025-03-03 11:03:55,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 833 of 833 statements. [2025-03-03 11:03:55,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:55,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:56,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1158 backedges. 919 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-03-03 11:03:56,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:56,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613055894] [2025-03-03 11:03:56,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613055894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:56,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:56,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:03:56,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762662436] [2025-03-03 11:03:56,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:56,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:03:56,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:56,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:03:56,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:03:56,091 INFO L87 Difference]: Start difference. First operand 119780 states and 129502 transitions. Second operand has 4 states, 4 states have (on average 168.5) internal successors, (674), 4 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:58,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:58,473 INFO L93 Difference]: Finished difference Result 265958 states and 287224 transitions. [2025-03-03 11:03:58,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:03:58,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 168.5) internal successors, (674), 4 states have internal predecessors, (674), 0 states have call successors, (0), 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 833 [2025-03-03 11:03:58,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:58,636 INFO L225 Difference]: With dead ends: 265958 [2025-03-03 11:03:58,636 INFO L226 Difference]: Without dead ends: 146180 [2025-03-03 11:03:58,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:03:58,709 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 470 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 2217 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 2637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 2217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:58,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 189 Invalid, 2637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 2217 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 11:03:58,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146180 states. [2025-03-03 11:04:00,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146180 to 120630. [2025-03-03 11:04:00,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120630 states, 120629 states have (on average 1.0815226852581055) internal successors, (130463), 120629 states have internal predecessors, (130463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:00,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120630 states to 120630 states and 130463 transitions. [2025-03-03 11:04:00,565 INFO L78 Accepts]: Start accepts. Automaton has 120630 states and 130463 transitions. Word has length 833 [2025-03-03 11:04:00,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:04:00,565 INFO L471 AbstractCegarLoop]: Abstraction has 120630 states and 130463 transitions. [2025-03-03 11:04:00,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 168.5) internal successors, (674), 4 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:00,566 INFO L276 IsEmpty]: Start isEmpty. Operand 120630 states and 130463 transitions. [2025-03-03 11:04:00,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2025-03-03 11:04:00,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:04:00,602 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:04:00,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 11:04:00,602 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:04:00,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:04:00,602 INFO L85 PathProgramCache]: Analyzing trace with hash 660529050, now seen corresponding path program 1 times [2025-03-03 11:04:00,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:04:00,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077686990] [2025-03-03 11:04:00,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:04:00,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:04:00,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 842 statements into 1 equivalence classes. [2025-03-03 11:04:00,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 842 of 842 statements. [2025-03-03 11:04:00,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:04:00,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:04:00,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1525 backedges. 1146 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2025-03-03 11:04:00,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:04:00,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077686990] [2025-03-03 11:04:00,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077686990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:04:00,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:04:00,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:04:00,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081960288] [2025-03-03 11:04:00,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:04:00,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:04:00,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:04:00,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:04:00,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:04:00,902 INFO L87 Difference]: Start difference. First operand 120630 states and 130463 transitions. Second operand has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:02,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:04:02,256 INFO L93 Difference]: Finished difference Result 257498 states and 278201 transitions. [2025-03-03 11:04:02,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:04:02,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 842 [2025-03-03 11:04:02,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:04:02,399 INFO L225 Difference]: With dead ends: 257498 [2025-03-03 11:04:02,399 INFO L226 Difference]: Without dead ends: 137295 [2025-03-03 11:04:02,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:04:02,475 INFO L435 NwaCegarLoop]: 707 mSDtfsCounter, 327 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 11:04:02,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 766 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 11:04:02,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137295 states. [2025-03-03 11:04:03,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137295 to 133025. [2025-03-03 11:04:04,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133025 states, 133024 states have (on average 1.0769635554486408) internal successors, (143262), 133024 states have internal predecessors, (143262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:04,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133025 states to 133025 states and 143262 transitions. [2025-03-03 11:04:04,146 INFO L78 Accepts]: Start accepts. Automaton has 133025 states and 143262 transitions. Word has length 842 [2025-03-03 11:04:04,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:04:04,146 INFO L471 AbstractCegarLoop]: Abstraction has 133025 states and 143262 transitions. [2025-03-03 11:04:04,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:04,146 INFO L276 IsEmpty]: Start isEmpty. Operand 133025 states and 143262 transitions. [2025-03-03 11:04:04,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 908 [2025-03-03 11:04:04,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:04:04,191 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:04:04,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 11:04:04,191 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:04:04,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:04:04,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1840801970, now seen corresponding path program 1 times [2025-03-03 11:04:04,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:04:04,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126476994] [2025-03-03 11:04:04,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:04:04,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:04:04,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 907 statements into 1 equivalence classes. [2025-03-03 11:04:04,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 907 of 907 statements. [2025-03-03 11:04:04,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:04:04,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:04:04,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1636 backedges. 1086 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-03-03 11:04:04,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:04:04,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126476994] [2025-03-03 11:04:04,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126476994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:04:04,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:04:04,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 11:04:04,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965886451] [2025-03-03 11:04:04,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:04:04,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 11:04:04,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:04:04,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 11:04:04,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:04:04,776 INFO L87 Difference]: Start difference. First operand 133025 states and 143262 transitions. Second operand has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:07,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:04:07,503 INFO L93 Difference]: Finished difference Result 303956 states and 327051 transitions. [2025-03-03 11:04:07,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 11:04:07,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 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 907 [2025-03-03 11:04:07,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:04:07,682 INFO L225 Difference]: With dead ends: 303956 [2025-03-03 11:04:07,682 INFO L226 Difference]: Without dead ends: 171358 [2025-03-03 11:04:07,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:04:07,764 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 1069 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 3668 mSolverCounterSat, 480 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 4148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 480 IncrementalHoareTripleChecker+Valid, 3668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:04:07,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 237 Invalid, 4148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [480 Valid, 3668 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 11:04:07,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171358 states. [2025-03-03 11:04:09,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171358 to 157304. [2025-03-03 11:04:09,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157304 states, 157303 states have (on average 1.0711938106711252) internal successors, (168502), 157303 states have internal predecessors, (168502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:09,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157304 states to 157304 states and 168502 transitions. [2025-03-03 11:04:09,779 INFO L78 Accepts]: Start accepts. Automaton has 157304 states and 168502 transitions. Word has length 907 [2025-03-03 11:04:09,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:04:09,780 INFO L471 AbstractCegarLoop]: Abstraction has 157304 states and 168502 transitions. [2025-03-03 11:04:09,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:09,780 INFO L276 IsEmpty]: Start isEmpty. Operand 157304 states and 168502 transitions. [2025-03-03 11:04:09,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 908 [2025-03-03 11:04:09,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:04:09,849 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:04:09,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 11:04:09,849 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:04:09,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:04:09,850 INFO L85 PathProgramCache]: Analyzing trace with hash 763700817, now seen corresponding path program 1 times [2025-03-03 11:04:09,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:04:09,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573689404] [2025-03-03 11:04:09,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:04:09,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:04:09,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 907 statements into 1 equivalence classes. [2025-03-03 11:04:10,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 907 of 907 statements. [2025-03-03 11:04:10,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:04:10,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:04:10,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1636 backedges. 1086 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-03-03 11:04:10,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:04:10,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573689404] [2025-03-03 11:04:10,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573689404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:04:10,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:04:10,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 11:04:10,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714727952] [2025-03-03 11:04:10,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:04:10,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 11:04:10,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:04:10,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 11:04:10,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:04:10,562 INFO L87 Difference]: Start difference. First operand 157304 states and 168502 transitions. Second operand has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:13,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:04:13,438 INFO L93 Difference]: Finished difference Result 367013 states and 393518 transitions. [2025-03-03 11:04:13,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 11:04:13,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 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 907 [2025-03-03 11:04:13,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:04:13,668 INFO L225 Difference]: With dead ends: 367013 [2025-03-03 11:04:13,669 INFO L226 Difference]: Without dead ends: 209711 [2025-03-03 11:04:13,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:04:13,771 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 1103 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 3173 mSolverCounterSat, 604 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 3777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 604 IncrementalHoareTripleChecker+Valid, 3173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:04:13,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 193 Invalid, 3777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [604 Valid, 3173 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 11:04:13,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209711 states. [2025-03-03 11:04:15,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209711 to 167529. [2025-03-03 11:04:15,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167529 states, 167528 states have (on average 1.0703524187001576) internal successors, (179314), 167528 states have internal predecessors, (179314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167529 states to 167529 states and 179314 transitions. [2025-03-03 11:04:16,078 INFO L78 Accepts]: Start accepts. Automaton has 167529 states and 179314 transitions. Word has length 907 [2025-03-03 11:04:16,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:04:16,079 INFO L471 AbstractCegarLoop]: Abstraction has 167529 states and 179314 transitions. [2025-03-03 11:04:16,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:16,079 INFO L276 IsEmpty]: Start isEmpty. Operand 167529 states and 179314 transitions. [2025-03-03 11:04:16,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 939 [2025-03-03 11:04:16,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:04:16,151 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:04:16,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 11:04:16,151 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:04:16,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:04:16,152 INFO L85 PathProgramCache]: Analyzing trace with hash -215232457, now seen corresponding path program 1 times [2025-03-03 11:04:16,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:04:16,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825823234] [2025-03-03 11:04:16,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:04:16,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:04:16,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 938 statements into 1 equivalence classes. [2025-03-03 11:04:16,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 938 of 938 statements. [2025-03-03 11:04:16,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:04:16,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat