./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label37.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/Problem12_label37.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 216d354bd2b39cc08159a7e1d05b12b6bb34b7a88f8458e31e862be3f2691415 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:37:38,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:37:38,761 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:37:38,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:37:38,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:37:38,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:37:38,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:37:38,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:37:38,790 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:37:38,790 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:37:38,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:37:38,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:37:38,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:37:38,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:37:38,790 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:37:38,790 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:37:38,790 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:37:38,791 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:37:38,791 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:37:38,791 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:37:38,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:37:38,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:37:38,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:37:38,791 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:37:38,791 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:37:38,791 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:37:38,791 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:37:38,791 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:37:38,791 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:37:38,791 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:37:38,791 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:37:38,791 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:37:38,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:37:38,793 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:37:38,794 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:37:38,794 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:37:38,794 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:37:38,794 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:37:38,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:37:38,794 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:37:38,794 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:37:38,794 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:37:38,794 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:37:38,794 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 -> 216d354bd2b39cc08159a7e1d05b12b6bb34b7a88f8458e31e862be3f2691415 [2025-03-03 10:37:39,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:37:39,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:37:39,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:37:39,044 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:37:39,044 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:37:39,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label37.c [2025-03-03 10:37:40,182 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86c77221d/5bf956b85e8f4cfe8096d3f3c9d4107a/FLAGe1e307449 [2025-03-03 10:37:40,628 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:37:40,629 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label37.c [2025-03-03 10:37:40,658 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86c77221d/5bf956b85e8f4cfe8096d3f3c9d4107a/FLAGe1e307449 [2025-03-03 10:37:40,753 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86c77221d/5bf956b85e8f4cfe8096d3f3c9d4107a [2025-03-03 10:37:40,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:37:40,757 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:37:40,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:37:40,758 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:37:40,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:37:40,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:37:40" (1/1) ... [2025-03-03 10:37:40,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf0269b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:40, skipping insertion in model container [2025-03-03 10:37:40,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:37:40" (1/1) ... [2025-03-03 10:37:40,842 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:37:41,020 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/Problem12_label37.c[2005,2018] [2025-03-03 10:37:41,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:37:41,521 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:37:41,529 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/Problem12_label37.c[2005,2018] [2025-03-03 10:37:41,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:37:41,851 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:37:41,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:41 WrapperNode [2025-03-03 10:37:41,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:37:41,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:37:41,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:37:41,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:37:41,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:41" (1/1) ... [2025-03-03 10:37:41,894 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:41" (1/1) ... [2025-03-03 10:37:42,158 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-03-03 10:37:42,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:37:42,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:37:42,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:37:42,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:37:42,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:41" (1/1) ... [2025-03-03 10:37:42,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:41" (1/1) ... [2025-03-03 10:37:42,200 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:41" (1/1) ... [2025-03-03 10:37:42,338 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:37:42,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:41" (1/1) ... [2025-03-03 10:37:42,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:41" (1/1) ... [2025-03-03 10:37:42,433 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:41" (1/1) ... [2025-03-03 10:37:42,450 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:41" (1/1) ... [2025-03-03 10:37:42,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:41" (1/1) ... [2025-03-03 10:37:42,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:41" (1/1) ... [2025-03-03 10:37:42,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:37:42,534 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:37:42,534 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:37:42,534 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:37:42,535 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:41" (1/1) ... [2025-03-03 10:37:42,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:37:42,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:37:42,560 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:37:42,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:37:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:37:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:37:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:37:42,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:37:42,631 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:37:42,633 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:37:46,060 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:37:46,060 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-03-03 10:37:46,060 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:37:46,218 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-03-03 10:37:46,218 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:37:46,250 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:37:46,254 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:37:46,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:37:46 BoogieIcfgContainer [2025-03-03 10:37:46,255 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:37:46,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:37:46,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:37:46,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:37:46,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:37:40" (1/3) ... [2025-03-03 10:37:46,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e399e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:37:46, skipping insertion in model container [2025-03-03 10:37:46,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:41" (2/3) ... [2025-03-03 10:37:46,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e399e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:37:46, skipping insertion in model container [2025-03-03 10:37:46,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:37:46" (3/3) ... [2025-03-03 10:37:46,262 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label37.c [2025-03-03 10:37:46,273 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:37:46,274 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label37.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:37:46,338 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:37:46,351 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;@5dae9dac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:37:46,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:37:46,358 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:46,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 10:37:46,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:46,362 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:37:46,362 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:46,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:46,367 INFO L85 PathProgramCache]: Analyzing trace with hash -424593114, now seen corresponding path program 1 times [2025-03-03 10:37:46,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:46,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162298306] [2025-03-03 10:37:46,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:46,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:46,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 10:37:46,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 10:37:46,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:46,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:46,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:37:46,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:46,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162298306] [2025-03-03 10:37:46,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162298306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:46,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:46,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:37:46,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774156144] [2025-03-03 10:37:46,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:46,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:46,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:46,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:46,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:46,570 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 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 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:49,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:49,356 INFO L93 Difference]: Finished difference Result 2388 states and 4626 transitions. [2025-03-03 10:37:49,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:49,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-03-03 10:37:49,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:49,375 INFO L225 Difference]: With dead ends: 2388 [2025-03-03 10:37:49,375 INFO L226 Difference]: Without dead ends: 1506 [2025-03-03 10:37:49,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:49,381 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 821 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:49,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 481 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 10:37:49,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-03-03 10:37:49,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-03-03 10:37:49,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.6385382059800664) internal successors, (2466), 1505 states have internal predecessors, (2466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:49,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2466 transitions. [2025-03-03 10:37:49,466 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2466 transitions. Word has length 13 [2025-03-03 10:37:49,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:49,467 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2466 transitions. [2025-03-03 10:37:49,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:49,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2466 transitions. [2025-03-03 10:37:49,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 10:37:49,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:49,469 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:37:49,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:37:49,470 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:49,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:49,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1060750435, now seen corresponding path program 1 times [2025-03-03 10:37:49,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:49,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124936183] [2025-03-03 10:37:49,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:49,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:49,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 10:37:49,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 10:37:49,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:49,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:49,847 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:37:49,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:49,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124936183] [2025-03-03 10:37:49,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124936183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:37:49,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113172101] [2025-03-03 10:37:49,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:49,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:37:49,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:37:49,852 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:37:49,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:37:49,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 10:37:49,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 10:37:49,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:49,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:49,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:37:49,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:37:49,958 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:37:49,958 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:37:49,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113172101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:49,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:37:49,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:37:49,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103408272] [2025-03-03 10:37:49,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:49,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:49,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:49,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:49,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:37:49,960 INFO L87 Difference]: Start difference. First operand 1506 states and 2466 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:52,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:52,388 INFO L93 Difference]: Finished difference Result 4512 states and 7393 transitions. [2025-03-03 10:37:52,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:52,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-03-03 10:37:52,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:52,410 INFO L225 Difference]: With dead ends: 4512 [2025-03-03 10:37:52,411 INFO L226 Difference]: Without dead ends: 3008 [2025-03-03 10:37:52,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:37:52,414 INFO L435 NwaCegarLoop]: 1383 mSDtfsCounter, 766 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1982 mSolverCounterSat, 885 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 885 IncrementalHoareTripleChecker+Valid, 1982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:52,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 1391 Invalid, 2867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [885 Valid, 1982 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:37:52,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2025-03-03 10:37:52,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 3008. [2025-03-03 10:37:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.3634852011972065) internal successors, (4100), 3007 states have internal predecessors, (4100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:52,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4100 transitions. [2025-03-03 10:37:52,533 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4100 transitions. Word has length 84 [2025-03-03 10:37:52,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:52,534 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4100 transitions. [2025-03-03 10:37:52,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:52,534 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4100 transitions. [2025-03-03 10:37:52,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 10:37:52,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:52,538 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:37:52,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 10:37:52,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:37:52,739 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:52,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:52,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1002384382, now seen corresponding path program 1 times [2025-03-03 10:37:52,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:52,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290752873] [2025-03-03 10:37:52,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:52,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:52,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 10:37:52,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 10:37:52,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:52,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:52,860 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:37:52,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:52,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290752873] [2025-03-03 10:37:52,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290752873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:52,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:52,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:37:52,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566550027] [2025-03-03 10:37:52,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:52,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:52,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:52,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:52,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:52,861 INFO L87 Difference]: Start difference. First operand 3008 states and 4100 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:54,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:54,975 INFO L93 Difference]: Finished difference Result 7516 states and 10661 transitions. [2025-03-03 10:37:54,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:54,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-03 10:37:54,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:54,988 INFO L225 Difference]: With dead ends: 7516 [2025-03-03 10:37:54,988 INFO L226 Difference]: Without dead ends: 4510 [2025-03-03 10:37:54,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:54,993 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 748 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2016 mSolverCounterSat, 910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 2926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 910 IncrementalHoareTripleChecker+Valid, 2016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:54,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 520 Invalid, 2926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [910 Valid, 2016 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:37:54,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2025-03-03 10:37:55,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 4510. [2025-03-03 10:37:55,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4510 states, 4509 states have (on average 1.3251275227323132) internal successors, (5975), 4509 states have internal predecessors, (5975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:55,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4510 states to 4510 states and 5975 transitions. [2025-03-03 10:37:55,054 INFO L78 Accepts]: Start accepts. Automaton has 4510 states and 5975 transitions. Word has length 87 [2025-03-03 10:37:55,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:55,054 INFO L471 AbstractCegarLoop]: Abstraction has 4510 states and 5975 transitions. [2025-03-03 10:37:55,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:55,054 INFO L276 IsEmpty]: Start isEmpty. Operand 4510 states and 5975 transitions. [2025-03-03 10:37:55,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 10:37:55,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:55,055 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:37:55,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:37:55,056 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:55,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:55,056 INFO L85 PathProgramCache]: Analyzing trace with hash -265540442, now seen corresponding path program 1 times [2025-03-03 10:37:55,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:55,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239427820] [2025-03-03 10:37:55,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:55,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:55,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 10:37:55,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 10:37:55,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:55,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:37:55,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:55,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239427820] [2025-03-03 10:37:55,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239427820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:55,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:55,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:37:55,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035719141] [2025-03-03 10:37:55,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:55,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:55,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:55,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:55,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:55,148 INFO L87 Difference]: Start difference. First operand 4510 states and 5975 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:57,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:57,326 INFO L93 Difference]: Finished difference Result 13526 states and 17921 transitions. [2025-03-03 10:37:57,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:57,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 10:37:57,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:57,348 INFO L225 Difference]: With dead ends: 13526 [2025-03-03 10:37:57,348 INFO L226 Difference]: Without dead ends: 9018 [2025-03-03 10:37:57,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:57,355 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 716 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2339 mSolverCounterSat, 629 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 2968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 629 IncrementalHoareTripleChecker+Valid, 2339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:57,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 618 Invalid, 2968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [629 Valid, 2339 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:37:57,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9018 states. [2025-03-03 10:37:57,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9018 to 9016. [2025-03-03 10:37:57,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9016 states, 9015 states have (on average 1.2167498613422074) internal successors, (10969), 9015 states have internal predecessors, (10969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9016 states to 9016 states and 10969 transitions. [2025-03-03 10:37:57,464 INFO L78 Accepts]: Start accepts. Automaton has 9016 states and 10969 transitions. Word has length 98 [2025-03-03 10:37:57,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:57,465 INFO L471 AbstractCegarLoop]: Abstraction has 9016 states and 10969 transitions. [2025-03-03 10:37:57,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:57,465 INFO L276 IsEmpty]: Start isEmpty. Operand 9016 states and 10969 transitions. [2025-03-03 10:37:57,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 10:37:57,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:57,469 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:37:57,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:37:57,469 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:57,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:57,470 INFO L85 PathProgramCache]: Analyzing trace with hash -468701524, now seen corresponding path program 1 times [2025-03-03 10:37:57,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:57,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835249253] [2025-03-03 10:37:57,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:57,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:57,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 10:37:57,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 10:37:57,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:57,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:57,723 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:37:57,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:57,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835249253] [2025-03-03 10:37:57,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835249253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:57,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:57,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:57,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198033016] [2025-03-03 10:37:57,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:57,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:37:57,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:57,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:37:57,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:37:57,726 INFO L87 Difference]: Start difference. First operand 9016 states and 10969 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:00,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:38:00,135 INFO L93 Difference]: Finished difference Result 22575 states and 26968 transitions. [2025-03-03 10:38:00,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:38:00,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2025-03-03 10:38:00,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:38:00,161 INFO L225 Difference]: With dead ends: 22575 [2025-03-03 10:38:00,161 INFO L226 Difference]: Without dead ends: 12022 [2025-03-03 10:38:00,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:38:00,169 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 690 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 3801 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 4008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 3801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:38:00,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 706 Invalid, 4008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 3801 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:38:00,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12022 states. [2025-03-03 10:38:00,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12022 to 12020. [2025-03-03 10:38:00,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12020 states, 12019 states have (on average 1.1626591230551626) internal successors, (13974), 12019 states have internal predecessors, (13974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:00,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12020 states to 12020 states and 13974 transitions. [2025-03-03 10:38:00,329 INFO L78 Accepts]: Start accepts. Automaton has 12020 states and 13974 transitions. Word has length 152 [2025-03-03 10:38:00,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:38:00,329 INFO L471 AbstractCegarLoop]: Abstraction has 12020 states and 13974 transitions. [2025-03-03 10:38:00,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:00,329 INFO L276 IsEmpty]: Start isEmpty. Operand 12020 states and 13974 transitions. [2025-03-03 10:38:00,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 10:38:00,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:38:00,332 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:38:00,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:38:00,332 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:38:00,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:38:00,333 INFO L85 PathProgramCache]: Analyzing trace with hash -294493523, now seen corresponding path program 1 times [2025-03-03 10:38:00,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:38:00,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260567180] [2025-03-03 10:38:00,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:00,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:38:00,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 10:38:00,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 10:38:00,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:00,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:00,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:38:00,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:38:00,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260567180] [2025-03-03 10:38:00,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260567180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:38:00,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:38:00,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:38:00,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244250365] [2025-03-03 10:38:00,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:38:00,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:38:00,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:38:00,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:38:00,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:38:00,777 INFO L87 Difference]: Start difference. First operand 12020 states and 13974 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:04,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:38:04,312 INFO L93 Difference]: Finished difference Result 30046 states and 34543 transitions. [2025-03-03 10:38:04,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:38:04,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2025-03-03 10:38:04,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:38:04,344 INFO L225 Difference]: With dead ends: 30046 [2025-03-03 10:38:04,345 INFO L226 Difference]: Without dead ends: 18779 [2025-03-03 10:38:04,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:38:04,357 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 3431 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5203 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3431 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 5356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 5203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:38:04,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3431 Valid, 642 Invalid, 5356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 5203 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-03 10:38:04,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18779 states. [2025-03-03 10:38:04,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18779 to 18028. [2025-03-03 10:38:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18028 states, 18027 states have (on average 1.1236478615410217) internal successors, (20256), 18027 states have internal predecessors, (20256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:04,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18028 states to 18028 states and 20256 transitions. [2025-03-03 10:38:04,588 INFO L78 Accepts]: Start accepts. Automaton has 18028 states and 20256 transitions. Word has length 157 [2025-03-03 10:38:04,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:38:04,589 INFO L471 AbstractCegarLoop]: Abstraction has 18028 states and 20256 transitions. [2025-03-03 10:38:04,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:04,589 INFO L276 IsEmpty]: Start isEmpty. Operand 18028 states and 20256 transitions. [2025-03-03 10:38:04,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-03-03 10:38:04,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:38:04,591 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:38:04,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:38:04,591 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:38:04,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:38:04,592 INFO L85 PathProgramCache]: Analyzing trace with hash 46079898, now seen corresponding path program 1 times [2025-03-03 10:38:04,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:38:04,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390898136] [2025-03-03 10:38:04,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:04,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:38:04,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-03 10:38:04,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-03 10:38:04,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:04,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:04,730 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:38:04,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:38:04,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390898136] [2025-03-03 10:38:04,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390898136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:38:04,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:38:04,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:38:04,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371557231] [2025-03-03 10:38:04,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:38:04,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:38:04,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:38:04,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:38:04,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:38:04,731 INFO L87 Difference]: Start difference. First operand 18028 states and 20256 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:07,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:38:07,172 INFO L93 Difference]: Finished difference Result 51074 states and 57668 transitions. [2025-03-03 10:38:07,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:38:07,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2025-03-03 10:38:07,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:38:07,229 INFO L225 Difference]: With dead ends: 51074 [2025-03-03 10:38:07,230 INFO L226 Difference]: Without dead ends: 33048 [2025-03-03 10:38:07,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:38:07,251 INFO L435 NwaCegarLoop]: 1337 mSDtfsCounter, 669 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2705 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 3078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 2705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:38:07,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1344 Invalid, 3078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 2705 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:38:07,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33048 states. [2025-03-03 10:38:07,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33048 to 30044. [2025-03-03 10:38:07,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30044 states, 30043 states have (on average 1.1242552341643643) internal successors, (33776), 30043 states have internal predecessors, (33776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:07,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30044 states to 30044 states and 33776 transitions. [2025-03-03 10:38:07,656 INFO L78 Accepts]: Start accepts. Automaton has 30044 states and 33776 transitions. Word has length 239 [2025-03-03 10:38:07,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:38:07,657 INFO L471 AbstractCegarLoop]: Abstraction has 30044 states and 33776 transitions. [2025-03-03 10:38:07,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:07,657 INFO L276 IsEmpty]: Start isEmpty. Operand 30044 states and 33776 transitions. [2025-03-03 10:38:07,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-03-03 10:38:07,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:38:07,659 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:38:07,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:38:07,659 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:38:07,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:38:07,660 INFO L85 PathProgramCache]: Analyzing trace with hash 2019774480, now seen corresponding path program 1 times [2025-03-03 10:38:07,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:38:07,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203752435] [2025-03-03 10:38:07,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:07,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:38:07,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-03-03 10:38:07,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-03-03 10:38:07,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:07,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:07,789 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 10:38:07,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:38:07,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203752435] [2025-03-03 10:38:07,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203752435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:38:07,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:38:07,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:38:07,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146973387] [2025-03-03 10:38:07,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:38:07,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:38:07,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:38:07,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:38:07,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:38:07,791 INFO L87 Difference]: Start difference. First operand 30044 states and 33776 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:09,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:38:09,804 INFO L93 Difference]: Finished difference Result 60086 states and 67550 transitions. [2025-03-03 10:38:09,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:38:09,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 243 [2025-03-03 10:38:09,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:38:09,854 INFO L225 Difference]: With dead ends: 60086 [2025-03-03 10:38:09,855 INFO L226 Difference]: Without dead ends: 30044 [2025-03-03 10:38:09,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:38:09,875 INFO L435 NwaCegarLoop]: 990 mSDtfsCounter, 814 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2312 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 2707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 2312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:38:09,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 998 Invalid, 2707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 2312 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 10:38:09,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30044 states. [2025-03-03 10:38:10,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30044 to 30044. [2025-03-03 10:38:10,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30044 states, 30043 states have (on average 1.097793163132843) internal successors, (32981), 30043 states have internal predecessors, (32981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:10,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30044 states to 30044 states and 32981 transitions. [2025-03-03 10:38:10,204 INFO L78 Accepts]: Start accepts. Automaton has 30044 states and 32981 transitions. Word has length 243 [2025-03-03 10:38:10,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:38:10,205 INFO L471 AbstractCegarLoop]: Abstraction has 30044 states and 32981 transitions. [2025-03-03 10:38:10,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:10,205 INFO L276 IsEmpty]: Start isEmpty. Operand 30044 states and 32981 transitions. [2025-03-03 10:38:10,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-03-03 10:38:10,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:38:10,212 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:38:10,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:38:10,212 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:38:10,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:38:10,213 INFO L85 PathProgramCache]: Analyzing trace with hash -733685267, now seen corresponding path program 1 times [2025-03-03 10:38:10,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:38:10,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73412218] [2025-03-03 10:38:10,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:10,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:38:10,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-03-03 10:38:10,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-03-03 10:38:10,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:10,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:10,528 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 73 proven. 160 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 10:38:10,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:38:10,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73412218] [2025-03-03 10:38:10,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73412218] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:38:10,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125925474] [2025-03-03 10:38:10,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:10,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:38:10,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:38:10,531 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:38:10,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:38:10,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-03-03 10:38:10,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-03-03 10:38:10,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:10,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:10,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:38:10,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:38:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-03 10:38:10,820 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:38:10,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125925474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:38:10,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:38:10,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:38:10,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287901888] [2025-03-03 10:38:10,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:38:10,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:38:10,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:38:10,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:38:10,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:38:10,821 INFO L87 Difference]: Start difference. First operand 30044 states and 32981 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:13,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:38:13,193 INFO L93 Difference]: Finished difference Result 72853 states and 80761 transitions. [2025-03-03 10:38:13,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:38:13,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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 319 [2025-03-03 10:38:13,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:38:13,237 INFO L225 Difference]: With dead ends: 72853 [2025-03-03 10:38:13,237 INFO L226 Difference]: Without dead ends: 37554 [2025-03-03 10:38:13,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:38:13,258 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 903 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2072 mSolverCounterSat, 701 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 2773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 701 IncrementalHoareTripleChecker+Valid, 2072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:38:13,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 309 Invalid, 2773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [701 Valid, 2072 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:38:13,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37554 states. [2025-03-03 10:38:13,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37554 to 31546. [2025-03-03 10:38:13,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31546 states, 31545 states have (on average 1.0853384054525281) internal successors, (34237), 31545 states have internal predecessors, (34237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:13,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31546 states to 31546 states and 34237 transitions. [2025-03-03 10:38:13,561 INFO L78 Accepts]: Start accepts. Automaton has 31546 states and 34237 transitions. Word has length 319 [2025-03-03 10:38:13,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:38:13,562 INFO L471 AbstractCegarLoop]: Abstraction has 31546 states and 34237 transitions. [2025-03-03 10:38:13,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:13,562 INFO L276 IsEmpty]: Start isEmpty. Operand 31546 states and 34237 transitions. [2025-03-03 10:38:13,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-03-03 10:38:13,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:38:13,568 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:38:13,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 10:38:13,769 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 10:38:13,769 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:38:13,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:38:13,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1506989820, now seen corresponding path program 1 times [2025-03-03 10:38:13,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:38:13,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56581032] [2025-03-03 10:38:13,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:13,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:38:13,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-03-03 10:38:13,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-03-03 10:38:13,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:13,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:13,967 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-03 10:38:13,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:38:13,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56581032] [2025-03-03 10:38:13,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56581032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:38:13,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:38:13,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:38:13,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991570717] [2025-03-03 10:38:13,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:38:13,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:38:13,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:38:13,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:38:13,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:38:13,970 INFO L87 Difference]: Start difference. First operand 31546 states and 34237 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:15,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:38:15,949 INFO L93 Difference]: Finished difference Result 65343 states and 70750 transitions. [2025-03-03 10:38:15,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:38:15,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 381 [2025-03-03 10:38:15,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:38:15,984 INFO L225 Difference]: With dead ends: 65343 [2025-03-03 10:38:15,984 INFO L226 Difference]: Without dead ends: 33799 [2025-03-03 10:38:16,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:38:16,003 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 646 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2130 mSolverCounterSat, 533 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 2663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 533 IncrementalHoareTripleChecker+Valid, 2130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:38:16,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 110 Invalid, 2663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [533 Valid, 2130 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 10:38:16,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33799 states. [2025-03-03 10:38:16,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33799 to 30795. [2025-03-03 10:38:16,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30795 states, 30794 states have (on average 1.0818990712476457) internal successors, (33316), 30794 states have internal predecessors, (33316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:16,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30795 states to 30795 states and 33316 transitions. [2025-03-03 10:38:16,249 INFO L78 Accepts]: Start accepts. Automaton has 30795 states and 33316 transitions. Word has length 381 [2025-03-03 10:38:16,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:38:16,249 INFO L471 AbstractCegarLoop]: Abstraction has 30795 states and 33316 transitions. [2025-03-03 10:38:16,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:16,249 INFO L276 IsEmpty]: Start isEmpty. Operand 30795 states and 33316 transitions. [2025-03-03 10:38:16,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-03-03 10:38:16,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:38:16,255 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:38:16,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:38:16,255 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:38:16,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:38:16,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1153197693, now seen corresponding path program 1 times [2025-03-03 10:38:16,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:38:16,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419548832] [2025-03-03 10:38:16,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:16,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:38:16,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-03-03 10:38:16,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-03-03 10:38:16,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:16,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:16,560 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 73 proven. 230 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-03 10:38:16,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:38:16,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419548832] [2025-03-03 10:38:16,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419548832] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:38:16,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553886296] [2025-03-03 10:38:16,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:16,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:38:16,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:38:16,563 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:38:16,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:38:16,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-03-03 10:38:16,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-03-03 10:38:16,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:16,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:16,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:38:16,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:38:16,880 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 262 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 10:38:16,880 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:38:16,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553886296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:38:16,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:38:16,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 10:38:16,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626306434] [2025-03-03 10:38:16,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:38:16,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:38:16,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:38:16,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:38:16,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:38:16,882 INFO L87 Difference]: Start difference. First operand 30795 states and 33316 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:18,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:38:18,938 INFO L93 Difference]: Finished difference Result 72853 states and 79559 transitions. [2025-03-03 10:38:18,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:38:18,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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 392 [2025-03-03 10:38:18,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:38:18,980 INFO L225 Difference]: With dead ends: 72853 [2025-03-03 10:38:18,981 INFO L226 Difference]: Without dead ends: 42060 [2025-03-03 10:38:19,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:38:19,001 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 674 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2016 mSolverCounterSat, 738 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 2754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 738 IncrementalHoareTripleChecker+Valid, 2016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:38:19,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 861 Invalid, 2754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [738 Valid, 2016 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:38:19,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42060 states. [2025-03-03 10:38:19,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42060 to 40558. [2025-03-03 10:38:19,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40558 states, 40557 states have (on average 1.0969499716448454) internal successors, (44489), 40557 states have internal predecessors, (44489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:19,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40558 states to 40558 states and 44489 transitions. [2025-03-03 10:38:19,304 INFO L78 Accepts]: Start accepts. Automaton has 40558 states and 44489 transitions. Word has length 392 [2025-03-03 10:38:19,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:38:19,305 INFO L471 AbstractCegarLoop]: Abstraction has 40558 states and 44489 transitions. [2025-03-03 10:38:19,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:19,305 INFO L276 IsEmpty]: Start isEmpty. Operand 40558 states and 44489 transitions. [2025-03-03 10:38:19,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-03-03 10:38:19,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:38:19,315 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:38:19,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 10:38:19,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:38:19,516 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:38:19,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:38:19,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1424436641, now seen corresponding path program 1 times [2025-03-03 10:38:19,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:38:19,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829338937] [2025-03-03 10:38:19,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:19,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:38:19,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-03-03 10:38:19,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-03-03 10:38:19,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:19,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:19,724 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 551 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-03 10:38:19,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:38:19,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829338937] [2025-03-03 10:38:19,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829338937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:38:19,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:38:19,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:38:19,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703901075] [2025-03-03 10:38:19,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:38:19,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:38:19,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:38:19,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:38:19,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:38:19,727 INFO L87 Difference]: Start difference. First operand 40558 states and 44489 transitions. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:21,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:38:21,802 INFO L93 Difference]: Finished difference Result 99138 states and 109520 transitions. [2025-03-03 10:38:21,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:38:21,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 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 570 [2025-03-03 10:38:21,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:38:21,865 INFO L225 Difference]: With dead ends: 99138 [2025-03-03 10:38:21,865 INFO L226 Difference]: Without dead ends: 58582 [2025-03-03 10:38:21,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:38:21,897 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 676 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2126 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 2639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 2126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:38:21,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 333 Invalid, 2639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [513 Valid, 2126 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 10:38:21,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58582 states. [2025-03-03 10:38:22,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58582 to 58582. [2025-03-03 10:38:22,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58582 states, 58581 states have (on average 1.0923336918113382) internal successors, (63990), 58581 states have internal predecessors, (63990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:22,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58582 states to 58582 states and 63990 transitions. [2025-03-03 10:38:22,541 INFO L78 Accepts]: Start accepts. Automaton has 58582 states and 63990 transitions. Word has length 570 [2025-03-03 10:38:22,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:38:22,542 INFO L471 AbstractCegarLoop]: Abstraction has 58582 states and 63990 transitions. [2025-03-03 10:38:22,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:22,542 INFO L276 IsEmpty]: Start isEmpty. Operand 58582 states and 63990 transitions. [2025-03-03 10:38:22,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2025-03-03 10:38:22,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:38:22,559 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:38:22,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:38:22,560 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:38:22,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:38:22,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1915575363, now seen corresponding path program 1 times [2025-03-03 10:38:22,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:38:22,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756643733] [2025-03-03 10:38:22,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:22,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:38:22,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 595 statements into 1 equivalence classes. [2025-03-03 10:38:22,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 595 of 595 statements. [2025-03-03 10:38:22,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:22,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:23,232 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 116 proven. 229 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:38:23,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:38:23,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756643733] [2025-03-03 10:38:23,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756643733] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:38:23,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234034097] [2025-03-03 10:38:23,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:23,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:38:23,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:38:23,234 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:38:23,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 10:38:23,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 595 statements into 1 equivalence classes. [2025-03-03 10:38:23,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 595 of 595 statements. [2025-03-03 10:38:23,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:23,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:23,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:38:23,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:38:24,252 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 10:38:24,252 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:38:24,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234034097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:38:24,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:38:24,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 10:38:24,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213100444] [2025-03-03 10:38:24,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:38:24,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:38:24,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:38:24,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:38:24,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:38:24,254 INFO L87 Difference]: Start difference. First operand 58582 states and 63990 transitions. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:26,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:38:26,102 INFO L93 Difference]: Finished difference Result 118664 states and 129592 transitions. [2025-03-03 10:38:26,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:38:26,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 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 595 [2025-03-03 10:38:26,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:38:26,170 INFO L225 Difference]: With dead ends: 118664 [2025-03-03 10:38:26,170 INFO L226 Difference]: Without dead ends: 60084 [2025-03-03 10:38:26,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 595 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:38:26,207 INFO L435 NwaCegarLoop]: 1163 mSDtfsCounter, 413 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2084 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 2297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 2084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:38:26,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1171 Invalid, 2297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 2084 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 10:38:26,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60084 states. [2025-03-03 10:38:26,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60084 to 60084. [2025-03-03 10:38:26,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60084 states, 60083 states have (on average 1.0876454238303679) internal successors, (65349), 60083 states have internal predecessors, (65349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:26,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60084 states to 60084 states and 65349 transitions. [2025-03-03 10:38:26,863 INFO L78 Accepts]: Start accepts. Automaton has 60084 states and 65349 transitions. Word has length 595 [2025-03-03 10:38:26,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:38:26,863 INFO L471 AbstractCegarLoop]: Abstraction has 60084 states and 65349 transitions. [2025-03-03 10:38:26,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:26,863 INFO L276 IsEmpty]: Start isEmpty. Operand 60084 states and 65349 transitions. [2025-03-03 10:38:26,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-03-03 10:38:26,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:38:26,876 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:38:26,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 10:38:27,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:38:27,076 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:38:27,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:38:27,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1555844349, now seen corresponding path program 1 times [2025-03-03 10:38:27,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:38:27,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742124924] [2025-03-03 10:38:27,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:27,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:38:27,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-03-03 10:38:27,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-03-03 10:38:27,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:27,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:27,222 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 594 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-03-03 10:38:27,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:38:27,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742124924] [2025-03-03 10:38:27,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742124924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:38:27,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:38:27,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:38:27,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936216027] [2025-03-03 10:38:27,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:38:27,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:38:27,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:38:27,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:38:27,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:38:27,224 INFO L87 Difference]: Start difference. First operand 60084 states and 65349 transitions. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:29,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:38:29,121 INFO L93 Difference]: Finished difference Result 130680 states and 142487 transitions. [2025-03-03 10:38:29,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:38:29,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 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 597 [2025-03-03 10:38:29,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:38:29,189 INFO L225 Difference]: With dead ends: 130680 [2025-03-03 10:38:29,190 INFO L226 Difference]: Without dead ends: 70598 [2025-03-03 10:38:29,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:38:29,224 INFO L435 NwaCegarLoop]: 1169 mSDtfsCounter, 663 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2107 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 2471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 2107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:38:29,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 1177 Invalid, 2471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 2107 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 10:38:29,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70598 states. [2025-03-03 10:38:29,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70598 to 69847. [2025-03-03 10:38:29,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69847 states, 69846 states have (on average 1.0823526043008904) internal successors, (75598), 69846 states have internal predecessors, (75598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:29,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69847 states to 69847 states and 75598 transitions. [2025-03-03 10:38:29,904 INFO L78 Accepts]: Start accepts. Automaton has 69847 states and 75598 transitions. Word has length 597 [2025-03-03 10:38:29,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:38:29,904 INFO L471 AbstractCegarLoop]: Abstraction has 69847 states and 75598 transitions. [2025-03-03 10:38:29,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:29,904 INFO L276 IsEmpty]: Start isEmpty. Operand 69847 states and 75598 transitions. [2025-03-03 10:38:29,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2025-03-03 10:38:29,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:38:29,916 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-03-03 10:38:29,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:38:29,916 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:38:29,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:38:29,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1564127309, now seen corresponding path program 1 times [2025-03-03 10:38:29,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:38:29,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365223724] [2025-03-03 10:38:29,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:29,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:38:29,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-03-03 10:38:29,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-03-03 10:38:29,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:29,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 598 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-03 10:38:30,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:38:30,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365223724] [2025-03-03 10:38:30,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365223724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:38:30,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:38:30,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:38:30,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878940110] [2025-03-03 10:38:30,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:38:30,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:38:30,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:38:30,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:38:30,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:38:30,296 INFO L87 Difference]: Start difference. First operand 69847 states and 75598 transitions. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:32,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:38:32,339 INFO L93 Difference]: Finished difference Result 159969 states and 173611 transitions. [2025-03-03 10:38:32,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:38:32,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 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 601 [2025-03-03 10:38:32,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:38:32,458 INFO L225 Difference]: With dead ends: 159969 [2025-03-03 10:38:32,458 INFO L226 Difference]: Without dead ends: 90124 [2025-03-03 10:38:32,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:38:32,509 INFO L435 NwaCegarLoop]: 1159 mSDtfsCounter, 678 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2033 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 2346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 2033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:38:32,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1167 Invalid, 2346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 2033 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 10:38:32,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90124 states. [2025-03-03 10:38:33,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90124 to 89373. [2025-03-03 10:38:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89373 states, 89372 states have (on average 1.0797005773620374) internal successors, (96495), 89372 states have internal predecessors, (96495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:33,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89373 states to 89373 states and 96495 transitions. [2025-03-03 10:38:33,476 INFO L78 Accepts]: Start accepts. Automaton has 89373 states and 96495 transitions. Word has length 601 [2025-03-03 10:38:33,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:38:33,476 INFO L471 AbstractCegarLoop]: Abstraction has 89373 states and 96495 transitions. [2025-03-03 10:38:33,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:33,476 INFO L276 IsEmpty]: Start isEmpty. Operand 89373 states and 96495 transitions. [2025-03-03 10:38:33,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2025-03-03 10:38:33,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:38:33,489 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:38:33,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:38:33,490 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:38:33,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:38:33,490 INFO L85 PathProgramCache]: Analyzing trace with hash -399725111, now seen corresponding path program 1 times [2025-03-03 10:38:33,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:38:33,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973941276] [2025-03-03 10:38:33,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:33,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:38:33,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes. [2025-03-03 10:38:33,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements. [2025-03-03 10:38:33,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:33,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:34,527 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 144 proven. 257 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:38:34,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:38:34,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973941276] [2025-03-03 10:38:34,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973941276] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:38:34,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397120023] [2025-03-03 10:38:34,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:34,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:38:34,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:38:34,535 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:38:34,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 10:38:34,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes. [2025-03-03 10:38:34,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements. [2025-03-03 10:38:34,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:34,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:34,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 10:38:34,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:38:36,166 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 293 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:38:36,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:38:37,724 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-03 10:38:37,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397120023] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 10:38:37,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 10:38:37,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 5] total 11 [2025-03-03 10:38:37,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791207079] [2025-03-03 10:38:37,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:38:37,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:38:37,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:38:37,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:38:37,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-03 10:38:37,727 INFO L87 Difference]: Start difference. First operand 89373 states and 96495 transitions. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:39,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:38:39,713 INFO L93 Difference]: Finished difference Result 190009 states and 205048 transitions. [2025-03-03 10:38:39,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:38:39,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 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 623 [2025-03-03 10:38:39,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:38:39,934 INFO L225 Difference]: With dead ends: 190009 [2025-03-03 10:38:39,934 INFO L226 Difference]: Without dead ends: 100638 [2025-03-03 10:38:39,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1251 GetRequests, 1242 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-03 10:38:39,968 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 467 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1986 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 2504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 1986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:38:39,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 71 Invalid, 2504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 1986 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 10:38:40,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100638 states. [2025-03-03 10:38:40,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100638 to 98385. [2025-03-03 10:38:40,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98385 states, 98384 states have (on average 1.0652850056919825) internal successors, (104807), 98384 states have internal predecessors, (104807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:40,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98385 states to 98385 states and 104807 transitions. [2025-03-03 10:38:40,720 INFO L78 Accepts]: Start accepts. Automaton has 98385 states and 104807 transitions. Word has length 623 [2025-03-03 10:38:40,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:38:40,720 INFO L471 AbstractCegarLoop]: Abstraction has 98385 states and 104807 transitions. [2025-03-03 10:38:40,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:40,720 INFO L276 IsEmpty]: Start isEmpty. Operand 98385 states and 104807 transitions. [2025-03-03 10:38:40,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2025-03-03 10:38:40,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:38:40,738 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:38:40,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 10:38:40,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 10:38:40,939 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:38:40,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:38:40,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1646584477, now seen corresponding path program 1 times [2025-03-03 10:38:40,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:38:40,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472757332] [2025-03-03 10:38:40,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:40,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:38:40,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes. [2025-03-03 10:38:41,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements. [2025-03-03 10:38:41,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:41,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:41,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1133 backedges. 874 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2025-03-03 10:38:41,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:38:41,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472757332] [2025-03-03 10:38:41,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472757332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:38:41,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:38:41,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:38:41,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601955591] [2025-03-03 10:38:41,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:38:41,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:38:41,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:38:41,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:38:41,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:38:41,285 INFO L87 Difference]: Start difference. First operand 98385 states and 104807 transitions. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:43,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:38:43,402 INFO L93 Difference]: Finished difference Result 224555 states and 239813 transitions. [2025-03-03 10:38:43,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:38:43,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 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 707 [2025-03-03 10:38:43,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:38:43,559 INFO L225 Difference]: With dead ends: 224555 [2025-03-03 10:38:43,559 INFO L226 Difference]: Without dead ends: 124670 [2025-03-03 10:38:43,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:38:43,626 INFO L435 NwaCegarLoop]: 1160 mSDtfsCounter, 696 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2083 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 2545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 2083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:38:43,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1167 Invalid, 2545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 2083 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 10:38:43,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124670 states. [2025-03-03 10:38:44,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124670 to 120915. [2025-03-03 10:38:44,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120915 states, 120914 states have (on average 1.0517640637147063) internal successors, (127173), 120914 states have internal predecessors, (127173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:44,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120915 states to 120915 states and 127173 transitions. [2025-03-03 10:38:44,961 INFO L78 Accepts]: Start accepts. Automaton has 120915 states and 127173 transitions. Word has length 707 [2025-03-03 10:38:44,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:38:44,961 INFO L471 AbstractCegarLoop]: Abstraction has 120915 states and 127173 transitions. [2025-03-03 10:38:44,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:44,962 INFO L276 IsEmpty]: Start isEmpty. Operand 120915 states and 127173 transitions. [2025-03-03 10:38:44,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2025-03-03 10:38:44,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:38:44,982 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:38:44,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:38:44,982 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:38:44,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:38:44,983 INFO L85 PathProgramCache]: Analyzing trace with hash -460604431, now seen corresponding path program 1 times [2025-03-03 10:38:44,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:38:44,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350839687] [2025-03-03 10:38:44,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:44,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:38:45,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-03-03 10:38:45,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-03-03 10:38:45,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:45,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:45,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 550 proven. 0 refuted. 0 times theorem prover too weak. 604 trivial. 0 not checked. [2025-03-03 10:38:45,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:38:45,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350839687] [2025-03-03 10:38:45,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350839687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:38:45,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:38:45,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:38:45,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085205838] [2025-03-03 10:38:45,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:38:45,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:38:45,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:38:45,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:38:45,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:38:45,581 INFO L87 Difference]: Start difference. First operand 120915 states and 127173 transitions. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:47,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:38:47,825 INFO L93 Difference]: Finished difference Result 244081 states and 256602 transitions. [2025-03-03 10:38:47,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:38:47,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 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 734 [2025-03-03 10:38:47,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:38:47,974 INFO L225 Difference]: With dead ends: 244081 [2025-03-03 10:38:47,974 INFO L226 Difference]: Without dead ends: 120164 [2025-03-03 10:38:48,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:38:48,198 INFO L435 NwaCegarLoop]: 1120 mSDtfsCounter, 589 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1979 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 2380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 1979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:38:48,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 1128 Invalid, 2380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 1979 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 10:38:48,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120164 states. [2025-03-03 10:38:48,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120164 to 114156. [2025-03-03 10:38:49,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114156 states, 114155 states have (on average 1.0350313170688976) internal successors, (118154), 114155 states have internal predecessors, (118154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:49,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114156 states to 114156 states and 118154 transitions. [2025-03-03 10:38:49,167 INFO L78 Accepts]: Start accepts. Automaton has 114156 states and 118154 transitions. Word has length 734 [2025-03-03 10:38:49,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:38:49,167 INFO L471 AbstractCegarLoop]: Abstraction has 114156 states and 118154 transitions. [2025-03-03 10:38:49,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:49,167 INFO L276 IsEmpty]: Start isEmpty. Operand 114156 states and 118154 transitions. [2025-03-03 10:38:49,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 885 [2025-03-03 10:38:49,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:38:49,344 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:38:49,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:38:49,345 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:38:49,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:38:49,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1821413908, now seen corresponding path program 1 times [2025-03-03 10:38:49,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:38:49,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553829092] [2025-03-03 10:38:49,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:49,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:38:49,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 884 statements into 1 equivalence classes. [2025-03-03 10:38:49,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 884 of 884 statements. [2025-03-03 10:38:49,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:49,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:49,752 INFO L134 CoverageAnalysis]: Checked inductivity of 972 backedges. 826 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-03 10:38:49,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:38:49,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553829092] [2025-03-03 10:38:49,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553829092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:38:49,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:38:49,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:38:49,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905902861] [2025-03-03 10:38:49,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:38:49,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:38:49,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:38:49,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:38:49,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:38:49,755 INFO L87 Difference]: Start difference. First operand 114156 states and 118154 transitions. Second operand has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:52,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:38:52,259 INFO L93 Difference]: Finished difference Result 271117 states and 280613 transitions. [2025-03-03 10:38:52,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:38:52,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 0 states have call successors, (0), 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 884 [2025-03-03 10:38:52,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:38:52,490 INFO L225 Difference]: With dead ends: 271117 [2025-03-03 10:38:52,491 INFO L226 Difference]: Without dead ends: 157714 [2025-03-03 10:38:52,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:38:52,582 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 543 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2102 mSolverCounterSat, 516 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 2618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 516 IncrementalHoareTripleChecker+Valid, 2102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:38:52,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 193 Invalid, 2618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [516 Valid, 2102 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 10:38:52,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157714 states. [2025-03-03 10:38:54,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157714 to 122417. [2025-03-03 10:38:54,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122417 states, 122416 states have (on average 1.035183309371324) internal successors, (126723), 122416 states have internal predecessors, (126723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:54,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122417 states to 122417 states and 126723 transitions. [2025-03-03 10:38:54,309 INFO L78 Accepts]: Start accepts. Automaton has 122417 states and 126723 transitions. Word has length 884 [2025-03-03 10:38:54,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:38:54,309 INFO L471 AbstractCegarLoop]: Abstraction has 122417 states and 126723 transitions. [2025-03-03 10:38:54,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:54,309 INFO L276 IsEmpty]: Start isEmpty. Operand 122417 states and 126723 transitions. [2025-03-03 10:38:54,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 893 [2025-03-03 10:38:54,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:38:54,336 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:38:54,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 10:38:54,336 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:38:54,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:38:54,337 INFO L85 PathProgramCache]: Analyzing trace with hash 278508328, now seen corresponding path program 1 times [2025-03-03 10:38:54,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:38:54,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539722948] [2025-03-03 10:38:54,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:54,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:38:54,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 892 statements into 1 equivalence classes. [2025-03-03 10:38:54,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 892 of 892 statements. [2025-03-03 10:38:54,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:54,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:55,387 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 845 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-03 10:38:55,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:38:55,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539722948] [2025-03-03 10:38:55,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539722948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:38:55,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:38:55,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:38:55,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242700371] [2025-03-03 10:38:55,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:38:55,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:38:55,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:38:55,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:38:55,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:38:55,390 INFO L87 Difference]: Start difference. First operand 122417 states and 126723 transitions. Second operand has 4 states, 4 states have (on average 189.5) internal successors, (758), 4 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:58,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:38:58,418 INFO L93 Difference]: Finished difference Result 257599 states and 266611 transitions. [2025-03-03 10:38:58,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:38:58,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 189.5) internal successors, (758), 4 states have internal predecessors, (758), 0 states have call successors, (0), 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 892 [2025-03-03 10:38:58,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:38:58,589 INFO L225 Difference]: With dead ends: 257599 [2025-03-03 10:38:58,589 INFO L226 Difference]: Without dead ends: 135935 [2025-03-03 10:38:58,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:38:58,663 INFO L435 NwaCegarLoop]: 1143 mSDtfsCounter, 918 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3726 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 3897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 3726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:38:58,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 1157 Invalid, 3897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 3726 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:38:58,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135935 states. [2025-03-03 10:38:59,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135935 to 125421. [2025-03-03 10:38:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125421 states, 125420 states have (on average 1.0346276510923298) internal successors, (129763), 125420 states have internal predecessors, (129763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:00,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125421 states to 125421 states and 129763 transitions. [2025-03-03 10:39:00,371 INFO L78 Accepts]: Start accepts. Automaton has 125421 states and 129763 transitions. Word has length 892 [2025-03-03 10:39:00,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:00,371 INFO L471 AbstractCegarLoop]: Abstraction has 125421 states and 129763 transitions. [2025-03-03 10:39:00,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 189.5) internal successors, (758), 4 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:00,372 INFO L276 IsEmpty]: Start isEmpty. Operand 125421 states and 129763 transitions. [2025-03-03 10:39:00,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 951 [2025-03-03 10:39:00,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:00,405 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:39:00,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 10:39:00,405 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:00,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:00,406 INFO L85 PathProgramCache]: Analyzing trace with hash 122769803, now seen corresponding path program 1 times [2025-03-03 10:39:00,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:00,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907562350] [2025-03-03 10:39:00,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:00,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:00,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 950 statements into 1 equivalence classes. [2025-03-03 10:39:00,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 950 of 950 statements. [2025-03-03 10:39:00,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:00,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:01,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1377 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2025-03-03 10:39:01,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:01,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907562350] [2025-03-03 10:39:01,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907562350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:01,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:01,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:39:01,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652980519] [2025-03-03 10:39:01,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:01,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:01,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:01,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:01,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:01,126 INFO L87 Difference]: Start difference. First operand 125421 states and 129763 transitions. Second operand has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)