./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/seq-mthreaded/pals_lcr.6_overflow.ufo.UNBOUNDED.pals.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 2e89791a2e8bde62b11f5e3f45edc8f6b1d8831a0e105552a6da22a3ff44c454 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:11:05,776 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:11:05,835 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:11:05,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:11:05,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:11:05,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:11:05,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:11:05,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:11:05,864 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:11:05,864 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:11:05,864 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:11:05,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:11:05,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:11:05,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:11:05,865 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:11:05,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:11:05,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:11:05,866 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:11:05,866 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:11:05,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:11:05,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:11:05,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:11:05,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:11:05,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:11:05,867 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:11:05,867 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:11:05,867 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:11:05,867 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:11:05,867 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:11:05,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:11:05,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:11:05,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:11:05,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:11:05,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:11:05,868 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:11:05,868 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:11:05,868 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:11:05,868 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:11:05,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:11:05,868 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:11:05,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:11:05,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:11:05,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:11:05,868 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 -> 2e89791a2e8bde62b11f5e3f45edc8f6b1d8831a0e105552a6da22a3ff44c454 [2025-03-16 19:11:06,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:11:06,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:11:06,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:11:06,092 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:11:06,092 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:11:06,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c [2025-03-16 19:11:07,273 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a94ad349/0cb761c4840148ae91c3b4b18af6d8ea/FLAGc51f49d64 [2025-03-16 19:11:07,516 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:11:07,517 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c [2025-03-16 19:11:07,527 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a94ad349/0cb761c4840148ae91c3b4b18af6d8ea/FLAGc51f49d64 [2025-03-16 19:11:07,848 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a94ad349/0cb761c4840148ae91c3b4b18af6d8ea [2025-03-16 19:11:07,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:11:07,851 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:11:07,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:11:07,852 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:11:07,855 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:11:07,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:11:07" (1/1) ... [2025-03-16 19:11:07,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4beb904e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:11:07, skipping insertion in model container [2025-03-16 19:11:07,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:11:07" (1/1) ... [2025-03-16 19:11:07,873 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:11:08,010 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/seq-mthreaded/pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c[15177,15190] [2025-03-16 19:11:08,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:11:08,024 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:11:08,059 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/seq-mthreaded/pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c[15177,15190] [2025-03-16 19:11:08,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:11:08,069 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:11:08,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:11:08 WrapperNode [2025-03-16 19:11:08,073 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:11:08,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:11:08,074 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:11:08,074 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:11:08,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:11:08" (1/1) ... [2025-03-16 19:11:08,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:11:08" (1/1) ... [2025-03-16 19:11:08,102 INFO L138 Inliner]: procedures = 26, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 391 [2025-03-16 19:11:08,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:11:08,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:11:08,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:11:08,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:11:08,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:11:08" (1/1) ... [2025-03-16 19:11:08,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:11:08" (1/1) ... [2025-03-16 19:11:08,111 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:11:08" (1/1) ... [2025-03-16 19:11:08,123 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-16 19:11:08,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:11:08" (1/1) ... [2025-03-16 19:11:08,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:11:08" (1/1) ... [2025-03-16 19:11:08,128 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:11:08" (1/1) ... [2025-03-16 19:11:08,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:11:08" (1/1) ... [2025-03-16 19:11:08,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:11:08" (1/1) ... [2025-03-16 19:11:08,130 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:11:08" (1/1) ... [2025-03-16 19:11:08,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:11:08,132 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:11:08,132 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:11:08,132 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:11:08,133 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:11:08" (1/1) ... [2025-03-16 19:11:08,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:11:08,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:11:08,159 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-16 19:11:08,164 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-16 19:11:08,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:11:08,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:11:08,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:11:08,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:11:08,255 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:11:08,256 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:11:08,542 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-03-16 19:11:08,542 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:11:08,549 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:11:08,550 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:11:08,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:11:08 BoogieIcfgContainer [2025-03-16 19:11:08,550 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:11:08,552 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:11:08,552 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:11:08,555 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:11:08,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:11:07" (1/3) ... [2025-03-16 19:11:08,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b304315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:11:08, skipping insertion in model container [2025-03-16 19:11:08,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:11:08" (2/3) ... [2025-03-16 19:11:08,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b304315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:11:08, skipping insertion in model container [2025-03-16 19:11:08,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:11:08" (3/3) ... [2025-03-16 19:11:08,558 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c [2025-03-16 19:11:08,569 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:11:08,572 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c that has 1 procedures, 93 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 19:11:08,615 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:11:08,627 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;@5af638de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:11:08,627 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:11:08,630 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 91 states have (on average 1.8021978021978022) internal successors, (164), 92 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:08,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-16 19:11:08,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:08,635 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:11:08,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:08,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:08,640 INFO L85 PathProgramCache]: Analyzing trace with hash -399633989, now seen corresponding path program 1 times [2025-03-16 19:11:08,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:08,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245980270] [2025-03-16 19:11:08,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:08,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:08,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 19:11:08,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 19:11:08,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:08,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:08,837 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-16 19:11:08,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:08,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245980270] [2025-03-16 19:11:08,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245980270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:08,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:08,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 19:11:08,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548683220] [2025-03-16 19:11:08,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:08,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 19:11:08,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:08,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 19:11:08,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 19:11:08,857 INFO L87 Difference]: Start difference. First operand has 93 states, 91 states have (on average 1.8021978021978022) internal successors, (164), 92 states have internal predecessors, (164), 0 states have call successors, (0), 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 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:08,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:08,872 INFO L93 Difference]: Finished difference Result 141 states and 243 transitions. [2025-03-16 19:11:08,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 19:11:08,873 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-03-16 19:11:08,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:08,878 INFO L225 Difference]: With dead ends: 141 [2025-03-16 19:11:08,878 INFO L226 Difference]: Without dead ends: 91 [2025-03-16 19:11:08,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 19:11:08,881 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:08,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:08,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-16 19:11:08,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-16 19:11:08,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.7777777777777777) internal successors, (160), 90 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 160 transitions. [2025-03-16 19:11:08,910 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 160 transitions. Word has length 22 [2025-03-16 19:11:08,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:08,910 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 160 transitions. [2025-03-16 19:11:08,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:08,910 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 160 transitions. [2025-03-16 19:11:08,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-16 19:11:08,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:08,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:11:08,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:11:08,911 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:08,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:08,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1244105860, now seen corresponding path program 1 times [2025-03-16 19:11:08,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:08,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073400448] [2025-03-16 19:11:08,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:08,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:08,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 19:11:09,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 19:11:09,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:09,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:09,212 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-16 19:11:09,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:09,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073400448] [2025-03-16 19:11:09,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073400448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:09,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:09,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:11:09,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143435571] [2025-03-16 19:11:09,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:09,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:11:09,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:09,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:11:09,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:11:09,215 INFO L87 Difference]: Start difference. First operand 91 states and 160 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:09,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:09,295 INFO L93 Difference]: Finished difference Result 141 states and 239 transitions. [2025-03-16 19:11:09,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:11:09,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-03-16 19:11:09,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:09,298 INFO L225 Difference]: With dead ends: 141 [2025-03-16 19:11:09,298 INFO L226 Difference]: Without dead ends: 91 [2025-03-16 19:11:09,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:11:09,299 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:09,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:11:09,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-16 19:11:09,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-16 19:11:09,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:09,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 120 transitions. [2025-03-16 19:11:09,303 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 120 transitions. Word has length 22 [2025-03-16 19:11:09,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:09,303 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 120 transitions. [2025-03-16 19:11:09,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:09,303 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2025-03-16 19:11:09,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 19:11:09,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:09,304 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:11:09,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:11:09,305 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:09,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:09,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1349400054, now seen corresponding path program 1 times [2025-03-16 19:11:09,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:09,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252012908] [2025-03-16 19:11:09,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:09,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:09,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 19:11:09,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 19:11:09,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:09,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:09,524 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-16 19:11:09,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:09,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252012908] [2025-03-16 19:11:09,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252012908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:09,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:09,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:11:09,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098142568] [2025-03-16 19:11:09,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:09,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:11:09,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:09,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:11:09,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:11:09,527 INFO L87 Difference]: Start difference. First operand 91 states and 120 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:09,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:09,841 INFO L93 Difference]: Finished difference Result 655 states and 1032 transitions. [2025-03-16 19:11:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:11:09,842 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-03-16 19:11:09,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:09,847 INFO L225 Difference]: With dead ends: 655 [2025-03-16 19:11:09,847 INFO L226 Difference]: Without dead ends: 608 [2025-03-16 19:11:09,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:11:09,848 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 984 mSDsluCounter, 2396 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 2512 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:09,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [984 Valid, 2512 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:11:09,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-03-16 19:11:09,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 136. [2025-03-16 19:11:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.4296296296296296) internal successors, (193), 135 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:09,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 193 transitions. [2025-03-16 19:11:09,861 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 193 transitions. Word has length 61 [2025-03-16 19:11:09,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:09,862 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 193 transitions. [2025-03-16 19:11:09,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:09,862 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 193 transitions. [2025-03-16 19:11:09,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:11:09,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:09,863 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:11:09,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:11:09,863 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:09,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:09,864 INFO L85 PathProgramCache]: Analyzing trace with hash -270532005, now seen corresponding path program 1 times [2025-03-16 19:11:09,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:09,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39399840] [2025-03-16 19:11:09,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:09,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:09,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:11:09,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:11:09,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:09,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:09,969 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-16 19:11:09,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:09,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39399840] [2025-03-16 19:11:09,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39399840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:09,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:09,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:11:09,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534885727] [2025-03-16 19:11:09,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:09,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:11:09,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:09,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:11:09,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:11:09,972 INFO L87 Difference]: Start difference. First operand 136 states and 193 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:09,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:09,990 INFO L93 Difference]: Finished difference Result 309 states and 472 transitions. [2025-03-16 19:11:09,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:11:09,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-03-16 19:11:09,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:09,993 INFO L225 Difference]: With dead ends: 309 [2025-03-16 19:11:09,993 INFO L226 Difference]: Without dead ends: 217 [2025-03-16 19:11:09,993 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-16 19:11:09,994 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 50 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:09,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 189 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:09,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-16 19:11:10,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2025-03-16 19:11:10,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.4906542056074767) internal successors, (319), 214 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:10,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 319 transitions. [2025-03-16 19:11:10,011 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 319 transitions. Word has length 63 [2025-03-16 19:11:10,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:10,011 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 319 transitions. [2025-03-16 19:11:10,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:10,011 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 319 transitions. [2025-03-16 19:11:10,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:11:10,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:10,013 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:11:10,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:11:10,013 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:10,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:10,013 INFO L85 PathProgramCache]: Analyzing trace with hash -269489320, now seen corresponding path program 1 times [2025-03-16 19:11:10,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:10,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497094480] [2025-03-16 19:11:10,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:10,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:10,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:11:10,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:11:10,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:10,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:10,366 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-16 19:11:10,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:10,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497094480] [2025-03-16 19:11:10,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497094480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:10,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:10,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:11:10,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558834592] [2025-03-16 19:11:10,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:10,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:11:10,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:10,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:11:10,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:11:10,369 INFO L87 Difference]: Start difference. First operand 215 states and 319 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:10,583 INFO L93 Difference]: Finished difference Result 388 states and 595 transitions. [2025-03-16 19:11:10,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:11:10,584 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-03-16 19:11:10,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:10,586 INFO L225 Difference]: With dead ends: 388 [2025-03-16 19:11:10,586 INFO L226 Difference]: Without dead ends: 217 [2025-03-16 19:11:10,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:11:10,588 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 144 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:10,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 481 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:11:10,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-16 19:11:10,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2025-03-16 19:11:10,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.4813084112149533) internal successors, (317), 214 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:10,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 317 transitions. [2025-03-16 19:11:10,608 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 317 transitions. Word has length 63 [2025-03-16 19:11:10,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:10,609 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 317 transitions. [2025-03-16 19:11:10,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:10,609 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 317 transitions. [2025-03-16 19:11:10,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 19:11:10,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:10,612 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:11:10,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:11:10,612 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:10,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:10,612 INFO L85 PathProgramCache]: Analyzing trace with hash 236750731, now seen corresponding path program 1 times [2025-03-16 19:11:10,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:10,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834507071] [2025-03-16 19:11:10,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:10,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:10,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 19:11:10,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 19:11:10,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:10,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:10,810 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-16 19:11:10,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:10,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834507071] [2025-03-16 19:11:10,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834507071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:10,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:10,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:11:10,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051577173] [2025-03-16 19:11:10,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:10,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:11:10,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:10,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:11:10,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:11:10,814 INFO L87 Difference]: Start difference. First operand 215 states and 317 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:10,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:10,834 INFO L93 Difference]: Finished difference Result 221 states and 324 transitions. [2025-03-16 19:11:10,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:11:10,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-16 19:11:10,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:10,836 INFO L225 Difference]: With dead ends: 221 [2025-03-16 19:11:10,836 INFO L226 Difference]: Without dead ends: 219 [2025-03-16 19:11:10,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:11:10,837 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:10,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 346 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:10,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-16 19:11:10,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-03-16 19:11:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.4678899082568808) internal successors, (320), 218 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:10,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 320 transitions. [2025-03-16 19:11:10,848 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 320 transitions. Word has length 64 [2025-03-16 19:11:10,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:10,848 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 320 transitions. [2025-03-16 19:11:10,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:10,848 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 320 transitions. [2025-03-16 19:11:10,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:11:10,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:10,849 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:11:10,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:11:10,849 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:10,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:10,850 INFO L85 PathProgramCache]: Analyzing trace with hash -416102, now seen corresponding path program 1 times [2025-03-16 19:11:10,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:10,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305067889] [2025-03-16 19:11:10,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:10,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:10,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:11:10,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:11:10,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:10,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:10,904 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-16 19:11:10,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:10,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305067889] [2025-03-16 19:11:10,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305067889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:10,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:10,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:11:10,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838319742] [2025-03-16 19:11:10,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:10,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:11:10,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:10,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:11:10,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:11:10,905 INFO L87 Difference]: Start difference. First operand 219 states and 320 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:10,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:10,918 INFO L93 Difference]: Finished difference Result 405 states and 613 transitions. [2025-03-16 19:11:10,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:11:10,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-16 19:11:10,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:10,920 INFO L225 Difference]: With dead ends: 405 [2025-03-16 19:11:10,920 INFO L226 Difference]: Without dead ends: 309 [2025-03-16 19:11:10,920 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-16 19:11:10,920 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 66 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:10,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 258 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:10,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-03-16 19:11:10,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2025-03-16 19:11:10,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.4934640522875817) internal successors, (457), 306 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:10,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 457 transitions. [2025-03-16 19:11:10,929 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 457 transitions. Word has length 65 [2025-03-16 19:11:10,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:10,929 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 457 transitions. [2025-03-16 19:11:10,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:10,929 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 457 transitions. [2025-03-16 19:11:10,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:11:10,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:10,930 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:11:10,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:11:10,930 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:10,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:10,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1281259110, now seen corresponding path program 1 times [2025-03-16 19:11:10,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:10,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398405539] [2025-03-16 19:11:10,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:10,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:10,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:11:10,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:11:10,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:10,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:10,995 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-16 19:11:10,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:10,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398405539] [2025-03-16 19:11:10,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398405539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:10,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:10,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:11:10,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205709768] [2025-03-16 19:11:10,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:10,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:11:10,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:10,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:11:10,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:11:10,996 INFO L87 Difference]: Start difference. First operand 307 states and 457 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:11,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:11,012 INFO L93 Difference]: Finished difference Result 805 states and 1237 transitions. [2025-03-16 19:11:11,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:11:11,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-16 19:11:11,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:11,014 INFO L225 Difference]: With dead ends: 805 [2025-03-16 19:11:11,014 INFO L226 Difference]: Without dead ends: 544 [2025-03-16 19:11:11,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-16 19:11:11,015 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 64 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:11,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 264 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:11,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-03-16 19:11:11,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 542. [2025-03-16 19:11:11,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 1.5138632162661738) internal successors, (819), 541 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:11,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 819 transitions. [2025-03-16 19:11:11,026 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 819 transitions. Word has length 65 [2025-03-16 19:11:11,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:11,026 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 819 transitions. [2025-03-16 19:11:11,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:11,027 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 819 transitions. [2025-03-16 19:11:11,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:11:11,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:11,027 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:11:11,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:11:11,027 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:11,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:11,028 INFO L85 PathProgramCache]: Analyzing trace with hash -437900134, now seen corresponding path program 1 times [2025-03-16 19:11:11,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:11,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423646814] [2025-03-16 19:11:11,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:11,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:11,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:11:11,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:11:11,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:11,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:11,073 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-16 19:11:11,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:11,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423646814] [2025-03-16 19:11:11,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423646814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:11,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:11,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:11:11,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76668636] [2025-03-16 19:11:11,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:11,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:11:11,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:11,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:11:11,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:11:11,074 INFO L87 Difference]: Start difference. First operand 542 states and 819 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:11,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:11,094 INFO L93 Difference]: Finished difference Result 1486 states and 2281 transitions. [2025-03-16 19:11:11,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:11:11,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-16 19:11:11,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:11,097 INFO L225 Difference]: With dead ends: 1486 [2025-03-16 19:11:11,097 INFO L226 Difference]: Without dead ends: 990 [2025-03-16 19:11:11,098 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-16 19:11:11,101 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 62 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:11,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 266 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:11,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2025-03-16 19:11:11,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 988. [2025-03-16 19:11:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 987 states have (on average 1.5146909827760893) internal successors, (1495), 987 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:11,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1495 transitions. [2025-03-16 19:11:11,138 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1495 transitions. Word has length 65 [2025-03-16 19:11:11,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:11,139 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1495 transitions. [2025-03-16 19:11:11,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:11,139 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1495 transitions. [2025-03-16 19:11:11,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:11:11,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:11,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:11:11,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:11:11,139 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:11,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:11,140 INFO L85 PathProgramCache]: Analyzing trace with hash 385322906, now seen corresponding path program 1 times [2025-03-16 19:11:11,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:11,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334818371] [2025-03-16 19:11:11,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:11,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:11,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:11:11,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:11:11,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:11,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:11,190 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-16 19:11:11,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:11,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334818371] [2025-03-16 19:11:11,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334818371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:11,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:11,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:11:11,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964459011] [2025-03-16 19:11:11,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:11,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:11:11,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:11,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:11:11,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:11:11,191 INFO L87 Difference]: Start difference. First operand 988 states and 1495 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:11,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:11,219 INFO L93 Difference]: Finished difference Result 2776 states and 4225 transitions. [2025-03-16 19:11:11,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:11:11,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-16 19:11:11,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:11,226 INFO L225 Difference]: With dead ends: 2776 [2025-03-16 19:11:11,226 INFO L226 Difference]: Without dead ends: 1834 [2025-03-16 19:11:11,227 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-16 19:11:11,229 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 60 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:11,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 268 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:11,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2025-03-16 19:11:11,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1832. [2025-03-16 19:11:11,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1832 states, 1831 states have (on average 1.5024576734025124) internal successors, (2751), 1831 states have internal predecessors, (2751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:11,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 2751 transitions. [2025-03-16 19:11:11,273 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 2751 transitions. Word has length 65 [2025-03-16 19:11:11,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:11,273 INFO L471 AbstractCegarLoop]: Abstraction has 1832 states and 2751 transitions. [2025-03-16 19:11:11,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:11,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2751 transitions. [2025-03-16 19:11:11,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:11:11,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:11,274 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:11:11,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:11:11,274 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:11,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:11,275 INFO L85 PathProgramCache]: Analyzing trace with hash 319140506, now seen corresponding path program 1 times [2025-03-16 19:11:11,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:11,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980591603] [2025-03-16 19:11:11,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:11,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:11,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:11:11,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:11:11,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:11,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:11,318 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-16 19:11:11,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:11,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980591603] [2025-03-16 19:11:11,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980591603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:11,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:11,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:11:11,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788755307] [2025-03-16 19:11:11,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:11,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:11:11,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:11,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:11:11,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:11:11,319 INFO L87 Difference]: Start difference. First operand 1832 states and 2751 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:11,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:11,364 INFO L93 Difference]: Finished difference Result 5212 states and 7825 transitions. [2025-03-16 19:11:11,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:11:11,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-16 19:11:11,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:11,375 INFO L225 Difference]: With dead ends: 5212 [2025-03-16 19:11:11,375 INFO L226 Difference]: Without dead ends: 3426 [2025-03-16 19:11:11,377 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-16 19:11:11,379 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 58 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:11,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 270 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:11,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3426 states. [2025-03-16 19:11:11,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3426 to 3424. [2025-03-16 19:11:11,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3424 states, 3423 states have (on average 1.4814490213263218) internal successors, (5071), 3423 states have internal predecessors, (5071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:11,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3424 states to 3424 states and 5071 transitions. [2025-03-16 19:11:11,458 INFO L78 Accepts]: Start accepts. Automaton has 3424 states and 5071 transitions. Word has length 65 [2025-03-16 19:11:11,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:11,459 INFO L471 AbstractCegarLoop]: Abstraction has 3424 states and 5071 transitions. [2025-03-16 19:11:11,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:11,459 INFO L276 IsEmpty]: Start isEmpty. Operand 3424 states and 5071 transitions. [2025-03-16 19:11:11,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:11:11,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:11,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:11:11,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:11:11,460 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:11,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:11,460 INFO L85 PathProgramCache]: Analyzing trace with hash -230648422, now seen corresponding path program 1 times [2025-03-16 19:11:11,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:11,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986718479] [2025-03-16 19:11:11,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:11,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:11,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:11:11,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:11:11,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:11,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:11,498 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-16 19:11:11,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:11,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986718479] [2025-03-16 19:11:11,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986718479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:11,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:11,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:11:11,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402860251] [2025-03-16 19:11:11,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:11,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:11:11,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:11,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:11:11,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:11:11,500 INFO L87 Difference]: Start difference. First operand 3424 states and 5071 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:11,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:11,594 INFO L93 Difference]: Finished difference Result 9796 states and 14449 transitions. [2025-03-16 19:11:11,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:11:11,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-16 19:11:11,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:11,612 INFO L225 Difference]: With dead ends: 9796 [2025-03-16 19:11:11,612 INFO L226 Difference]: Without dead ends: 6418 [2025-03-16 19:11:11,615 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-16 19:11:11,616 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 56 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:11,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 272 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:11,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6418 states. [2025-03-16 19:11:11,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6418 to 6416. [2025-03-16 19:11:11,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6416 states, 6415 states have (on average 1.4539360872954015) internal successors, (9327), 6415 states have internal predecessors, (9327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:11,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6416 states to 6416 states and 9327 transitions. [2025-03-16 19:11:11,748 INFO L78 Accepts]: Start accepts. Automaton has 6416 states and 9327 transitions. Word has length 65 [2025-03-16 19:11:11,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:11,748 INFO L471 AbstractCegarLoop]: Abstraction has 6416 states and 9327 transitions. [2025-03-16 19:11:11,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:11,748 INFO L276 IsEmpty]: Start isEmpty. Operand 6416 states and 9327 transitions. [2025-03-16 19:11:11,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:11:11,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:11,751 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:11:11,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:11:11,751 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:11,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:11,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1385775287, now seen corresponding path program 1 times [2025-03-16 19:11:11,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:11,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527939763] [2025-03-16 19:11:11,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:11,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:11,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:11:11,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:11:11,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:11,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:11,892 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:11:11,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:11,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527939763] [2025-03-16 19:11:11,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527939763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:11,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:11,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:11:11,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610578516] [2025-03-16 19:11:11,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:11,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:11:11,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:11,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:11:11,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:11:11,894 INFO L87 Difference]: Start difference. First operand 6416 states and 9327 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:12,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:12,453 INFO L93 Difference]: Finished difference Result 44062 states and 64150 transitions. [2025-03-16 19:11:12,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:11:12,453 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-16 19:11:12,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:12,548 INFO L225 Difference]: With dead ends: 44062 [2025-03-16 19:11:12,548 INFO L226 Difference]: Without dead ends: 39580 [2025-03-16 19:11:12,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:11:12,562 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 814 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:12,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 1254 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:11:12,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39580 states. [2025-03-16 19:11:13,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39580 to 11856. [2025-03-16 19:11:13,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11856 states, 11855 states have (on average 1.4480809784900885) internal successors, (17167), 11855 states have internal predecessors, (17167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:13,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11856 states to 11856 states and 17167 transitions. [2025-03-16 19:11:13,063 INFO L78 Accepts]: Start accepts. Automaton has 11856 states and 17167 transitions. Word has length 85 [2025-03-16 19:11:13,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:13,065 INFO L471 AbstractCegarLoop]: Abstraction has 11856 states and 17167 transitions. [2025-03-16 19:11:13,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:13,065 INFO L276 IsEmpty]: Start isEmpty. Operand 11856 states and 17167 transitions. [2025-03-16 19:11:13,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:11:13,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:13,068 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:11:13,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:11:13,069 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:13,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:13,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1628349001, now seen corresponding path program 1 times [2025-03-16 19:11:13,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:13,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023601441] [2025-03-16 19:11:13,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:13,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:13,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:11:13,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:11:13,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:13,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:13,205 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 19:11:13,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:13,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023601441] [2025-03-16 19:11:13,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023601441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:13,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:13,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:11:13,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696939460] [2025-03-16 19:11:13,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:13,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:11:13,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:13,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:11:13,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:11:13,207 INFO L87 Difference]: Start difference. First operand 11856 states and 17167 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:13,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:13,765 INFO L93 Difference]: Finished difference Result 50430 states and 73366 transitions. [2025-03-16 19:11:13,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:11:13,766 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-16 19:11:13,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:13,884 INFO L225 Difference]: With dead ends: 50430 [2025-03-16 19:11:13,884 INFO L226 Difference]: Without dead ends: 44060 [2025-03-16 19:11:13,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:11:13,897 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 816 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:13,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 1221 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:11:13,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44060 states. [2025-03-16 19:11:14,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44060 to 20464. [2025-03-16 19:11:14,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20464 states, 20463 states have (on average 1.4441186531789083) internal successors, (29551), 20463 states have internal predecessors, (29551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:14,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20464 states to 20464 states and 29551 transitions. [2025-03-16 19:11:14,520 INFO L78 Accepts]: Start accepts. Automaton has 20464 states and 29551 transitions. Word has length 85 [2025-03-16 19:11:14,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:14,520 INFO L471 AbstractCegarLoop]: Abstraction has 20464 states and 29551 transitions. [2025-03-16 19:11:14,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:14,521 INFO L276 IsEmpty]: Start isEmpty. Operand 20464 states and 29551 transitions. [2025-03-16 19:11:14,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:11:14,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:14,524 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:11:14,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:11:14,524 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:14,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:14,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1823259319, now seen corresponding path program 1 times [2025-03-16 19:11:14,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:14,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831322796] [2025-03-16 19:11:14,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:14,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:14,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:11:14,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:11:14,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:14,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 19:11:14,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:14,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831322796] [2025-03-16 19:11:14,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831322796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:14,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:14,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:11:14,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510130101] [2025-03-16 19:11:14,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:14,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:11:14,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:14,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:11:14,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:11:14,698 INFO L87 Difference]: Start difference. First operand 20464 states and 29551 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:15,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:15,530 INFO L93 Difference]: Finished difference Result 56798 states and 82550 transitions. [2025-03-16 19:11:15,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:11:15,531 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-16 19:11:15,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:15,612 INFO L225 Difference]: With dead ends: 56798 [2025-03-16 19:11:15,612 INFO L226 Difference]: Without dead ends: 50428 [2025-03-16 19:11:15,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:11:15,625 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 837 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:15,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 1174 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:11:15,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50428 states. [2025-03-16 19:11:16,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50428 to 26832. [2025-03-16 19:11:16,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26832 states, 26831 states have (on average 1.4436659088367934) internal successors, (38735), 26831 states have internal predecessors, (38735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:16,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26832 states to 26832 states and 38735 transitions. [2025-03-16 19:11:16,249 INFO L78 Accepts]: Start accepts. Automaton has 26832 states and 38735 transitions. Word has length 85 [2025-03-16 19:11:16,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:16,249 INFO L471 AbstractCegarLoop]: Abstraction has 26832 states and 38735 transitions. [2025-03-16 19:11:16,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:16,249 INFO L276 IsEmpty]: Start isEmpty. Operand 26832 states and 38735 transitions. [2025-03-16 19:11:16,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:11:16,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:16,252 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:11:16,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:11:16,253 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:16,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:16,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1000036279, now seen corresponding path program 1 times [2025-03-16 19:11:16,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:16,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575019875] [2025-03-16 19:11:16,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:16,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:16,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:11:16,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:11:16,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:16,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:16,382 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 19:11:16,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:16,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575019875] [2025-03-16 19:11:16,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575019875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:16,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:16,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:11:16,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596702627] [2025-03-16 19:11:16,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:16,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:11:16,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:16,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:11:16,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:11:16,384 INFO L87 Difference]: Start difference. First operand 26832 states and 38735 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:17,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:17,231 INFO L93 Difference]: Finished difference Result 63166 states and 91734 transitions. [2025-03-16 19:11:17,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:11:17,231 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-16 19:11:17,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:17,289 INFO L225 Difference]: With dead ends: 63166 [2025-03-16 19:11:17,289 INFO L226 Difference]: Without dead ends: 56796 [2025-03-16 19:11:17,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:11:17,301 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 872 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:17,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1162 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:11:17,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56796 states. [2025-03-16 19:11:18,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56796 to 33200. [2025-03-16 19:11:18,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33200 states, 33199 states have (on average 1.4433868490014758) internal successors, (47919), 33199 states have internal predecessors, (47919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:18,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33200 states to 33200 states and 47919 transitions. [2025-03-16 19:11:18,388 INFO L78 Accepts]: Start accepts. Automaton has 33200 states and 47919 transitions. Word has length 85 [2025-03-16 19:11:18,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:18,389 INFO L471 AbstractCegarLoop]: Abstraction has 33200 states and 47919 transitions. [2025-03-16 19:11:18,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:18,389 INFO L276 IsEmpty]: Start isEmpty. Operand 33200 states and 47919 transitions. [2025-03-16 19:11:18,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:11:18,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:18,393 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:11:18,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:11:18,393 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:18,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:18,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1066218679, now seen corresponding path program 1 times [2025-03-16 19:11:18,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:18,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686309691] [2025-03-16 19:11:18,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:18,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:18,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:11:18,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:11:18,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:18,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:18,554 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 19:11:18,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:18,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686309691] [2025-03-16 19:11:18,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686309691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:18,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:18,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:11:18,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052101103] [2025-03-16 19:11:18,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:18,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:11:18,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:18,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:11:18,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:11:18,555 INFO L87 Difference]: Start difference. First operand 33200 states and 47919 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:19,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:19,644 INFO L93 Difference]: Finished difference Result 69534 states and 100918 transitions. [2025-03-16 19:11:19,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:11:19,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-16 19:11:19,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:19,725 INFO L225 Difference]: With dead ends: 69534 [2025-03-16 19:11:19,725 INFO L226 Difference]: Without dead ends: 63164 [2025-03-16 19:11:19,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:11:19,744 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 918 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:19,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 1168 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:11:19,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63164 states. [2025-03-16 19:11:20,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63164 to 39568. [2025-03-16 19:11:20,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39568 states, 39567 states have (on average 1.4431976141734273) internal successors, (57103), 39567 states have internal predecessors, (57103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:20,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39568 states to 39568 states and 57103 transitions. [2025-03-16 19:11:20,720 INFO L78 Accepts]: Start accepts. Automaton has 39568 states and 57103 transitions. Word has length 85 [2025-03-16 19:11:20,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:20,720 INFO L471 AbstractCegarLoop]: Abstraction has 39568 states and 57103 transitions. [2025-03-16 19:11:20,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:20,720 INFO L276 IsEmpty]: Start isEmpty. Operand 39568 states and 57103 transitions. [2025-03-16 19:11:20,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:11:20,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:20,724 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:11:20,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:11:20,724 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:20,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:20,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1616007607, now seen corresponding path program 1 times [2025-03-16 19:11:20,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:20,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542821589] [2025-03-16 19:11:20,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:20,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:20,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:11:20,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:11:20,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:20,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:20,851 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 19:11:20,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:20,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542821589] [2025-03-16 19:11:20,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542821589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:20,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:20,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:11:20,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652261241] [2025-03-16 19:11:20,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:20,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:11:20,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:20,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:11:20,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:11:20,853 INFO L87 Difference]: Start difference. First operand 39568 states and 57103 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:21,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:21,859 INFO L93 Difference]: Finished difference Result 75902 states and 110102 transitions. [2025-03-16 19:11:21,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:11:21,859 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-16 19:11:21,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:21,924 INFO L225 Difference]: With dead ends: 75902 [2025-03-16 19:11:21,924 INFO L226 Difference]: Without dead ends: 69532 [2025-03-16 19:11:21,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:11:21,939 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 840 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:21,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 1229 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:11:21,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69532 states. [2025-03-16 19:11:23,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69532 to 45936. [2025-03-16 19:11:23,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45936 states, 45935 states have (on average 1.4430608468488082) internal successors, (66287), 45935 states have internal predecessors, (66287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:23,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45936 states to 45936 states and 66287 transitions. [2025-03-16 19:11:23,190 INFO L78 Accepts]: Start accepts. Automaton has 45936 states and 66287 transitions. Word has length 85 [2025-03-16 19:11:23,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:23,191 INFO L471 AbstractCegarLoop]: Abstraction has 45936 states and 66287 transitions. [2025-03-16 19:11:23,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:23,191 INFO L276 IsEmpty]: Start isEmpty. Operand 45936 states and 66287 transitions. [2025-03-16 19:11:23,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 19:11:23,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:23,195 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, 1, 1, 1] [2025-03-16 19:11:23,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:11:23,196 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:23,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:23,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1324949070, now seen corresponding path program 1 times [2025-03-16 19:11:23,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:23,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506960564] [2025-03-16 19:11:23,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:23,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:23,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 19:11:23,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 19:11:23,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:23,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:23,291 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:23,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:23,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506960564] [2025-03-16 19:11:23,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506960564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:23,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:23,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:11:23,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394833185] [2025-03-16 19:11:23,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:23,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:11:23,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:23,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:11:23,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:11:23,293 INFO L87 Difference]: Start difference. First operand 45936 states and 66287 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:24,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:24,304 INFO L93 Difference]: Finished difference Result 91828 states and 132529 transitions. [2025-03-16 19:11:24,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:11:24,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-16 19:11:24,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:24,351 INFO L225 Difference]: With dead ends: 91828 [2025-03-16 19:11:24,351 INFO L226 Difference]: Without dead ends: 45938 [2025-03-16 19:11:24,374 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-16 19:11:24,375 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 53 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:24,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 271 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:24,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45938 states. [2025-03-16 19:11:25,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45938 to 45936. [2025-03-16 19:11:25,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45936 states, 45935 states have (on average 1.428083160988353) internal successors, (65599), 45935 states have internal predecessors, (65599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:25,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45936 states to 45936 states and 65599 transitions. [2025-03-16 19:11:25,458 INFO L78 Accepts]: Start accepts. Automaton has 45936 states and 65599 transitions. Word has length 86 [2025-03-16 19:11:25,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:25,458 INFO L471 AbstractCegarLoop]: Abstraction has 45936 states and 65599 transitions. [2025-03-16 19:11:25,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:25,459 INFO L276 IsEmpty]: Start isEmpty. Operand 45936 states and 65599 transitions. [2025-03-16 19:11:25,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 19:11:25,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:25,461 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:11:25,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:11:25,462 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:25,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:25,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1512476395, now seen corresponding path program 1 times [2025-03-16 19:11:25,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:25,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701677463] [2025-03-16 19:11:25,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:25,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:25,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 19:11:25,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 19:11:25,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:25,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:25,646 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:25,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:25,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701677463] [2025-03-16 19:11:25,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701677463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:25,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:25,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:11:25,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770935824] [2025-03-16 19:11:25,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:25,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:11:25,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:25,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:11:25,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:11:25,648 INFO L87 Difference]: Start difference. First operand 45936 states and 65599 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:25,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:25,931 INFO L93 Difference]: Finished difference Result 62760 states and 89862 transitions. [2025-03-16 19:11:25,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:11:25,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-03-16 19:11:25,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:25,954 INFO L225 Difference]: With dead ends: 62760 [2025-03-16 19:11:25,954 INFO L226 Difference]: Without dead ends: 16870 [2025-03-16 19:11:25,981 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-16 19:11:25,982 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 47 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:25,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 268 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:25,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16870 states. [2025-03-16 19:11:26,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16870 to 16863. [2025-03-16 19:11:26,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16863 states, 16862 states have (on average 1.4269956114339937) internal successors, (24062), 16862 states have internal predecessors, (24062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:26,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16863 states to 16863 states and 24062 transitions. [2025-03-16 19:11:26,287 INFO L78 Accepts]: Start accepts. Automaton has 16863 states and 24062 transitions. Word has length 87 [2025-03-16 19:11:26,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:26,288 INFO L471 AbstractCegarLoop]: Abstraction has 16863 states and 24062 transitions. [2025-03-16 19:11:26,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:26,288 INFO L276 IsEmpty]: Start isEmpty. Operand 16863 states and 24062 transitions. [2025-03-16 19:11:26,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 19:11:26,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:26,289 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:11:26,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:11:26,289 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:26,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:26,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1946574773, now seen corresponding path program 1 times [2025-03-16 19:11:26,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:26,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674352612] [2025-03-16 19:11:26,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:26,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:26,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 19:11:26,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 19:11:26,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:26,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:26,352 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:26,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:26,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674352612] [2025-03-16 19:11:26,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674352612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:26,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:26,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:11:26,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282561938] [2025-03-16 19:11:26,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:26,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:11:26,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:26,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:11:26,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:11:26,355 INFO L87 Difference]: Start difference. First operand 16863 states and 24062 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:26,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:26,489 INFO L93 Difference]: Finished difference Result 25267 states and 36064 transitions. [2025-03-16 19:11:26,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:11:26,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-03-16 19:11:26,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:26,500 INFO L225 Difference]: With dead ends: 25267 [2025-03-16 19:11:26,501 INFO L226 Difference]: Without dead ends: 8465 [2025-03-16 19:11:26,512 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-16 19:11:26,513 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 49 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:26,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 247 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:26,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8465 states. [2025-03-16 19:11:26,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8465 to 8463. [2025-03-16 19:11:26,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8463 states, 8462 states have (on average 1.4112502954384307) internal successors, (11942), 8462 states have internal predecessors, (11942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:26,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8463 states to 8463 states and 11942 transitions. [2025-03-16 19:11:26,666 INFO L78 Accepts]: Start accepts. Automaton has 8463 states and 11942 transitions. Word has length 88 [2025-03-16 19:11:26,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:26,666 INFO L471 AbstractCegarLoop]: Abstraction has 8463 states and 11942 transitions. [2025-03-16 19:11:26,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:26,666 INFO L276 IsEmpty]: Start isEmpty. Operand 8463 states and 11942 transitions. [2025-03-16 19:11:26,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 19:11:26,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:26,668 INFO L218 NwaCegarLoop]: trace histogram [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-16 19:11:26,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:11:26,668 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:26,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:26,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2102774244, now seen corresponding path program 1 times [2025-03-16 19:11:26,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:26,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725945642] [2025-03-16 19:11:26,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:26,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:26,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 19:11:26,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 19:11:26,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:26,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:26,778 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:26,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:26,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725945642] [2025-03-16 19:11:26,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725945642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:26,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:26,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:11:26,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738518671] [2025-03-16 19:11:26,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:26,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:11:26,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:26,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:11:26,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:11:26,780 INFO L87 Difference]: Start difference. First operand 8463 states and 11942 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:26,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:26,845 INFO L93 Difference]: Finished difference Result 12667 states and 17884 transitions. [2025-03-16 19:11:26,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:11:26,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-16 19:11:26,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:26,850 INFO L225 Difference]: With dead ends: 12667 [2025-03-16 19:11:26,850 INFO L226 Difference]: Without dead ends: 4265 [2025-03-16 19:11:26,855 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-16 19:11:26,856 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 46 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:26,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 232 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:26,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4265 states. [2025-03-16 19:11:26,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4265 to 4263. [2025-03-16 19:11:26,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4263 states, 4262 states have (on average 1.3941811356170812) internal successors, (5942), 4262 states have internal predecessors, (5942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:26,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 5942 transitions. [2025-03-16 19:11:26,930 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 5942 transitions. Word has length 90 [2025-03-16 19:11:26,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:26,931 INFO L471 AbstractCegarLoop]: Abstraction has 4263 states and 5942 transitions. [2025-03-16 19:11:26,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:26,931 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 5942 transitions. [2025-03-16 19:11:26,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 19:11:26,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:26,931 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:11:26,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:11:26,932 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:26,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:26,932 INFO L85 PathProgramCache]: Analyzing trace with hash -2034831747, now seen corresponding path program 1 times [2025-03-16 19:11:26,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:26,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060913092] [2025-03-16 19:11:26,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:26,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:26,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 19:11:26,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 19:11:26,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:26,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:26,994 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:26,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:26,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060913092] [2025-03-16 19:11:26,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060913092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:26,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:26,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:11:26,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468047433] [2025-03-16 19:11:26,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:26,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:11:26,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:26,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:11:26,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:11:26,996 INFO L87 Difference]: Start difference. First operand 4263 states and 5942 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:27,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:27,031 INFO L93 Difference]: Finished difference Result 6367 states and 8884 transitions. [2025-03-16 19:11:27,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:11:27,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-16 19:11:27,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:27,035 INFO L225 Difference]: With dead ends: 6367 [2025-03-16 19:11:27,035 INFO L226 Difference]: Without dead ends: 2165 [2025-03-16 19:11:27,037 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-16 19:11:27,038 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 43 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:27,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 217 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:27,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2025-03-16 19:11:27,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 2163. [2025-03-16 19:11:27,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 2162 states have (on average 1.3746530989824237) internal successors, (2972), 2162 states have internal predecessors, (2972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:27,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 2972 transitions. [2025-03-16 19:11:27,077 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 2972 transitions. Word has length 92 [2025-03-16 19:11:27,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:27,077 INFO L471 AbstractCegarLoop]: Abstraction has 2163 states and 2972 transitions. [2025-03-16 19:11:27,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:27,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2972 transitions. [2025-03-16 19:11:27,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 19:11:27,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:27,078 INFO L218 NwaCegarLoop]: trace histogram [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-16 19:11:27,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:11:27,079 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:27,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:27,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1600691734, now seen corresponding path program 1 times [2025-03-16 19:11:27,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:27,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614163043] [2025-03-16 19:11:27,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:27,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:27,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 19:11:27,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 19:11:27,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:27,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:27,142 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:27,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:27,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614163043] [2025-03-16 19:11:27,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614163043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:27,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:27,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:11:27,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052676163] [2025-03-16 19:11:27,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:27,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:11:27,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:27,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:11:27,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:11:27,143 INFO L87 Difference]: Start difference. First operand 2163 states and 2972 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:27,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:27,164 INFO L93 Difference]: Finished difference Result 3217 states and 4429 transitions. [2025-03-16 19:11:27,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:11:27,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-03-16 19:11:27,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:27,167 INFO L225 Difference]: With dead ends: 3217 [2025-03-16 19:11:27,167 INFO L226 Difference]: Without dead ends: 1115 [2025-03-16 19:11:27,168 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-16 19:11:27,169 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 40 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:27,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 202 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:27,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-03-16 19:11:27,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1113. [2025-03-16 19:11:27,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 1112 states have (on average 1.3507194244604317) internal successors, (1502), 1112 states have internal predecessors, (1502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:27,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1502 transitions. [2025-03-16 19:11:27,189 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1502 transitions. Word has length 94 [2025-03-16 19:11:27,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:27,189 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1502 transitions. [2025-03-16 19:11:27,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:27,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1502 transitions. [2025-03-16 19:11:27,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 19:11:27,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:27,190 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:11:27,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:11:27,190 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:27,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:27,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1298557103, now seen corresponding path program 1 times [2025-03-16 19:11:27,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:27,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462290140] [2025-03-16 19:11:27,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:27,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:27,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 19:11:27,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 19:11:27,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:27,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:27,845 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:27,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:27,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462290140] [2025-03-16 19:11:27,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462290140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:11:27,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884544260] [2025-03-16 19:11:27,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:27,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:11:27,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:11:27,848 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-16 19:11:27,850 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-16 19:11:27,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 19:11:27,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 19:11:27,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:27,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:27,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 19:11:27,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:11:28,395 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:28,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:11:29,149 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:29,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884544260] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:11:29,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:11:29,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 25 [2025-03-16 19:11:29,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662250679] [2025-03-16 19:11:29,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:11:29,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-16 19:11:29,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:29,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-16 19:11:29,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:11:29,151 INFO L87 Difference]: Start difference. First operand 1113 states and 1502 transitions. Second operand has 26 states, 26 states have (on average 9.76923076923077) internal successors, (254), 25 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:32,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:32,114 INFO L93 Difference]: Finished difference Result 6527 states and 8979 transitions. [2025-03-16 19:11:32,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-16 19:11:32,116 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.76923076923077) internal successors, (254), 25 states have internal predecessors, (254), 0 states have call successors, (0), 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 96 [2025-03-16 19:11:32,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:32,123 INFO L225 Difference]: With dead ends: 6527 [2025-03-16 19:11:32,123 INFO L226 Difference]: Without dead ends: 5475 [2025-03-16 19:11:32,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1142 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=802, Invalid=3890, Unknown=0, NotChecked=0, Total=4692 [2025-03-16 19:11:32,128 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 2259 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2259 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:32,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2259 Valid, 1108 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:11:32,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5475 states. [2025-03-16 19:11:32,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5475 to 5343. [2025-03-16 19:11:32,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5343 states, 5342 states have (on average 1.3509921377761138) internal successors, (7217), 5342 states have internal predecessors, (7217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:32,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5343 states to 5343 states and 7217 transitions. [2025-03-16 19:11:32,283 INFO L78 Accepts]: Start accepts. Automaton has 5343 states and 7217 transitions. Word has length 96 [2025-03-16 19:11:32,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:32,283 INFO L471 AbstractCegarLoop]: Abstraction has 5343 states and 7217 transitions. [2025-03-16 19:11:32,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.76923076923077) internal successors, (254), 25 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:32,284 INFO L276 IsEmpty]: Start isEmpty. Operand 5343 states and 7217 transitions. [2025-03-16 19:11:32,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 19:11:32,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:32,285 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:11:32,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 19:11:32,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-16 19:11:32,486 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:32,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:32,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1682765431, now seen corresponding path program 1 times [2025-03-16 19:11:32,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:32,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96988633] [2025-03-16 19:11:32,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:32,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:32,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 19:11:32,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 19:11:32,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:32,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:32,843 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:32,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:32,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96988633] [2025-03-16 19:11:32,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96988633] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:11:32,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140222671] [2025-03-16 19:11:32,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:32,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:11:32,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:11:32,846 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-16 19:11:32,848 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-16 19:11:32,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 19:11:32,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 19:11:32,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:32,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:32,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 19:11:32,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:11:33,347 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:33,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:11:33,986 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:33,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140222671] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:11:33,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:11:33,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-03-16 19:11:33,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998299] [2025-03-16 19:11:33,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:11:33,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 19:11:33,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:33,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 19:11:33,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:11:33,988 INFO L87 Difference]: Start difference. First operand 5343 states and 7217 transitions. Second operand has 23 states, 23 states have (on average 11.782608695652174) internal successors, (271), 22 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:35,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:35,413 INFO L93 Difference]: Finished difference Result 16697 states and 22644 transitions. [2025-03-16 19:11:35,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-16 19:11:35,413 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 11.782608695652174) internal successors, (271), 22 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-16 19:11:35,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:35,425 INFO L225 Difference]: With dead ends: 16697 [2025-03-16 19:11:35,425 INFO L226 Difference]: Without dead ends: 11415 [2025-03-16 19:11:35,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=507, Invalid=2249, Unknown=0, NotChecked=0, Total=2756 [2025-03-16 19:11:35,432 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 2121 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2121 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:35,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2121 Valid, 822 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:11:35,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11415 states. [2025-03-16 19:11:35,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11415 to 9183. [2025-03-16 19:11:35,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9183 states, 9182 states have (on average 1.3201916793726858) internal successors, (12122), 9182 states have internal predecessors, (12122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:35,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9183 states to 9183 states and 12122 transitions. [2025-03-16 19:11:35,763 INFO L78 Accepts]: Start accepts. Automaton has 9183 states and 12122 transitions. Word has length 97 [2025-03-16 19:11:35,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:35,763 INFO L471 AbstractCegarLoop]: Abstraction has 9183 states and 12122 transitions. [2025-03-16 19:11:35,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 11.782608695652174) internal successors, (271), 22 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:35,763 INFO L276 IsEmpty]: Start isEmpty. Operand 9183 states and 12122 transitions. [2025-03-16 19:11:35,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 19:11:35,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:35,765 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:11:35,775 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-16 19:11:35,966 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,SelfDestructingSolverStorable25 [2025-03-16 19:11:35,966 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:35,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:35,967 INFO L85 PathProgramCache]: Analyzing trace with hash -2103278848, now seen corresponding path program 1 times [2025-03-16 19:11:35,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:35,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136419169] [2025-03-16 19:11:35,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:35,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:35,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 19:11:35,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 19:11:35,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:35,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:36,279 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:36,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:36,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136419169] [2025-03-16 19:11:36,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136419169] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:11:36,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325174512] [2025-03-16 19:11:36,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:36,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:11:36,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:11:36,281 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-16 19:11:36,282 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-16 19:11:36,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 19:11:36,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 19:11:36,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:36,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:36,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-16 19:11:36,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:11:37,997 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:37,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:11:39,853 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:39,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325174512] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:11:39,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:11:39,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 14] total 34 [2025-03-16 19:11:39,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070021490] [2025-03-16 19:11:39,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:11:39,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-16 19:11:39,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:39,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-16 19:11:39,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1026, Unknown=0, NotChecked=0, Total=1190 [2025-03-16 19:11:39,855 INFO L87 Difference]: Start difference. First operand 9183 states and 12122 transitions. Second operand has 35 states, 35 states have (on average 7.142857142857143) internal successors, (250), 34 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:55,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:55,456 INFO L93 Difference]: Finished difference Result 83353 states and 110295 transitions. [2025-03-16 19:11:55,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2025-03-16 19:11:55,456 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 7.142857142857143) internal successors, (250), 34 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-16 19:11:55,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:55,530 INFO L225 Difference]: With dead ends: 83353 [2025-03-16 19:11:55,530 INFO L226 Difference]: Without dead ends: 74231 [2025-03-16 19:11:55,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11177 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=4659, Invalid=25443, Unknown=0, NotChecked=0, Total=30102 [2025-03-16 19:11:55,558 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 3902 mSDsluCounter, 2953 mSDsCounter, 0 mSdLazyCounter, 3538 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3902 SdHoareTripleChecker+Valid, 3092 SdHoareTripleChecker+Invalid, 3621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 3538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:55,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3902 Valid, 3092 Invalid, 3621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 3538 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 19:11:55,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74231 states. [2025-03-16 19:11:56,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74231 to 47255. [2025-03-16 19:11:56,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47255 states, 47254 states have (on average 1.30058830998434) internal successors, (61458), 47254 states have internal predecessors, (61458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:56,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47255 states to 47255 states and 61458 transitions. [2025-03-16 19:11:56,938 INFO L78 Accepts]: Start accepts. Automaton has 47255 states and 61458 transitions. Word has length 98 [2025-03-16 19:11:56,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:56,938 INFO L471 AbstractCegarLoop]: Abstraction has 47255 states and 61458 transitions. [2025-03-16 19:11:56,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.142857142857143) internal successors, (250), 34 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:56,938 INFO L276 IsEmpty]: Start isEmpty. Operand 47255 states and 61458 transitions. [2025-03-16 19:11:56,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:11:56,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:56,940 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:11:56,947 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-16 19:11:57,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:11:57,144 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:57,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:57,144 INFO L85 PathProgramCache]: Analyzing trace with hash -952976480, now seen corresponding path program 1 times [2025-03-16 19:11:57,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:57,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716535231] [2025-03-16 19:11:57,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:57,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:57,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:11:57,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:11:57,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:57,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:57,473 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:57,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:57,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716535231] [2025-03-16 19:11:57,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716535231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:11:57,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499498330] [2025-03-16 19:11:57,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:57,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:11:57,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:11:57,476 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-16 19:11:57,477 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-16 19:11:57,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:11:57,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:11:57,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:57,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:57,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 19:11:57,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:11:57,907 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:57,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:11:58,446 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:58,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499498330] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:11:58,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:11:58,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-03-16 19:11:58,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631977145] [2025-03-16 19:11:58,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:11:58,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-16 19:11:58,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:58,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-16 19:11:58,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:11:58,447 INFO L87 Difference]: Start difference. First operand 47255 states and 61458 transitions. Second operand has 19 states, 19 states have (on average 12.210526315789474) internal successors, (232), 18 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-16 19:12:01,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:12:01,688 INFO L93 Difference]: Finished difference Result 192343 states and 250906 transitions. [2025-03-16 19:12:01,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:12:01,689 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 12.210526315789474) internal successors, (232), 18 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 100 [2025-03-16 19:12:01,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:12:01,851 INFO L225 Difference]: With dead ends: 192343 [2025-03-16 19:12:01,851 INFO L226 Difference]: Without dead ends: 145149 [2025-03-16 19:12:01,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=626, Unknown=0, NotChecked=0, Total=812 [2025-03-16 19:12:01,896 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 851 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:12:01,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 755 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:12:01,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145149 states. [2025-03-16 19:12:04,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145149 to 96783. [2025-03-16 19:12:04,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96783 states, 96782 states have (on average 1.287491475687628) internal successors, (124606), 96782 states have internal predecessors, (124606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:12:05,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96783 states to 96783 states and 124606 transitions. [2025-03-16 19:12:05,081 INFO L78 Accepts]: Start accepts. Automaton has 96783 states and 124606 transitions. Word has length 100 [2025-03-16 19:12:05,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:12:05,081 INFO L471 AbstractCegarLoop]: Abstraction has 96783 states and 124606 transitions. [2025-03-16 19:12:05,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.210526315789474) internal successors, (232), 18 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-16 19:12:05,081 INFO L276 IsEmpty]: Start isEmpty. Operand 96783 states and 124606 transitions. [2025-03-16 19:12:05,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:12:05,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:12:05,085 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:12:05,092 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-16 19:12:05,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-16 19:12:05,287 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:12:05,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:12:05,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1753129405, now seen corresponding path program 1 times [2025-03-16 19:12:05,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:12:05,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819840775] [2025-03-16 19:12:05,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:12:05,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:12:05,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:12:05,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:12:05,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:12:05,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:12:05,914 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:12:05,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:12:05,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819840775] [2025-03-16 19:12:05,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819840775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:12:05,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202001400] [2025-03-16 19:12:05,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:12:05,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:12:05,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:12:05,916 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-16 19:12:05,917 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-16 19:12:05,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:12:06,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:12:06,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:12:06,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:12:06,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-16 19:12:06,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:12:07,029 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:12:07,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:12:08,315 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:12:08,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202001400] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:12:08,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:12:08,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 16] total 39 [2025-03-16 19:12:08,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877333131] [2025-03-16 19:12:08,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:12:08,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-16 19:12:08,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:12:08,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-16 19:12:08,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1318, Unknown=0, NotChecked=0, Total=1482 [2025-03-16 19:12:08,316 INFO L87 Difference]: Start difference. First operand 96783 states and 124606 transitions. Second operand has 39 states, 39 states have (on average 7.461538461538462) internal successors, (291), 39 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:12:16,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:12:16,101 INFO L93 Difference]: Finished difference Result 196013 states and 253391 transitions. [2025-03-16 19:12:16,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-03-16 19:12:16,101 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 7.461538461538462) internal successors, (291), 39 states have internal predecessors, (291), 0 states have call successors, (0), 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 101 [2025-03-16 19:12:16,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:12:16,325 INFO L225 Difference]: With dead ends: 196013 [2025-03-16 19:12:16,325 INFO L226 Difference]: Without dead ends: 156171 [2025-03-16 19:12:16,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3607 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2201, Invalid=10231, Unknown=0, NotChecked=0, Total=12432 [2025-03-16 19:12:16,376 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 2723 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 1988 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2723 SdHoareTripleChecker+Valid, 1815 SdHoareTripleChecker+Invalid, 2055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:12:16,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2723 Valid, 1815 Invalid, 2055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1988 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:12:16,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156171 states. [2025-03-16 19:12:19,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156171 to 85039. [2025-03-16 19:12:19,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85039 states, 85038 states have (on average 1.2833556762858958) internal successors, (109134), 85038 states have internal predecessors, (109134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:12:20,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85039 states to 85039 states and 109134 transitions. [2025-03-16 19:12:20,051 INFO L78 Accepts]: Start accepts. Automaton has 85039 states and 109134 transitions. Word has length 101 [2025-03-16 19:12:20,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:12:20,051 INFO L471 AbstractCegarLoop]: Abstraction has 85039 states and 109134 transitions. [2025-03-16 19:12:20,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.461538461538462) internal successors, (291), 39 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:12:20,052 INFO L276 IsEmpty]: Start isEmpty. Operand 85039 states and 109134 transitions. [2025-03-16 19:12:20,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:12:20,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:12:20,055 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:12:20,063 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-16 19:12:20,256 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,SelfDestructingSolverStorable28 [2025-03-16 19:12:20,256 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:12:20,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:12:20,256 INFO L85 PathProgramCache]: Analyzing trace with hash -121423427, now seen corresponding path program 1 times [2025-03-16 19:12:20,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:12:20,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839238056] [2025-03-16 19:12:20,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:12:20,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:12:20,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:12:20,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:12:20,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:12:20,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:12:21,012 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:12:21,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:12:21,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839238056] [2025-03-16 19:12:21,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839238056] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:12:21,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203415108] [2025-03-16 19:12:21,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:12:21,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:12:21,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:12:21,015 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:12:21,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 19:12:21,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:12:21,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:12:21,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:12:21,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:12:21,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-16 19:12:21,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:12:23,272 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:12:23,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:12:24,960 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:12:24,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203415108] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:12:24,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:12:24,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 16] total 40 [2025-03-16 19:12:24,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992433988] [2025-03-16 19:12:24,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:12:24,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-16 19:12:24,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:12:24,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-16 19:12:24,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1379, Unknown=0, NotChecked=0, Total=1560 [2025-03-16 19:12:24,962 INFO L87 Difference]: Start difference. First operand 85039 states and 109134 transitions. Second operand has 40 states, 40 states have (on average 6.325) internal successors, (253), 40 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)