./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_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/Problem17_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 8bd98135d8ae582748799a59c9940e3e8b9dde2a3b5c340030fcdb71a0e998f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 11:00:36,720 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:00:36,776 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 11:00:36,780 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:00:36,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:00:36,798 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:00:36,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:00:36,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:00:36,799 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:00:36,799 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:00:36,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:00:36,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:00:36,799 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:00:36,799 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:00:36,800 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:00:36,800 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:00:36,800 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:00:36,800 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:00:36,800 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 11:00:36,800 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:00:36,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:00:36,800 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:00:36,800 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:00:36,800 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:00:36,801 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:00:36,801 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:00:36,801 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:00:36,801 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:00:36,801 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:00:36,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:00:36,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:00:36,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:00:36,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:00:36,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:00:36,801 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:00:36,802 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:00:36,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:00:36,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 11:00:36,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 11:00:36,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:00:36,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:00:36,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:00:36,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:00:36,802 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 -> 8bd98135d8ae582748799a59c9940e3e8b9dde2a3b5c340030fcdb71a0e998f7 [2025-03-03 11:00:37,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:00:37,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:00:37,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:00:37,038 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:00:37,038 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:00:37,039 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label37.c [2025-03-03 11:00:38,198 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13012512f/8bd0467ece88496c9a9c78f0ab64b7c4/FLAG72842c6fd [2025-03-03 11:00:38,556 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:00:38,557 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label37.c [2025-03-03 11:00:38,578 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13012512f/8bd0467ece88496c9a9c78f0ab64b7c4/FLAG72842c6fd [2025-03-03 11:00:38,762 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13012512f/8bd0467ece88496c9a9c78f0ab64b7c4 [2025-03-03 11:00:38,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:00:38,765 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:00:38,766 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:00:38,766 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:00:38,769 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:00:38,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:00:38" (1/1) ... [2025-03-03 11:00:38,770 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3433869c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:38, skipping insertion in model container [2025-03-03 11:00:38,770 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:00:38" (1/1) ... [2025-03-03 11:00:38,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:00:38,952 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label37.c[2848,2861] [2025-03-03 11:00:39,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:00:39,297 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:00:39,306 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label37.c[2848,2861] [2025-03-03 11:00:39,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:00:39,483 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:00:39,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:39 WrapperNode [2025-03-03 11:00:39,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:00:39,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:00:39,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:00:39,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:00:39,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:39" (1/1) ... [2025-03-03 11:00:39,518 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:39" (1/1) ... [2025-03-03 11:00:39,770 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-03 11:00:39,771 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:00:39,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:00:39,772 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:00:39,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:00:39,777 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:39" (1/1) ... [2025-03-03 11:00:39,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:39" (1/1) ... [2025-03-03 11:00:39,812 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:39" (1/1) ... [2025-03-03 11:00:39,963 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 11:00:39,968 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:39" (1/1) ... [2025-03-03 11:00:39,968 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:39" (1/1) ... [2025-03-03 11:00:40,078 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:39" (1/1) ... [2025-03-03 11:00:40,090 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:39" (1/1) ... [2025-03-03 11:00:40,104 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:39" (1/1) ... [2025-03-03 11:00:40,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:39" (1/1) ... [2025-03-03 11:00:40,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:00:40,143 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:00:40,143 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:00:40,143 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:00:40,144 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:39" (1/1) ... [2025-03-03 11:00:40,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:00:40,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:00:40,170 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 11:00:40,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 11:00:40,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:00:40,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 11:00:40,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:00:40,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:00:40,243 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:00:40,245 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:00:43,119 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-03 11:00:43,233 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-03 11:00:43,233 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:00:43,259 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:00:43,263 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:00:43,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:00:43 BoogieIcfgContainer [2025-03-03 11:00:43,263 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:00:43,265 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:00:43,265 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:00:43,269 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:00:43,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:00:38" (1/3) ... [2025-03-03 11:00:43,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a2895c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:00:43, skipping insertion in model container [2025-03-03 11:00:43,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:39" (2/3) ... [2025-03-03 11:00:43,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a2895c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:00:43, skipping insertion in model container [2025-03-03 11:00:43,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:00:43" (3/3) ... [2025-03-03 11:00:43,271 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label37.c [2025-03-03 11:00:43,283 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:00:43,285 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label37.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 11:00:43,348 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:00:43,357 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;@2a438b43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:00:43,357 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 11:00:43,363 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:43,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 11:00:43,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:43,369 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:00:43,369 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:43,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:43,375 INFO L85 PathProgramCache]: Analyzing trace with hash -806925140, now seen corresponding path program 1 times [2025-03-03 11:00:43,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:43,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105078627] [2025-03-03 11:00:43,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:43,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:43,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 11:00:43,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 11:00:43,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:43,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:43,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:00:43,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:43,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105078627] [2025-03-03 11:00:43,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105078627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:43,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:43,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:00:43,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246810872] [2025-03-03 11:00:43,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:43,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:00:43,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:43,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:00:43,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:43,607 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:45,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:45,892 INFO L93 Difference]: Finished difference Result 1667 states and 3058 transitions. [2025-03-03 11:00:45,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:00:45,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2025-03-03 11:00:45,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:45,905 INFO L225 Difference]: With dead ends: 1667 [2025-03-03 11:00:45,905 INFO L226 Difference]: Without dead ends: 998 [2025-03-03 11:00:45,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:45,912 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 527 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:45,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 276 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 11:00:45,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2025-03-03 11:00:45,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 982. [2025-03-03 11:00:45,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 1.707441386340469) internal successors, (1675), 981 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:45,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1675 transitions. [2025-03-03 11:00:45,980 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1675 transitions. Word has length 18 [2025-03-03 11:00:45,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:45,981 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1675 transitions. [2025-03-03 11:00:45,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:45,981 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1675 transitions. [2025-03-03 11:00:45,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 11:00:45,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:45,983 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 11:00:45,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 11:00:45,983 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:45,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:45,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1857434867, now seen corresponding path program 1 times [2025-03-03 11:00:45,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:45,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766758617] [2025-03-03 11:00:45,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:45,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:46,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 11:00:46,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 11:00:46,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:46,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:46,238 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:00:46,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:46,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766758617] [2025-03-03 11:00:46,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766758617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:46,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:46,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:00:46,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847048083] [2025-03-03 11:00:46,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:46,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:00:46,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:46,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:00:46,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:46,240 INFO L87 Difference]: Start difference. First operand 982 states and 1675 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:48,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:48,034 INFO L93 Difference]: Finished difference Result 2824 states and 4847 transitions. [2025-03-03 11:00:48,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:00:48,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-03-03 11:00:48,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:48,041 INFO L225 Difference]: With dead ends: 2824 [2025-03-03 11:00:48,041 INFO L226 Difference]: Without dead ends: 1844 [2025-03-03 11:00:48,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:48,043 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 393 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:48,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 11:00:48,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-03-03 11:00:48,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1844. [2025-03-03 11:00:48,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1843 states have (on average 1.3836136733586544) internal successors, (2550), 1843 states have internal predecessors, (2550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:48,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 2550 transitions. [2025-03-03 11:00:48,082 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 2550 transitions. Word has length 83 [2025-03-03 11:00:48,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:48,082 INFO L471 AbstractCegarLoop]: Abstraction has 1844 states and 2550 transitions. [2025-03-03 11:00:48,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:48,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2550 transitions. [2025-03-03 11:00:48,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 11:00:48,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:48,088 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:00:48,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 11:00:48,088 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:48,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:48,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1163282277, now seen corresponding path program 1 times [2025-03-03 11:00:48,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:48,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724370469] [2025-03-03 11:00:48,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:48,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:48,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 11:00:48,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 11:00:48,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:48,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:48,424 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:00:48,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:48,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724370469] [2025-03-03 11:00:48,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724370469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:48,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:48,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:00:48,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592883128] [2025-03-03 11:00:48,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:48,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:00:48,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:48,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:00:48,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:48,430 INFO L87 Difference]: Start difference. First operand 1844 states and 2550 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:50,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:50,179 INFO L93 Difference]: Finished difference Result 4546 states and 6595 transitions. [2025-03-03 11:00:50,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:00:50,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-03-03 11:00:50,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:50,189 INFO L225 Difference]: With dead ends: 4546 [2025-03-03 11:00:50,189 INFO L226 Difference]: Without dead ends: 2704 [2025-03-03 11:00:50,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:50,196 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 500 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:50,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 817 Invalid, 1633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 11:00:50,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2025-03-03 11:00:50,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2704. [2025-03-03 11:00:50,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2704 states, 2703 states have (on average 1.38771735109138) internal successors, (3751), 2703 states have internal predecessors, (3751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:50,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 3751 transitions. [2025-03-03 11:00:50,233 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 3751 transitions. Word has length 166 [2025-03-03 11:00:50,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:50,235 INFO L471 AbstractCegarLoop]: Abstraction has 2704 states and 3751 transitions. [2025-03-03 11:00:50,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:50,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 3751 transitions. [2025-03-03 11:00:50,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 11:00:50,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:50,239 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:00:50,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 11:00:50,239 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:50,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:50,240 INFO L85 PathProgramCache]: Analyzing trace with hash 818511788, now seen corresponding path program 1 times [2025-03-03 11:00:50,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:50,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26247635] [2025-03-03 11:00:50,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:50,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:50,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 11:00:50,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 11:00:50,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:50,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:50,370 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-03 11:00:50,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:50,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26247635] [2025-03-03 11:00:50,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26247635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:50,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:50,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:00:50,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75525763] [2025-03-03 11:00:50,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:50,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:00:50,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:50,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:00:50,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:50,373 INFO L87 Difference]: Start difference. First operand 2704 states and 3751 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:51,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:51,930 INFO L93 Difference]: Finished difference Result 7954 states and 11040 transitions. [2025-03-03 11:00:51,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:00:51,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 172 [2025-03-03 11:00:51,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:51,951 INFO L225 Difference]: With dead ends: 7954 [2025-03-03 11:00:51,951 INFO L226 Difference]: Without dead ends: 5252 [2025-03-03 11:00:51,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:51,957 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 430 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:51,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 546 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 11:00:51,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5252 states. [2025-03-03 11:00:52,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5252 to 4826. [2025-03-03 11:00:52,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4826 states, 4825 states have (on average 1.2652849740932643) internal successors, (6105), 4825 states have internal predecessors, (6105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:52,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4826 states to 4826 states and 6105 transitions. [2025-03-03 11:00:52,031 INFO L78 Accepts]: Start accepts. Automaton has 4826 states and 6105 transitions. Word has length 172 [2025-03-03 11:00:52,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:52,031 INFO L471 AbstractCegarLoop]: Abstraction has 4826 states and 6105 transitions. [2025-03-03 11:00:52,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:52,032 INFO L276 IsEmpty]: Start isEmpty. Operand 4826 states and 6105 transitions. [2025-03-03 11:00:52,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-03 11:00:52,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:52,033 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:00:52,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 11:00:52,034 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:52,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:52,034 INFO L85 PathProgramCache]: Analyzing trace with hash 210408134, now seen corresponding path program 1 times [2025-03-03 11:00:52,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:52,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722911541] [2025-03-03 11:00:52,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:52,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:52,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-03 11:00:52,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-03 11:00:52,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:52,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:52,160 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 11:00:52,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:52,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722911541] [2025-03-03 11:00:52,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722911541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:52,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:52,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:00:52,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603514970] [2025-03-03 11:00:52,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:52,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:00:52,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:52,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:00:52,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:52,162 INFO L87 Difference]: Start difference. First operand 4826 states and 6105 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:53,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:53,963 INFO L93 Difference]: Finished difference Result 13481 states and 17131 transitions. [2025-03-03 11:00:53,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:00:53,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 185 [2025-03-03 11:00:53,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:53,982 INFO L225 Difference]: With dead ends: 13481 [2025-03-03 11:00:53,983 INFO L226 Difference]: Without dead ends: 8657 [2025-03-03 11:00:53,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:53,989 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 466 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:53,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 483 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 1420 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 11:00:53,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8657 states. [2025-03-03 11:00:54,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8657 to 7378. [2025-03-03 11:00:54,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7378 states, 7377 states have (on average 1.2479327639962043) internal successors, (9206), 7377 states have internal predecessors, (9206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:54,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7378 states to 7378 states and 9206 transitions. [2025-03-03 11:00:54,091 INFO L78 Accepts]: Start accepts. Automaton has 7378 states and 9206 transitions. Word has length 185 [2025-03-03 11:00:54,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:54,091 INFO L471 AbstractCegarLoop]: Abstraction has 7378 states and 9206 transitions. [2025-03-03 11:00:54,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:54,091 INFO L276 IsEmpty]: Start isEmpty. Operand 7378 states and 9206 transitions. [2025-03-03 11:00:54,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-03 11:00:54,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:54,094 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:00:54,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 11:00:54,094 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:54,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:54,095 INFO L85 PathProgramCache]: Analyzing trace with hash -85065858, now seen corresponding path program 1 times [2025-03-03 11:00:54,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:54,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865118010] [2025-03-03 11:00:54,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:54,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:54,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-03 11:00:54,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-03 11:00:54,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:54,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:54,299 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 11:00:54,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:54,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865118010] [2025-03-03 11:00:54,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865118010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:54,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:54,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:00:54,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016611228] [2025-03-03 11:00:54,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:54,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:00:54,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:54,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:00:54,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:54,302 INFO L87 Difference]: Start difference. First operand 7378 states and 9206 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:56,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:56,129 INFO L93 Difference]: Finished difference Result 18607 states and 23435 transitions. [2025-03-03 11:00:56,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:00:56,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 234 [2025-03-03 11:00:56,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:56,153 INFO L225 Difference]: With dead ends: 18607 [2025-03-03 11:00:56,154 INFO L226 Difference]: Without dead ends: 10379 [2025-03-03 11:00:56,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:56,161 INFO L435 NwaCegarLoop]: 945 mSDtfsCounter, 482 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:56,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 1020 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 11:00:56,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10379 states. [2025-03-03 11:00:56,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10379 to 10371. [2025-03-03 11:00:56,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10371 states, 10370 states have (on average 1.2060752169720348) internal successors, (12507), 10370 states have internal predecessors, (12507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:56,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10371 states to 10371 states and 12507 transitions. [2025-03-03 11:00:56,284 INFO L78 Accepts]: Start accepts. Automaton has 10371 states and 12507 transitions. Word has length 234 [2025-03-03 11:00:56,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:56,284 INFO L471 AbstractCegarLoop]: Abstraction has 10371 states and 12507 transitions. [2025-03-03 11:00:56,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:56,284 INFO L276 IsEmpty]: Start isEmpty. Operand 10371 states and 12507 transitions. [2025-03-03 11:00:56,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-03-03 11:00:56,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:56,287 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:00:56,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 11:00:56,287 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:56,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:56,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1404426420, now seen corresponding path program 1 times [2025-03-03 11:00:56,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:56,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240743633] [2025-03-03 11:00:56,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:56,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:56,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-03 11:00:56,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-03 11:00:56,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:56,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:56,620 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 170 proven. 70 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 11:00:56,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:56,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240743633] [2025-03-03 11:00:56,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240743633] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:00:56,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675694280] [2025-03-03 11:00:56,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:56,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:00:56,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:00:56,623 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:00:56,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 11:00:56,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-03 11:00:56,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-03 11:00:56,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:56,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:56,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 11:00:56,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:00:56,904 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 170 proven. 70 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 11:00:56,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:00:57,184 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 11:00:57,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675694280] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 11:00:57,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 11:00:57,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-03 11:00:57,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476037427] [2025-03-03 11:00:57,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:57,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:00:57,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:57,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:00:57,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:00:57,186 INFO L87 Difference]: Start difference. First operand 10371 states and 12507 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:59,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:59,755 INFO L93 Difference]: Finished difference Result 32691 states and 39751 transitions. [2025-03-03 11:00:59,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:00:59,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 242 [2025-03-03 11:00:59,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:59,793 INFO L225 Difference]: With dead ends: 32691 [2025-03-03 11:00:59,794 INFO L226 Difference]: Without dead ends: 21461 [2025-03-03 11:00:59,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:00:59,807 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 903 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 2319 mSolverCounterSat, 852 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 3171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 852 IncrementalHoareTripleChecker+Valid, 2319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:59,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 157 Invalid, 3171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [852 Valid, 2319 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 11:00:59,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21461 states. [2025-03-03 11:01:00,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21461 to 21459. [2025-03-03 11:01:00,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21459 states, 21458 states have (on average 1.1587752819461272) internal successors, (24865), 21458 states have internal predecessors, (24865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:00,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21459 states to 21459 states and 24865 transitions. [2025-03-03 11:01:00,090 INFO L78 Accepts]: Start accepts. Automaton has 21459 states and 24865 transitions. Word has length 242 [2025-03-03 11:01:00,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:01:00,091 INFO L471 AbstractCegarLoop]: Abstraction has 21459 states and 24865 transitions. [2025-03-03 11:01:00,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:00,091 INFO L276 IsEmpty]: Start isEmpty. Operand 21459 states and 24865 transitions. [2025-03-03 11:01:00,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-03 11:01:00,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:01:00,095 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:01:00,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 11:01:00,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:01:00,296 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:01:00,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:01:00,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1944088914, now seen corresponding path program 1 times [2025-03-03 11:01:00,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:01:00,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303648973] [2025-03-03 11:01:00,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:01:00,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:01:00,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-03 11:01:00,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-03 11:01:00,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:01:00,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:01:00,520 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-03 11:01:00,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:01:00,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303648973] [2025-03-03 11:01:00,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303648973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:01:00,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:01:00,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:01:00,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063743583] [2025-03-03 11:01:00,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:01:00,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:01:00,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:01:00,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:01:00,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:01:00,522 INFO L87 Difference]: Start difference. First operand 21459 states and 24865 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:01,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:01:01,890 INFO L93 Difference]: Finished difference Result 47592 states and 55279 transitions. [2025-03-03 11:01:01,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:01:01,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 255 [2025-03-03 11:01:01,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:01:01,932 INFO L225 Difference]: With dead ends: 47592 [2025-03-03 11:01:01,932 INFO L226 Difference]: Without dead ends: 25708 [2025-03-03 11:01:01,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:01:01,952 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 371 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:01:01,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 860 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:01:01,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25708 states. [2025-03-03 11:01:02,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25708 to 25708. [2025-03-03 11:01:02,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25708 states, 25707 states have (on average 1.1349048897187537) internal successors, (29175), 25707 states have internal predecessors, (29175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:02,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25708 states to 25708 states and 29175 transitions. [2025-03-03 11:01:02,321 INFO L78 Accepts]: Start accepts. Automaton has 25708 states and 29175 transitions. Word has length 255 [2025-03-03 11:01:02,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:01:02,321 INFO L471 AbstractCegarLoop]: Abstraction has 25708 states and 29175 transitions. [2025-03-03 11:01:02,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:02,321 INFO L276 IsEmpty]: Start isEmpty. Operand 25708 states and 29175 transitions. [2025-03-03 11:01:02,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-03-03 11:01:02,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:01:02,325 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:01:02,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 11:01:02,326 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:01:02,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:01:02,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1421507702, now seen corresponding path program 1 times [2025-03-03 11:01:02,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:01:02,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729266871] [2025-03-03 11:01:02,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:01:02,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:01:02,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-03 11:01:02,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-03 11:01:02,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:01:02,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:01:02,631 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 311 proven. 73 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-03 11:01:02,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:01:02,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729266871] [2025-03-03 11:01:02,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729266871] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:01:02,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456606268] [2025-03-03 11:01:02,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:01:02,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:01:02,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:01:02,634 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:01:02,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 11:01:02,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-03 11:01:02,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-03 11:01:02,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:01:02,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:01:02,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 11:01:02,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:01:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 311 proven. 73 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-03 11:01:02,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:01:03,149 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-03 11:01:03,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456606268] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 11:01:03,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 11:01:03,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-03 11:01:03,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586112417] [2025-03-03 11:01:03,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:01:03,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:01:03,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:01:03,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:01:03,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:01:03,151 INFO L87 Difference]: Start difference. First operand 25708 states and 29175 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:05,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:01:05,498 INFO L93 Difference]: Finished difference Result 62499 states and 71199 transitions. [2025-03-03 11:01:05,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:01:05,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 316 [2025-03-03 11:01:05,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:01:05,549 INFO L225 Difference]: With dead ends: 62499 [2025-03-03 11:01:05,549 INFO L226 Difference]: Without dead ends: 36366 [2025-03-03 11:01:05,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 629 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:01:05,568 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 879 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 2306 mSolverCounterSat, 576 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 2882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 576 IncrementalHoareTripleChecker+Valid, 2306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:01:05,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 180 Invalid, 2882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [576 Valid, 2306 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 11:01:05,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36366 states. [2025-03-03 11:01:05,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36366 to 34238. [2025-03-03 11:01:05,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34238 states, 34237 states have (on average 1.1454566696848438) internal successors, (39217), 34237 states have internal predecessors, (39217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:05,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34238 states to 34238 states and 39217 transitions. [2025-03-03 11:01:05,856 INFO L78 Accepts]: Start accepts. Automaton has 34238 states and 39217 transitions. Word has length 316 [2025-03-03 11:01:05,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:01:05,857 INFO L471 AbstractCegarLoop]: Abstraction has 34238 states and 39217 transitions. [2025-03-03 11:01:05,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:05,857 INFO L276 IsEmpty]: Start isEmpty. Operand 34238 states and 39217 transitions. [2025-03-03 11:01:05,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-03-03 11:01:05,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:01:05,865 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:01:05,871 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 11:01:06,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-03 11:01:06,066 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:01:06,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:01:06,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1151606882, now seen corresponding path program 1 times [2025-03-03 11:01:06,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:01:06,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050745182] [2025-03-03 11:01:06,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:01:06,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:01:06,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-03-03 11:01:06,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-03-03 11:01:06,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:01:06,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:01:06,308 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2025-03-03 11:01:06,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:01:06,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050745182] [2025-03-03 11:01:06,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050745182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:01:06,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:01:06,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:01:06,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612224873] [2025-03-03 11:01:06,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:01:06,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:01:06,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:01:06,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:01:06,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:01:06,311 INFO L87 Difference]: Start difference. First operand 34238 states and 39217 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:07,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:01:07,867 INFO L93 Difference]: Finished difference Result 80388 states and 92354 transitions. [2025-03-03 11:01:07,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:01:07,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 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 439 [2025-03-03 11:01:07,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:01:07,922 INFO L225 Difference]: With dead ends: 80388 [2025-03-03 11:01:07,923 INFO L226 Difference]: Without dead ends: 45725 [2025-03-03 11:01:07,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:01:07,950 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 486 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:01:07,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 255 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 11:01:07,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45725 states. [2025-03-03 11:01:08,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45725 to 33771. [2025-03-03 11:01:08,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33771 states, 33770 states have (on average 1.1432928634883033) internal successors, (38609), 33770 states have internal predecessors, (38609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33771 states to 33771 states and 38609 transitions. [2025-03-03 11:01:08,344 INFO L78 Accepts]: Start accepts. Automaton has 33771 states and 38609 transitions. Word has length 439 [2025-03-03 11:01:08,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:01:08,345 INFO L471 AbstractCegarLoop]: Abstraction has 33771 states and 38609 transitions. [2025-03-03 11:01:08,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:08,345 INFO L276 IsEmpty]: Start isEmpty. Operand 33771 states and 38609 transitions. [2025-03-03 11:01:08,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2025-03-03 11:01:08,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:01:08,417 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 11:01:08,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 11:01:08,418 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:01:08,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:01:08,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1186931946, now seen corresponding path program 1 times [2025-03-03 11:01:08,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:01:08,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194828729] [2025-03-03 11:01:08,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:01:08,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:01:08,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-03-03 11:01:08,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-03-03 11:01:08,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:01:08,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:01:08,831 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 11:01:08,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:01:08,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194828729] [2025-03-03 11:01:08,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194828729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:01:08,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:01:08,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:01:08,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637960217] [2025-03-03 11:01:08,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:01:08,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:01:08,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:01:08,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:01:08,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:01:08,834 INFO L87 Difference]: Start difference. First operand 33771 states and 38609 transitions. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:10,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:01:10,342 INFO L93 Difference]: Finished difference Result 80766 states and 92383 transitions. [2025-03-03 11:01:10,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:01:10,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 451 [2025-03-03 11:01:10,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:01:10,387 INFO L225 Difference]: With dead ends: 80766 [2025-03-03 11:01:10,387 INFO L226 Difference]: Without dead ends: 43595 [2025-03-03 11:01:10,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:01:10,412 INFO L435 NwaCegarLoop]: 777 mSDtfsCounter, 372 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:01:10,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 846 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 11:01:10,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43595 states. [2025-03-03 11:01:10,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43595 to 38898. [2025-03-03 11:01:10,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38898 states, 38897 states have (on average 1.1182610484099031) internal successors, (43497), 38897 states have internal predecessors, (43497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:10,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38898 states to 38898 states and 43497 transitions. [2025-03-03 11:01:10,867 INFO L78 Accepts]: Start accepts. Automaton has 38898 states and 43497 transitions. Word has length 451 [2025-03-03 11:01:10,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:01:10,867 INFO L471 AbstractCegarLoop]: Abstraction has 38898 states and 43497 transitions. [2025-03-03 11:01:10,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:10,867 INFO L276 IsEmpty]: Start isEmpty. Operand 38898 states and 43497 transitions. [2025-03-03 11:01:10,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-03 11:01:10,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:01:10,873 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 11:01:10,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 11:01:10,873 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:01:10,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:01:10,873 INFO L85 PathProgramCache]: Analyzing trace with hash -869689265, now seen corresponding path program 1 times [2025-03-03 11:01:10,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:01:10,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594572601] [2025-03-03 11:01:10,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:01:10,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:01:10,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-03 11:01:10,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-03 11:01:10,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:01:10,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:01:11,386 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 300 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:01:11,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:01:11,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594572601] [2025-03-03 11:01:11,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594572601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:01:11,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48156693] [2025-03-03 11:01:11,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:01:11,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:01:11,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:01:11,389 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 11:01:11,391 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 11:01:11,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-03 11:01:11,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-03 11:01:11,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:01:11,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:01:11,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 11:01:11,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:01:11,933 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 218 proven. 82 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 11:01:11,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:01:12,630 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 218 proven. 82 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 11:01:12,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48156693] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 11:01:12,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 11:01:12,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-03-03 11:01:12,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062325634] [2025-03-03 11:01:12,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 11:01:12,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 11:01:12,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:01:12,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 11:01:12,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 11:01:12,632 INFO L87 Difference]: Start difference. First operand 38898 states and 43497 transitions. Second operand has 9 states, 9 states have (on average 119.88888888888889) internal successors, (1079), 9 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:21,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:01:21,656 INFO L93 Difference]: Finished difference Result 126790 states and 142783 transitions. [2025-03-03 11:01:21,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 11:01:21,657 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 119.88888888888889) internal successors, (1079), 9 states have internal predecessors, (1079), 0 states have call successors, (0), 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 453 [2025-03-03 11:01:21,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:01:21,762 INFO L225 Difference]: With dead ends: 126790 [2025-03-03 11:01:21,762 INFO L226 Difference]: Without dead ends: 85767 [2025-03-03 11:01:21,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 931 GetRequests, 913 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2025-03-03 11:01:21,780 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 8123 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 10244 mSolverCounterSat, 2828 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8123 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 13072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2828 IncrementalHoareTripleChecker+Valid, 10244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:01:21,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8123 Valid, 364 Invalid, 13072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2828 Valid, 10244 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2025-03-03 11:01:21,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85767 states. [2025-03-03 11:01:22,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85767 to 76353. [2025-03-03 11:01:22,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76353 states, 76352 states have (on average 1.120088537300922) internal successors, (85521), 76352 states have internal predecessors, (85521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:22,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76353 states to 76353 states and 85521 transitions. [2025-03-03 11:01:22,543 INFO L78 Accepts]: Start accepts. Automaton has 76353 states and 85521 transitions. Word has length 453 [2025-03-03 11:01:22,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:01:22,543 INFO L471 AbstractCegarLoop]: Abstraction has 76353 states and 85521 transitions. [2025-03-03 11:01:22,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 119.88888888888889) internal successors, (1079), 9 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:22,544 INFO L276 IsEmpty]: Start isEmpty. Operand 76353 states and 85521 transitions. [2025-03-03 11:01:22,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-03-03 11:01:22,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:01:22,661 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:01:22,668 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 11:01:22,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:01:22,862 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:01:22,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:01:22,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1255388750, now seen corresponding path program 1 times [2025-03-03 11:01:22,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:01:22,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222134677] [2025-03-03 11:01:22,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:01:22,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:01:22,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-03 11:01:22,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-03 11:01:22,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:01:22,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:01:23,213 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2025-03-03 11:01:23,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:01:23,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222134677] [2025-03-03 11:01:23,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222134677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:01:23,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:01:23,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:01:23,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386613097] [2025-03-03 11:01:23,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:01:23,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:01:23,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:01:23,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:01:23,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:01:23,214 INFO L87 Difference]: Start difference. First operand 76353 states and 85521 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:24,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:01:24,846 INFO L93 Difference]: Finished difference Result 168447 states and 188435 transitions. [2025-03-03 11:01:24,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:01:24,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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 462 [2025-03-03 11:01:24,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:01:24,960 INFO L225 Difference]: With dead ends: 168447 [2025-03-03 11:01:24,961 INFO L226 Difference]: Without dead ends: 88269 [2025-03-03 11:01:25,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:01:25,015 INFO L435 NwaCegarLoop]: 733 mSDtfsCounter, 447 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:01:25,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 792 Invalid, 1388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:01:25,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88269 states. [2025-03-03 11:01:25,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88269 to 76327. [2025-03-03 11:01:25,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76327 states, 76326 states have (on average 1.1068574273510992) internal successors, (84482), 76326 states have internal predecessors, (84482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:25,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76327 states to 76327 states and 84482 transitions. [2025-03-03 11:01:25,886 INFO L78 Accepts]: Start accepts. Automaton has 76327 states and 84482 transitions. Word has length 462 [2025-03-03 11:01:25,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:01:25,887 INFO L471 AbstractCegarLoop]: Abstraction has 76327 states and 84482 transitions. [2025-03-03 11:01:25,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:25,887 INFO L276 IsEmpty]: Start isEmpty. Operand 76327 states and 84482 transitions. [2025-03-03 11:01:25,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-03 11:01:25,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:01:25,893 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:01:25,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 11:01:25,893 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:01:25,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:01:25,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1885595799, now seen corresponding path program 1 times [2025-03-03 11:01:25,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:01:25,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132727493] [2025-03-03 11:01:25,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:01:25,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:01:25,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-03 11:01:25,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-03 11:01:25,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:01:25,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:01:26,609 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 261 proven. 82 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 11:01:26,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:01:26,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132727493] [2025-03-03 11:01:26,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132727493] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:01:26,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170433246] [2025-03-03 11:01:26,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:01:26,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:01:26,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:01:26,612 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 11:01:26,616 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 11:01:26,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-03 11:01:26,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-03 11:01:26,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:01:26,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:01:26,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 11:01:26,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:01:28,158 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 47 proven. 312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:01:28,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:01:30,369 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 11:01:30,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170433246] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 11:01:30,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 11:01:30,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 4] total 7 [2025-03-03 11:01:30,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227286051] [2025-03-03 11:01:30,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:01:30,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:01:30,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:01:30,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:01:30,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:01:30,371 INFO L87 Difference]: Start difference. First operand 76327 states and 84482 transitions. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:32,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:01:32,292 INFO L93 Difference]: Finished difference Result 164563 states and 181849 transitions. [2025-03-03 11:01:32,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:01:32,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 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 496 [2025-03-03 11:01:32,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:01:32,400 INFO L225 Difference]: With dead ends: 164563 [2025-03-03 11:01:32,400 INFO L226 Difference]: Without dead ends: 88663 [2025-03-03 11:01:32,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 993 GetRequests, 988 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:01:32,452 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 230 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:01:32,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 205 Invalid, 1501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 11:01:32,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88663 states. [2025-03-03 11:01:33,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88663 to 79729. [2025-03-03 11:01:33,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79729 states, 79728 states have (on average 1.1073148705599036) internal successors, (88284), 79728 states have internal predecessors, (88284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:33,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79729 states to 79729 states and 88284 transitions. [2025-03-03 11:01:33,642 INFO L78 Accepts]: Start accepts. Automaton has 79729 states and 88284 transitions. Word has length 496 [2025-03-03 11:01:33,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:01:33,642 INFO L471 AbstractCegarLoop]: Abstraction has 79729 states and 88284 transitions. [2025-03-03 11:01:33,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:33,642 INFO L276 IsEmpty]: Start isEmpty. Operand 79729 states and 88284 transitions. [2025-03-03 11:01:33,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2025-03-03 11:01:33,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:01:33,657 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:01:33,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 11:01:33,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:01:33,857 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:01:33,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:01:33,858 INFO L85 PathProgramCache]: Analyzing trace with hash -930046374, now seen corresponding path program 1 times [2025-03-03 11:01:33,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:01:33,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136328757] [2025-03-03 11:01:33,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:01:33,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:01:33,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 585 statements into 1 equivalence classes. [2025-03-03 11:01:33,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 585 of 585 statements. [2025-03-03 11:01:33,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:01:33,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:01:34,245 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-03 11:01:34,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:01:34,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136328757] [2025-03-03 11:01:34,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136328757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:01:34,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:01:34,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:01:34,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005785214] [2025-03-03 11:01:34,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:01:34,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:01:34,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:01:34,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:01:34,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:01:34,247 INFO L87 Difference]: Start difference. First operand 79729 states and 88284 transitions. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:35,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:01:35,693 INFO L93 Difference]: Finished difference Result 158171 states and 175203 transitions. [2025-03-03 11:01:35,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:01:35,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 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 585 [2025-03-03 11:01:35,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:01:35,778 INFO L225 Difference]: With dead ends: 158171 [2025-03-03 11:01:35,778 INFO L226 Difference]: Without dead ends: 78869 [2025-03-03 11:01:35,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:01:35,821 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 481 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:01:35,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 719 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:01:35,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78869 states. [2025-03-03 11:01:36,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78869 to 77166. [2025-03-03 11:01:36,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77166 states, 77165 states have (on average 1.0837555886736214) internal successors, (83628), 77165 states have internal predecessors, (83628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77166 states to 77166 states and 83628 transitions. [2025-03-03 11:01:36,674 INFO L78 Accepts]: Start accepts. Automaton has 77166 states and 83628 transitions. Word has length 585 [2025-03-03 11:01:36,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:01:36,675 INFO L471 AbstractCegarLoop]: Abstraction has 77166 states and 83628 transitions. [2025-03-03 11:01:36,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:36,675 INFO L276 IsEmpty]: Start isEmpty. Operand 77166 states and 83628 transitions. [2025-03-03 11:01:36,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2025-03-03 11:01:36,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:01:36,686 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:01:36,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 11:01:36,686 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:01:36,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:01:36,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1668066818, now seen corresponding path program 1 times [2025-03-03 11:01:36,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:01:36,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355662658] [2025-03-03 11:01:36,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:01:36,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:01:36,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 604 statements into 1 equivalence classes. [2025-03-03 11:01:36,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 604 of 604 statements. [2025-03-03 11:01:36,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:01:36,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:01:36,847 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 357 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-03-03 11:01:36,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:01:36,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355662658] [2025-03-03 11:01:36,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355662658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:01:36,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:01:36,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:01:36,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38738897] [2025-03-03 11:01:36,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:01:36,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:01:36,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:01:36,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:01:36,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:01:36,849 INFO L87 Difference]: Start difference. First operand 77166 states and 83628 transitions. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:38,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:01:38,501 INFO L93 Difference]: Finished difference Result 159859 states and 173116 transitions. [2025-03-03 11:01:38,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:01:38,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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 604 [2025-03-03 11:01:38,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:01:38,591 INFO L225 Difference]: With dead ends: 159859 [2025-03-03 11:01:38,591 INFO L226 Difference]: Without dead ends: 80994 [2025-03-03 11:01:38,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:01:38,636 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 495 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:01:38,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 693 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 11:01:38,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80994 states. [2025-03-03 11:01:39,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80994 to 78437. [2025-03-03 11:01:39,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78437 states, 78436 states have (on average 1.074289866897853) internal successors, (84263), 78436 states have internal predecessors, (84263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:39,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78437 states to 78437 states and 84263 transitions. [2025-03-03 11:01:39,537 INFO L78 Accepts]: Start accepts. Automaton has 78437 states and 84263 transitions. Word has length 604 [2025-03-03 11:01:39,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:01:39,538 INFO L471 AbstractCegarLoop]: Abstraction has 78437 states and 84263 transitions. [2025-03-03 11:01:39,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:39,538 INFO L276 IsEmpty]: Start isEmpty. Operand 78437 states and 84263 transitions. [2025-03-03 11:01:39,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2025-03-03 11:01:39,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:01:39,553 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:01:39,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 11:01:39,553 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:01:39,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:01:39,553 INFO L85 PathProgramCache]: Analyzing trace with hash 919276566, now seen corresponding path program 1 times [2025-03-03 11:01:39,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:01:39,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522307720] [2025-03-03 11:01:39,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:01:39,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:01:39,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-03-03 11:01:39,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-03-03 11:01:39,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:01:39,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:01:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 360 proven. 82 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 11:01:40,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:01:40,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522307720] [2025-03-03 11:01:40,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522307720] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:01:40,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370720826] [2025-03-03 11:01:40,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:01:40,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:01:40,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:01:40,394 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 11:01:40,394 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 11:01:40,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-03-03 11:01:40,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-03-03 11:01:40,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:01:40,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:01:40,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 11:01:40,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:01:41,665 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 360 proven. 82 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 11:01:41,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:01:44,153 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 360 proven. 82 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 11:01:44,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370720826] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 11:01:44,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 11:01:44,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-03-03 11:01:44,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425931069] [2025-03-03 11:01:44,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 11:01:44,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 11:01:44,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:01:44,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 11:01:44,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-03 11:01:44,158 INFO L87 Difference]: Start difference. First operand 78437 states and 84263 transitions. Second operand has 8 states, 8 states have (on average 180.125) internal successors, (1441), 7 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:48,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:01:48,799 INFO L93 Difference]: Finished difference Result 173468 states and 186118 transitions. [2025-03-03 11:01:48,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 11:01:48,799 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 180.125) internal successors, (1441), 7 states have internal predecessors, (1441), 0 states have call successors, (0), 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 662 [2025-03-03 11:01:48,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:01:48,899 INFO L225 Difference]: With dead ends: 173468 [2025-03-03 11:01:48,900 INFO L226 Difference]: Without dead ends: 95458 [2025-03-03 11:01:48,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1326 GetRequests, 1319 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-03-03 11:01:48,946 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 1754 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 5871 mSolverCounterSat, 1142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1754 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 7013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1142 IncrementalHoareTripleChecker+Valid, 5871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:01:48,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1754 Valid, 349 Invalid, 7013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1142 Valid, 5871 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-03 11:01:49,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95458 states. [2025-03-03 11:01:49,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95458 to 86507. [2025-03-03 11:01:49,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86507 states, 86506 states have (on average 1.068920074908099) internal successors, (92468), 86506 states have internal predecessors, (92468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:49,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86507 states to 86507 states and 92468 transitions. [2025-03-03 11:01:49,897 INFO L78 Accepts]: Start accepts. Automaton has 86507 states and 92468 transitions. Word has length 662 [2025-03-03 11:01:49,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:01:49,897 INFO L471 AbstractCegarLoop]: Abstraction has 86507 states and 92468 transitions. [2025-03-03 11:01:49,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 180.125) internal successors, (1441), 7 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:49,898 INFO L276 IsEmpty]: Start isEmpty. Operand 86507 states and 92468 transitions. [2025-03-03 11:01:49,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2025-03-03 11:01:49,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:01:49,909 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:01:49,914 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 11:01:50,109 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,SelfDestructingSolverStorable16 [2025-03-03 11:01:50,109 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:01:50,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:01:50,110 INFO L85 PathProgramCache]: Analyzing trace with hash 918897944, now seen corresponding path program 1 times [2025-03-03 11:01:50,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:01:50,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759879231] [2025-03-03 11:01:50,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:01:50,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:01:50,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-03-03 11:01:50,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-03-03 11:01:50,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:01:50,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:01:50,603 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-03 11:01:50,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:01:50,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759879231] [2025-03-03 11:01:50,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759879231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:01:50,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:01:50,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:01:50,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458039378] [2025-03-03 11:01:50,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:01:50,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:01:50,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:01:50,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:01:50,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:01:50,604 INFO L87 Difference]: Start difference. First operand 86507 states and 92468 transitions. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:51,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:01:51,918 INFO L93 Difference]: Finished difference Result 180245 states and 192615 transitions. [2025-03-03 11:01:51,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:01:51,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 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 671 [2025-03-03 11:01:51,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:01:52,006 INFO L225 Difference]: With dead ends: 180245 [2025-03-03 11:01:52,006 INFO L226 Difference]: Without dead ends: 94165 [2025-03-03 11:01:52,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:01:52,042 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 225 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:01:52,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 339 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 11:01:52,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94165 states. [2025-03-03 11:01:52,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94165 to 90332. [2025-03-03 11:01:52,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90332 states, 90331 states have (on average 1.0655921001649489) internal successors, (96256), 90331 states have internal predecessors, (96256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:52,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90332 states to 90332 states and 96256 transitions. [2025-03-03 11:01:52,889 INFO L78 Accepts]: Start accepts. Automaton has 90332 states and 96256 transitions. Word has length 671 [2025-03-03 11:01:52,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:01:52,889 INFO L471 AbstractCegarLoop]: Abstraction has 90332 states and 96256 transitions. [2025-03-03 11:01:52,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:52,890 INFO L276 IsEmpty]: Start isEmpty. Operand 90332 states and 96256 transitions. [2025-03-03 11:01:52,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2025-03-03 11:01:52,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:01:52,901 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:01:52,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 11:01:52,902 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:01:52,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:01:52,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1253501152, now seen corresponding path program 1 times [2025-03-03 11:01:52,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:01:52,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106820184] [2025-03-03 11:01:52,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:01:52,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:01:52,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 679 statements into 1 equivalence classes. [2025-03-03 11:01:52,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 679 of 679 statements. [2025-03-03 11:01:52,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:01:52,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:01:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-03 11:01:53,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:01:53,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106820184] [2025-03-03 11:01:53,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106820184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:01:53,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:01:53,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:01:53,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631466503] [2025-03-03 11:01:53,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:01:53,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:01:53,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:01:53,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:01:53,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:01:53,336 INFO L87 Difference]: Start difference. First operand 90332 states and 96256 transitions. Second operand has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:01:55,738 INFO L93 Difference]: Finished difference Result 200267 states and 213088 transitions. [2025-03-03 11:01:55,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:01:55,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 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 679 [2025-03-03 11:01:55,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:01:55,851 INFO L225 Difference]: With dead ends: 200267 [2025-03-03 11:01:55,851 INFO L226 Difference]: Without dead ends: 106958 [2025-03-03 11:01:55,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:01:55,909 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 680 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 2517 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 2835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 2517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:01:55,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 263 Invalid, 2835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 2517 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 11:01:55,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106958 states. [2025-03-03 11:01:57,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106958 to 99271. [2025-03-03 11:01:57,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99271 states, 99270 states have (on average 1.0656794600584265) internal successors, (105790), 99270 states have internal predecessors, (105790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99271 states to 99271 states and 105790 transitions. [2025-03-03 11:01:57,272 INFO L78 Accepts]: Start accepts. Automaton has 99271 states and 105790 transitions. Word has length 679 [2025-03-03 11:01:57,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:01:57,273 INFO L471 AbstractCegarLoop]: Abstraction has 99271 states and 105790 transitions. [2025-03-03 11:01:57,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:57,273 INFO L276 IsEmpty]: Start isEmpty. Operand 99271 states and 105790 transitions. [2025-03-03 11:01:57,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2025-03-03 11:01:57,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:01:57,293 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:01:57,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 11:01:57,293 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:01:57,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:01:57,293 INFO L85 PathProgramCache]: Analyzing trace with hash 610099675, now seen corresponding path program 1 times [2025-03-03 11:01:57,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:01:57,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976015459] [2025-03-03 11:01:57,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:01:57,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:01:57,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 684 statements into 1 equivalence classes. [2025-03-03 11:01:57,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 684 of 684 statements. [2025-03-03 11:01:57,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:01:57,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:01:58,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1011 backedges. 830 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-03-03 11:01:58,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:01:58,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976015459] [2025-03-03 11:01:58,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976015459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:01:58,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:01:58,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:01:58,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352016354] [2025-03-03 11:01:58,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:01:58,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:01:58,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:01:58,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:01:58,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:01:58,053 INFO L87 Difference]: Start difference. First operand 99271 states and 105790 transitions. Second operand has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:59,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:01:59,758 INFO L93 Difference]: Finished difference Result 201515 states and 214659 transitions. [2025-03-03 11:01:59,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:01:59,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 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 684 [2025-03-03 11:01:59,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:01:59,864 INFO L225 Difference]: With dead ends: 201515 [2025-03-03 11:01:59,864 INFO L226 Difference]: Without dead ends: 102246 [2025-03-03 11:01:59,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:01:59,910 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 826 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2037 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 2145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:01:59,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 733 Invalid, 2145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2037 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:01:59,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102246 states. [2025-03-03 11:02:00,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102246 to 101396. [2025-03-03 11:02:01,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101396 states, 101395 states have (on average 1.0646876078702106) internal successors, (107954), 101395 states have internal predecessors, (107954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:01,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101396 states to 101396 states and 107954 transitions. [2025-03-03 11:02:01,099 INFO L78 Accepts]: Start accepts. Automaton has 101396 states and 107954 transitions. Word has length 684 [2025-03-03 11:02:01,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:01,099 INFO L471 AbstractCegarLoop]: Abstraction has 101396 states and 107954 transitions. [2025-03-03 11:02:01,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:01,100 INFO L276 IsEmpty]: Start isEmpty. Operand 101396 states and 107954 transitions. [2025-03-03 11:02:01,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-03-03 11:02:01,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:01,112 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:01,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 11:02:01,112 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:01,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:01,113 INFO L85 PathProgramCache]: Analyzing trace with hash 2097289303, now seen corresponding path program 1 times [2025-03-03 11:02:01,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:01,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178611814] [2025-03-03 11:02:01,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:01,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:01,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-03-03 11:02:01,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-03-03 11:02:01,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:01,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:01,580 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 622 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-03 11:02:01,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:01,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178611814] [2025-03-03 11:02:01,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178611814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:01,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:01,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:01,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731083743] [2025-03-03 11:02:01,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:01,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:01,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:01,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:01,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:01,582 INFO L87 Difference]: Start difference. First operand 101396 states and 107954 transitions. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)