./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.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 9a8265a1502e23b0364b9cd16198377a0ca498fc346156a58eeb954c0e23f901 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:51:09,828 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:51:09,883 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:51:09,888 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:51:09,889 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:51:09,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:51:09,905 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:51:09,905 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:51:09,906 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:51:09,906 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:51:09,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:51:09,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:51:09,906 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:51:09,906 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:51:09,906 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:51:09,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:51:09,906 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:51:09,906 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:51:09,906 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:51:09,906 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:51:09,906 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:51:09,906 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:51:09,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:51:09,906 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:51:09,906 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:51:09,906 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:51:09,907 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:51:09,907 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:51:09,907 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:51:09,907 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:51:09,907 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:51:09,907 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:51:09,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:51:09,908 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:51:09,908 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:51:09,908 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:51:09,908 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:51:09,908 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:51:09,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:51:09,908 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:51:09,908 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:51:09,908 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:51:09,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:51:09,908 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 -> 9a8265a1502e23b0364b9cd16198377a0ca498fc346156a58eeb954c0e23f901 [2025-03-03 14:51:10,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:51:10,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:51:10,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:51:10,140 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:51:10,140 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:51:10,141 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c [2025-03-03 14:51:11,265 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c202b379a/37505b41ed844ebab4a7d623a21a9fe1/FLAG43078fac5 [2025-03-03 14:51:11,488 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:51:11,488 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c [2025-03-03 14:51:11,495 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c202b379a/37505b41ed844ebab4a7d623a21a9fe1/FLAG43078fac5 [2025-03-03 14:51:11,512 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c202b379a/37505b41ed844ebab4a7d623a21a9fe1 [2025-03-03 14:51:11,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:51:11,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:51:11,516 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:51:11,516 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:51:11,519 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:51:11,519 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:51:11" (1/1) ... [2025-03-03 14:51:11,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33b27d94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:11, skipping insertion in model container [2025-03-03 14:51:11,520 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:51:11" (1/1) ... [2025-03-03 14:51:11,538 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:51:11,663 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.4.ufo.BOUNDED-8.pals.c[8209,8222] [2025-03-03 14:51:11,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:51:11,672 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:51:11,708 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.4.ufo.BOUNDED-8.pals.c[8209,8222] [2025-03-03 14:51:11,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:51:11,718 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:51:11,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:11 WrapperNode [2025-03-03 14:51:11,719 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:51:11,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:51:11,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:51:11,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:51:11,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:11" (1/1) ... [2025-03-03 14:51:11,731 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:11" (1/1) ... [2025-03-03 14:51:11,752 INFO L138 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 275 [2025-03-03 14:51:11,752 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:51:11,753 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:51:11,753 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:51:11,753 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:51:11,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:11" (1/1) ... [2025-03-03 14:51:11,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:11" (1/1) ... [2025-03-03 14:51:11,768 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:11" (1/1) ... [2025-03-03 14:51:11,776 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 14:51:11,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:11" (1/1) ... [2025-03-03 14:51:11,777 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:11" (1/1) ... [2025-03-03 14:51:11,780 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:11" (1/1) ... [2025-03-03 14:51:11,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:11" (1/1) ... [2025-03-03 14:51:11,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:11" (1/1) ... [2025-03-03 14:51:11,783 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:11" (1/1) ... [2025-03-03 14:51:11,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:51:11,785 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:51:11,785 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:51:11,785 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:51:11,789 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:11" (1/1) ... [2025-03-03 14:51:11,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:51:11,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:51:11,817 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:51:11,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:51:11,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:51:11,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:51:11,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:51:11,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:51:11,896 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:51:11,898 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:51:12,200 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-03-03 14:51:12,201 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:51:12,213 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:51:12,214 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:51:12,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:51:12 BoogieIcfgContainer [2025-03-03 14:51:12,214 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:51:12,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:51:12,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:51:12,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:51:12,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:51:11" (1/3) ... [2025-03-03 14:51:12,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a8f813e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:51:12, skipping insertion in model container [2025-03-03 14:51:12,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:11" (2/3) ... [2025-03-03 14:51:12,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a8f813e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:51:12, skipping insertion in model container [2025-03-03 14:51:12,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:51:12" (3/3) ... [2025-03-03 14:51:12,223 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c [2025-03-03 14:51:12,235 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:51:12,236 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c that has 1 procedures, 68 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:51:12,274 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:51:12,283 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;@11934ef7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:51:12,283 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:51:12,287 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 66 states have (on average 1.7272727272727273) internal successors, (114), 67 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:12,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 14:51:12,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:12,293 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] [2025-03-03 14:51:12,293 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:12,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:12,298 INFO L85 PathProgramCache]: Analyzing trace with hash -983011031, now seen corresponding path program 1 times [2025-03-03 14:51:12,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:12,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829837729] [2025-03-03 14:51:12,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:12,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:12,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-03 14:51:12,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 14:51:12,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:12,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:12,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:12,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:12,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829837729] [2025-03-03 14:51:12,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829837729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:12,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:12,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:51:12,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886457732] [2025-03-03 14:51:12,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:12,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:51:12,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:12,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:51:12,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:51:12,488 INFO L87 Difference]: Start difference. First operand has 68 states, 66 states have (on average 1.7272727272727273) internal successors, (114), 67 states have internal predecessors, (114), 0 states have call successors, (0), 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 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:12,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:12,500 INFO L93 Difference]: Finished difference Result 108 states and 176 transitions. [2025-03-03 14:51:12,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:51:12,501 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2025-03-03 14:51:12,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:12,506 INFO L225 Difference]: With dead ends: 108 [2025-03-03 14:51:12,506 INFO L226 Difference]: Without dead ends: 65 [2025-03-03 14:51:12,507 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-03 14:51:12,509 INFO L435 NwaCegarLoop]: 112 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, 112 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-03 14:51:12,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:12,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-03 14:51:12,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-03 14:51:12,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.703125) internal successors, (109), 64 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:12,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 109 transitions. [2025-03-03 14:51:12,530 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 109 transitions. Word has length 21 [2025-03-03 14:51:12,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:12,530 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 109 transitions. [2025-03-03 14:51:12,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:12,531 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 109 transitions. [2025-03-03 14:51:12,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 14:51:12,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:12,531 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] [2025-03-03 14:51:12,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:51:12,532 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:12,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:12,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1493545208, now seen corresponding path program 1 times [2025-03-03 14:51:12,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:12,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510424835] [2025-03-03 14:51:12,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:12,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:12,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-03 14:51:12,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 14:51:12,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:12,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:12,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:12,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:12,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510424835] [2025-03-03 14:51:12,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510424835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:12,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:12,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:51:12,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121154986] [2025-03-03 14:51:12,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:12,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:51:12,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:12,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:51:12,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:51:12,711 INFO L87 Difference]: Start difference. First operand 65 states and 109 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:12,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:12,783 INFO L93 Difference]: Finished difference Result 141 states and 227 transitions. [2025-03-03 14:51:12,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:51:12,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2025-03-03 14:51:12,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:12,787 INFO L225 Difference]: With dead ends: 141 [2025-03-03 14:51:12,787 INFO L226 Difference]: Without dead ends: 101 [2025-03-03 14:51:12,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:51:12,788 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 56 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:12,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 391 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:51:12,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-03 14:51:12,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 65. [2025-03-03 14:51:12,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.34375) internal successors, (86), 64 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:12,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2025-03-03 14:51:12,792 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 21 [2025-03-03 14:51:12,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:12,792 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2025-03-03 14:51:12,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:12,792 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2025-03-03 14:51:12,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 14:51:12,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:12,793 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] [2025-03-03 14:51:12,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:51:12,793 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:12,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:12,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1079123086, now seen corresponding path program 1 times [2025-03-03 14:51:12,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:12,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602853628] [2025-03-03 14:51:12,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:12,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:12,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 14:51:12,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 14:51:12,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:12,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:12,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:12,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:12,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602853628] [2025-03-03 14:51:12,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602853628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:12,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:12,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:51:12,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747827589] [2025-03-03 14:51:12,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:12,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:51:12,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:12,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:51:12,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:51:12,999 INFO L87 Difference]: Start difference. First operand 65 states and 86 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:13,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:13,171 INFO L93 Difference]: Finished difference Result 353 states and 542 transitions. [2025-03-03 14:51:13,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:51:13,172 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-03-03 14:51:13,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:13,173 INFO L225 Difference]: With dead ends: 353 [2025-03-03 14:51:13,173 INFO L226 Difference]: Without dead ends: 317 [2025-03-03 14:51:13,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:51:13,174 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 461 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:13,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 870 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:51:13,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-03 14:51:13,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 99. [2025-03-03 14:51:13,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 98 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:13,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 140 transitions. [2025-03-03 14:51:13,188 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 140 transitions. Word has length 43 [2025-03-03 14:51:13,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:13,188 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 140 transitions. [2025-03-03 14:51:13,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:13,188 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 140 transitions. [2025-03-03 14:51:13,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 14:51:13,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:13,189 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] [2025-03-03 14:51:13,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:51:13,189 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:13,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:13,189 INFO L85 PathProgramCache]: Analyzing trace with hash -829814099, now seen corresponding path program 1 times [2025-03-03 14:51:13,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:13,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885736118] [2025-03-03 14:51:13,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:13,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:13,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 14:51:13,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 14:51:13,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:13,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:13,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:13,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:13,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885736118] [2025-03-03 14:51:13,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885736118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:13,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:13,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:13,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537573594] [2025-03-03 14:51:13,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:13,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:13,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:13,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:13,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:13,262 INFO L87 Difference]: Start difference. First operand 99 states and 140 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:13,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:13,283 INFO L93 Difference]: Finished difference Result 228 states and 343 transitions. [2025-03-03 14:51:13,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:13,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-03 14:51:13,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:13,285 INFO L225 Difference]: With dead ends: 228 [2025-03-03 14:51:13,286 INFO L226 Difference]: Without dead ends: 158 [2025-03-03 14:51:13,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:13,287 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 35 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:13,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 136 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:13,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-03 14:51:13,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2025-03-03 14:51:13,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.4709677419354839) internal successors, (228), 155 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:13,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 228 transitions. [2025-03-03 14:51:13,304 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 228 transitions. Word has length 45 [2025-03-03 14:51:13,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:13,304 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 228 transitions. [2025-03-03 14:51:13,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:13,305 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 228 transitions. [2025-03-03 14:51:13,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 14:51:13,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:13,305 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] [2025-03-03 14:51:13,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:51:13,306 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:13,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:13,306 INFO L85 PathProgramCache]: Analyzing trace with hash -797490864, now seen corresponding path program 1 times [2025-03-03 14:51:13,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:13,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069905542] [2025-03-03 14:51:13,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:13,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:13,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 14:51:13,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 14:51:13,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:13,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:13,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:13,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:13,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069905542] [2025-03-03 14:51:13,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069905542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:13,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:13,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:51:13,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379216849] [2025-03-03 14:51:13,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:13,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:51:13,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:13,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:51:13,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:51:13,526 INFO L87 Difference]: Start difference. First operand 156 states and 228 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:13,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:13,641 INFO L93 Difference]: Finished difference Result 285 states and 428 transitions. [2025-03-03 14:51:13,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:51:13,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-03 14:51:13,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:13,642 INFO L225 Difference]: With dead ends: 285 [2025-03-03 14:51:13,642 INFO L226 Difference]: Without dead ends: 158 [2025-03-03 14:51:13,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:51:13,643 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 168 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:13,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 239 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:13,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-03 14:51:13,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2025-03-03 14:51:13,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.4580645161290322) internal successors, (226), 155 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 226 transitions. [2025-03-03 14:51:13,655 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 226 transitions. Word has length 45 [2025-03-03 14:51:13,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:13,656 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 226 transitions. [2025-03-03 14:51:13,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:13,657 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 226 transitions. [2025-03-03 14:51:13,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 14:51:13,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:13,658 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] [2025-03-03 14:51:13,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:51:13,658 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:13,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:13,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1078124725, now seen corresponding path program 1 times [2025-03-03 14:51:13,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:13,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726048667] [2025-03-03 14:51:13,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:13,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:13,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 14:51:13,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 14:51:13,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:13,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:13,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:13,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:13,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726048667] [2025-03-03 14:51:13,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726048667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:13,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:13,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:51:13,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829021862] [2025-03-03 14:51:13,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:13,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:51:13,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:13,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:51:13,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:51:13,853 INFO L87 Difference]: Start difference. First operand 156 states and 226 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:13,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:13,893 INFO L93 Difference]: Finished difference Result 164 states and 235 transitions. [2025-03-03 14:51:13,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:51:13,894 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2025-03-03 14:51:13,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:13,894 INFO L225 Difference]: With dead ends: 164 [2025-03-03 14:51:13,894 INFO L226 Difference]: Without dead ends: 162 [2025-03-03 14:51:13,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:51:13,895 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:13,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 544 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:13,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-03 14:51:13,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-03-03 14:51:13,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.434782608695652) internal successors, (231), 161 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:13,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 231 transitions. [2025-03-03 14:51:13,902 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 231 transitions. Word has length 46 [2025-03-03 14:51:13,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:13,902 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 231 transitions. [2025-03-03 14:51:13,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:13,902 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 231 transitions. [2025-03-03 14:51:13,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 14:51:13,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:13,903 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] [2025-03-03 14:51:13,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:51:13,903 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:13,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:13,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1763610702, now seen corresponding path program 1 times [2025-03-03 14:51:13,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:13,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241775848] [2025-03-03 14:51:13,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:13,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:13,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 14:51:13,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 14:51:13,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:13,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:13,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:13,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:13,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241775848] [2025-03-03 14:51:13,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241775848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:13,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:13,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:13,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789585873] [2025-03-03 14:51:13,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:13,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:13,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:13,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:13,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:13,961 INFO L87 Difference]: Start difference. First operand 162 states and 231 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:13,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:13,980 INFO L93 Difference]: Finished difference Result 308 states and 452 transitions. [2025-03-03 14:51:13,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:13,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-03 14:51:13,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:13,982 INFO L225 Difference]: With dead ends: 308 [2025-03-03 14:51:13,982 INFO L226 Difference]: Without dead ends: 232 [2025-03-03 14:51:13,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:13,983 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 47 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:13,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 186 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:13,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-03 14:51:13,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2025-03-03 14:51:13,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.4497816593886463) internal successors, (332), 229 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:13,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 332 transitions. [2025-03-03 14:51:13,996 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 332 transitions. Word has length 47 [2025-03-03 14:51:13,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:13,996 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 332 transitions. [2025-03-03 14:51:13,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:13,996 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 332 transitions. [2025-03-03 14:51:13,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 14:51:13,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:13,997 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] [2025-03-03 14:51:13,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:51:13,997 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:13,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:13,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1315665166, now seen corresponding path program 1 times [2025-03-03 14:51:13,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:13,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407193513] [2025-03-03 14:51:13,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:14,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:14,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 14:51:14,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 14:51:14,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:14,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:14,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:14,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:14,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407193513] [2025-03-03 14:51:14,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407193513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:14,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:14,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:14,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772095416] [2025-03-03 14:51:14,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:14,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:14,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:14,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:14,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:14,048 INFO L87 Difference]: Start difference. First operand 230 states and 332 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:14,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:14,065 INFO L93 Difference]: Finished difference Result 604 states and 892 transitions. [2025-03-03 14:51:14,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:14,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-03 14:51:14,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:14,067 INFO L225 Difference]: With dead ends: 604 [2025-03-03 14:51:14,068 INFO L226 Difference]: Without dead ends: 405 [2025-03-03 14:51:14,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:14,068 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 45 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:14,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 192 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:14,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-03-03 14:51:14,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 403. [2025-03-03 14:51:14,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 402 states have (on average 1.4527363184079602) internal successors, (584), 402 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:14,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 584 transitions. [2025-03-03 14:51:14,082 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 584 transitions. Word has length 47 [2025-03-03 14:51:14,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:14,082 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 584 transitions. [2025-03-03 14:51:14,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:14,083 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 584 transitions. [2025-03-03 14:51:14,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 14:51:14,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:14,097 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] [2025-03-03 14:51:14,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:51:14,097 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:14,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:14,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1730841038, now seen corresponding path program 1 times [2025-03-03 14:51:14,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:14,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630181914] [2025-03-03 14:51:14,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:14,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:14,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 14:51:14,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 14:51:14,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:14,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:14,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:14,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:14,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630181914] [2025-03-03 14:51:14,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630181914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:14,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:14,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:14,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833181382] [2025-03-03 14:51:14,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:14,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:14,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:14,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:14,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:14,160 INFO L87 Difference]: Start difference. First operand 403 states and 584 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:14,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:14,177 INFO L93 Difference]: Finished difference Result 1099 states and 1606 transitions. [2025-03-03 14:51:14,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:14,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-03 14:51:14,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:14,180 INFO L225 Difference]: With dead ends: 1099 [2025-03-03 14:51:14,180 INFO L226 Difference]: Without dead ends: 727 [2025-03-03 14:51:14,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:14,181 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 43 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:14,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 194 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:14,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-03-03 14:51:14,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 725. [2025-03-03 14:51:14,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 724 states have (on average 1.4364640883977902) internal successors, (1040), 724 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:14,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1040 transitions. [2025-03-03 14:51:14,198 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1040 transitions. Word has length 47 [2025-03-03 14:51:14,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:14,198 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1040 transitions. [2025-03-03 14:51:14,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:14,198 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1040 transitions. [2025-03-03 14:51:14,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 14:51:14,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:14,198 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] [2025-03-03 14:51:14,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:51:14,198 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:14,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:14,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1244122766, now seen corresponding path program 1 times [2025-03-03 14:51:14,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:14,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451027624] [2025-03-03 14:51:14,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:14,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:14,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 14:51:14,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 14:51:14,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:14,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:14,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:14,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:14,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451027624] [2025-03-03 14:51:14,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451027624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:14,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:14,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:14,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68012665] [2025-03-03 14:51:14,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:14,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:14,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:14,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:14,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:14,247 INFO L87 Difference]: Start difference. First operand 725 states and 1040 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:14,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:14,272 INFO L93 Difference]: Finished difference Result 2017 states and 2890 transitions. [2025-03-03 14:51:14,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:14,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-03 14:51:14,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:14,277 INFO L225 Difference]: With dead ends: 2017 [2025-03-03 14:51:14,277 INFO L226 Difference]: Without dead ends: 1323 [2025-03-03 14:51:14,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:14,278 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 41 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:14,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 196 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:14,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2025-03-03 14:51:14,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1321. [2025-03-03 14:51:14,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1320 states have (on average 1.406060606060606) internal successors, (1856), 1320 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:14,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1856 transitions. [2025-03-03 14:51:14,313 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1856 transitions. Word has length 47 [2025-03-03 14:51:14,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:14,313 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 1856 transitions. [2025-03-03 14:51:14,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:14,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1856 transitions. [2025-03-03 14:51:14,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 14:51:14,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:14,314 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] [2025-03-03 14:51:14,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:51:14,314 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:14,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:14,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1711699493, now seen corresponding path program 1 times [2025-03-03 14:51:14,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:14,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70629893] [2025-03-03 14:51:14,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:14,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:14,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 14:51:14,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 14:51:14,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:14,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:14,411 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:51:14,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:14,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70629893] [2025-03-03 14:51:14,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70629893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:14,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:14,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:51:14,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463484793] [2025-03-03 14:51:14,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:14,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:51:14,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:14,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:51:14,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:51:14,413 INFO L87 Difference]: Start difference. First operand 1321 states and 1856 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 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-03 14:51:14,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:14,569 INFO L93 Difference]: Finished difference Result 6411 states and 9045 transitions. [2025-03-03 14:51:14,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:51:14,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 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 64 [2025-03-03 14:51:14,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:14,587 INFO L225 Difference]: With dead ends: 6411 [2025-03-03 14:51:14,587 INFO L226 Difference]: Without dead ends: 5481 [2025-03-03 14:51:14,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:51:14,590 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 330 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:14,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 494 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:14,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5481 states. [2025-03-03 14:51:14,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5481 to 2433. [2025-03-03 14:51:14,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2433 states, 2432 states have (on average 1.4013157894736843) internal successors, (3408), 2432 states have internal predecessors, (3408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:14,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 3408 transitions. [2025-03-03 14:51:14,687 INFO L78 Accepts]: Start accepts. Automaton has 2433 states and 3408 transitions. Word has length 64 [2025-03-03 14:51:14,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:14,687 INFO L471 AbstractCegarLoop]: Abstraction has 2433 states and 3408 transitions. [2025-03-03 14:51:14,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 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-03 14:51:14,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 3408 transitions. [2025-03-03 14:51:14,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 14:51:14,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:14,689 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] [2025-03-03 14:51:14,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:51:14,689 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:14,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:14,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1263753957, now seen corresponding path program 1 times [2025-03-03 14:51:14,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:14,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605359600] [2025-03-03 14:51:14,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:14,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:14,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 14:51:14,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 14:51:14,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:14,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:14,798 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:51:14,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:14,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605359600] [2025-03-03 14:51:14,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605359600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:14,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:14,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:51:14,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153780184] [2025-03-03 14:51:14,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:14,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:51:14,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:14,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:51:14,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:51:14,799 INFO L87 Difference]: Start difference. First operand 2433 states and 3408 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 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-03 14:51:14,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:14,963 INFO L93 Difference]: Finished difference Result 7699 states and 10853 transitions. [2025-03-03 14:51:14,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:51:14,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 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 64 [2025-03-03 14:51:14,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:14,980 INFO L225 Difference]: With dead ends: 7699 [2025-03-03 14:51:14,980 INFO L226 Difference]: Without dead ends: 6409 [2025-03-03 14:51:14,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:51:14,983 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 330 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:14,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 488 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:51:14,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6409 states. [2025-03-03 14:51:15,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6409 to 4185. [2025-03-03 14:51:15,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4185 states, 4184 states have (on average 1.3977055449330784) internal successors, (5848), 4184 states have internal predecessors, (5848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:15,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4185 states to 4185 states and 5848 transitions. [2025-03-03 14:51:15,136 INFO L78 Accepts]: Start accepts. Automaton has 4185 states and 5848 transitions. Word has length 64 [2025-03-03 14:51:15,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:15,137 INFO L471 AbstractCegarLoop]: Abstraction has 4185 states and 5848 transitions. [2025-03-03 14:51:15,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 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-03 14:51:15,137 INFO L276 IsEmpty]: Start isEmpty. Operand 4185 states and 5848 transitions. [2025-03-03 14:51:15,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 14:51:15,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:15,138 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] [2025-03-03 14:51:15,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:51:15,139 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:15,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:15,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1678929829, now seen corresponding path program 1 times [2025-03-03 14:51:15,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:15,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017371883] [2025-03-03 14:51:15,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:15,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:15,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 14:51:15,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 14:51:15,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:15,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:15,228 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:51:15,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:15,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017371883] [2025-03-03 14:51:15,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017371883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:15,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:15,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:51:15,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57863915] [2025-03-03 14:51:15,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:15,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:51:15,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:15,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:51:15,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:51:15,229 INFO L87 Difference]: Start difference. First operand 4185 states and 5848 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:15,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:15,422 INFO L93 Difference]: Finished difference Result 8987 states and 12653 transitions. [2025-03-03 14:51:15,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:51:15,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 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-03 14:51:15,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:15,443 INFO L225 Difference]: With dead ends: 8987 [2025-03-03 14:51:15,443 INFO L226 Difference]: Without dead ends: 7697 [2025-03-03 14:51:15,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:51:15,447 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 352 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:15,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 471 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:51:15,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7697 states. [2025-03-03 14:51:15,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7697 to 5473. [2025-03-03 14:51:15,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5473 states, 5472 states have (on average 1.3976608187134503) internal successors, (7648), 5472 states have internal predecessors, (7648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:15,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5473 states to 5473 states and 7648 transitions. [2025-03-03 14:51:15,591 INFO L78 Accepts]: Start accepts. Automaton has 5473 states and 7648 transitions. Word has length 64 [2025-03-03 14:51:15,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:15,592 INFO L471 AbstractCegarLoop]: Abstraction has 5473 states and 7648 transitions. [2025-03-03 14:51:15,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:15,592 INFO L276 IsEmpty]: Start isEmpty. Operand 5473 states and 7648 transitions. [2025-03-03 14:51:15,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 14:51:15,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:15,596 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] [2025-03-03 14:51:15,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:51:15,596 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:15,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:15,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1192211557, now seen corresponding path program 1 times [2025-03-03 14:51:15,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:15,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284813110] [2025-03-03 14:51:15,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:15,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:15,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 14:51:15,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 14:51:15,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:15,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:15,708 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 14:51:15,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:15,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284813110] [2025-03-03 14:51:15,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284813110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:15,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:15,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:51:15,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172084049] [2025-03-03 14:51:15,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:15,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:51:15,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:15,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:51:15,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:51:15,710 INFO L87 Difference]: Start difference. First operand 5473 states and 7648 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:15,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:15,894 INFO L93 Difference]: Finished difference Result 10275 states and 14453 transitions. [2025-03-03 14:51:15,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:51:15,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 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-03 14:51:15,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:15,921 INFO L225 Difference]: With dead ends: 10275 [2025-03-03 14:51:15,922 INFO L226 Difference]: Without dead ends: 8985 [2025-03-03 14:51:15,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:51:15,927 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 344 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:15,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 481 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:51:15,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8985 states. [2025-03-03 14:51:16,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8985 to 6761. [2025-03-03 14:51:16,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6761 states, 6760 states have (on average 1.3976331360946745) internal successors, (9448), 6760 states have internal predecessors, (9448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:16,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6761 states to 6761 states and 9448 transitions. [2025-03-03 14:51:16,106 INFO L78 Accepts]: Start accepts. Automaton has 6761 states and 9448 transitions. Word has length 64 [2025-03-03 14:51:16,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:16,106 INFO L471 AbstractCegarLoop]: Abstraction has 6761 states and 9448 transitions. [2025-03-03 14:51:16,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:16,106 INFO L276 IsEmpty]: Start isEmpty. Operand 6761 states and 9448 transitions. [2025-03-03 14:51:16,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 14:51:16,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:16,108 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] [2025-03-03 14:51:16,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:51:16,108 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:16,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:16,108 INFO L85 PathProgramCache]: Analyzing trace with hash -312527480, now seen corresponding path program 1 times [2025-03-03 14:51:16,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:16,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125620804] [2025-03-03 14:51:16,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:16,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:16,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 14:51:16,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 14:51:16,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:16,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:16,175 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:16,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:16,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125620804] [2025-03-03 14:51:16,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125620804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:16,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:16,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:16,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958544822] [2025-03-03 14:51:16,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:16,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:16,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:16,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:16,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:16,176 INFO L87 Difference]: Start difference. First operand 6761 states and 9448 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-03 14:51:16,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:16,345 INFO L93 Difference]: Finished difference Result 13493 states and 18866 transitions. [2025-03-03 14:51:16,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:16,346 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-03 14:51:16,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:16,358 INFO L225 Difference]: With dead ends: 13493 [2025-03-03 14:51:16,358 INFO L226 Difference]: Without dead ends: 6763 [2025-03-03 14:51:16,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:16,368 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 37 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:16,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 186 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:16,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2025-03-03 14:51:16,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6761. [2025-03-03 14:51:16,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6761 states, 6760 states have (on average 1.3792899408284023) internal successors, (9324), 6760 states have internal predecessors, (9324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:16,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6761 states to 6761 states and 9324 transitions. [2025-03-03 14:51:16,555 INFO L78 Accepts]: Start accepts. Automaton has 6761 states and 9324 transitions. Word has length 65 [2025-03-03 14:51:16,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:16,556 INFO L471 AbstractCegarLoop]: Abstraction has 6761 states and 9324 transitions. [2025-03-03 14:51:16,558 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-03 14:51:16,559 INFO L276 IsEmpty]: Start isEmpty. Operand 6761 states and 9324 transitions. [2025-03-03 14:51:16,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 14:51:16,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:16,560 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] [2025-03-03 14:51:16,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:51:16,561 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:16,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:16,561 INFO L85 PathProgramCache]: Analyzing trace with hash 144484355, now seen corresponding path program 1 times [2025-03-03 14:51:16,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:16,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764087216] [2025-03-03 14:51:16,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:16,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:16,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:51:16,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:51:16,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:16,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:16,624 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:16,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:16,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764087216] [2025-03-03 14:51:16,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764087216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:16,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:16,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:16,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379656760] [2025-03-03 14:51:16,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:16,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:16,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:16,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:16,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:16,625 INFO L87 Difference]: Start difference. First operand 6761 states and 9324 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:16,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:16,687 INFO L93 Difference]: Finished difference Result 9334 states and 12908 transitions. [2025-03-03 14:51:16,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:16,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-03-03 14:51:16,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:16,691 INFO L225 Difference]: With dead ends: 9334 [2025-03-03 14:51:16,691 INFO L226 Difference]: Without dead ends: 2604 [2025-03-03 14:51:16,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:16,697 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 31 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:16,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 183 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:16,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2025-03-03 14:51:16,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 2596. [2025-03-03 14:51:16,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2596 states, 2595 states have (on average 1.373025048169557) internal successors, (3563), 2595 states have internal predecessors, (3563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:16,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2596 states to 2596 states and 3563 transitions. [2025-03-03 14:51:16,749 INFO L78 Accepts]: Start accepts. Automaton has 2596 states and 3563 transitions. Word has length 66 [2025-03-03 14:51:16,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:16,749 INFO L471 AbstractCegarLoop]: Abstraction has 2596 states and 3563 transitions. [2025-03-03 14:51:16,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:16,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2596 states and 3563 transitions. [2025-03-03 14:51:16,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 14:51:16,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:16,750 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] [2025-03-03 14:51:16,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:51:16,750 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:16,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:16,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1151726161, now seen corresponding path program 1 times [2025-03-03 14:51:16,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:16,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848333527] [2025-03-03 14:51:16,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:16,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:16,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 14:51:16,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 14:51:16,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:16,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:16,818 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:16,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:16,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848333527] [2025-03-03 14:51:16,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848333527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:16,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:16,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:16,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012013046] [2025-03-03 14:51:16,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:16,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:16,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:16,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:16,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:16,819 INFO L87 Difference]: Start difference. First operand 2596 states and 3563 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:16,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:16,846 INFO L93 Difference]: Finished difference Result 3876 states and 5325 transitions. [2025-03-03 14:51:16,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:16,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-03-03 14:51:16,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:16,849 INFO L225 Difference]: With dead ends: 3876 [2025-03-03 14:51:16,849 INFO L226 Difference]: Without dead ends: 1322 [2025-03-03 14:51:16,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:16,852 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 33 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:16,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 162 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:16,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2025-03-03 14:51:16,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2025-03-03 14:51:16,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.350265352539803) internal successors, (1781), 1319 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:16,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1781 transitions. [2025-03-03 14:51:16,878 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1781 transitions. Word has length 67 [2025-03-03 14:51:16,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:16,878 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1781 transitions. [2025-03-03 14:51:16,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:16,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1781 transitions. [2025-03-03 14:51:16,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 14:51:16,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:16,879 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] [2025-03-03 14:51:16,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:51:16,879 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:16,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:16,880 INFO L85 PathProgramCache]: Analyzing trace with hash 2015928054, now seen corresponding path program 1 times [2025-03-03 14:51:16,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:16,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183059241] [2025-03-03 14:51:16,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:16,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:16,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 14:51:16,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 14:51:16,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:16,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:16,947 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:16,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:16,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183059241] [2025-03-03 14:51:16,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183059241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:16,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:16,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:16,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864165145] [2025-03-03 14:51:16,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:16,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:16,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:16,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:16,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:16,948 INFO L87 Difference]: Start difference. First operand 1320 states and 1781 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:16,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:16,964 INFO L93 Difference]: Finished difference Result 1962 states and 2652 transitions. [2025-03-03 14:51:16,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:16,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-03 14:51:16,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:16,965 INFO L225 Difference]: With dead ends: 1962 [2025-03-03 14:51:16,965 INFO L226 Difference]: Without dead ends: 684 [2025-03-03 14:51:16,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:16,967 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 30 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:16,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 147 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:16,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-03-03 14:51:16,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 682. [2025-03-03 14:51:16,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 1.3230543318649046) internal successors, (901), 681 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 901 transitions. [2025-03-03 14:51:16,979 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 901 transitions. Word has length 69 [2025-03-03 14:51:16,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:16,979 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 901 transitions. [2025-03-03 14:51:16,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:16,979 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 901 transitions. [2025-03-03 14:51:16,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 14:51:16,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:16,979 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] [2025-03-03 14:51:16,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:51:16,980 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:16,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:16,980 INFO L85 PathProgramCache]: Analyzing trace with hash 698177885, now seen corresponding path program 1 times [2025-03-03 14:51:16,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:16,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927424087] [2025-03-03 14:51:16,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:16,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:16,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 14:51:17,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 14:51:17,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:17,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:18,255 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:18,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:18,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927424087] [2025-03-03 14:51:18,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927424087] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:51:18,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077188582] [2025-03-03 14:51:18,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:18,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:18,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:51:18,258 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:51:18,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:51:18,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 14:51:18,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 14:51:18,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:18,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:18,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 14:51:18,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:51:18,792 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:18,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:51:19,439 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:19,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077188582] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:51:19,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:51:19,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2025-03-03 14:51:19,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844201649] [2025-03-03 14:51:19,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:51:19,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-03 14:51:19,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:19,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-03 14:51:19,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2025-03-03 14:51:19,441 INFO L87 Difference]: Start difference. First operand 682 states and 901 transitions. Second operand has 29 states, 29 states have (on average 6.379310344827586) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:21,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:21,345 INFO L93 Difference]: Finished difference Result 3820 states and 5154 transitions. [2025-03-03 14:51:21,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-03 14:51:21,345 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.379310344827586) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 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 71 [2025-03-03 14:51:21,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:21,351 INFO L225 Difference]: With dead ends: 3820 [2025-03-03 14:51:21,351 INFO L226 Difference]: Without dead ends: 3180 [2025-03-03 14:51:21,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=913, Invalid=3779, Unknown=0, NotChecked=0, Total=4692 [2025-03-03 14:51:21,354 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 1516 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:21,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 926 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 14:51:21,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3180 states. [2025-03-03 14:51:21,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3180 to 3124. [2025-03-03 14:51:21,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3124 states, 3123 states have (on average 1.313480627601665) internal successors, (4102), 3123 states have internal predecessors, (4102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:21,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 4102 transitions. [2025-03-03 14:51:21,413 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 4102 transitions. Word has length 71 [2025-03-03 14:51:21,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:21,413 INFO L471 AbstractCegarLoop]: Abstraction has 3124 states and 4102 transitions. [2025-03-03 14:51:21,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.379310344827586) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:21,413 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 4102 transitions. [2025-03-03 14:51:21,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 14:51:21,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:21,414 INFO L218 NwaCegarLoop]: trace histogram [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-03 14:51:21,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:51:21,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:21,616 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:21,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:21,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2015357357, now seen corresponding path program 1 times [2025-03-03 14:51:21,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:21,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849259331] [2025-03-03 14:51:21,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:21,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:21,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 14:51:21,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 14:51:21,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:21,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:21,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:21,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849259331] [2025-03-03 14:51:21,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849259331] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:51:21,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025734503] [2025-03-03 14:51:21,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:21,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:21,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:51:21,918 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:51:21,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:51:21,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 14:51:22,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 14:51:22,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:22,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:22,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:51:22,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:51:22,329 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:22,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:51:22,894 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:22,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025734503] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:51:22,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:51:22,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-03 14:51:22,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970763098] [2025-03-03 14:51:22,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:51:22,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 14:51:22,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:22,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 14:51:22,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2025-03-03 14:51:22,896 INFO L87 Difference]: Start difference. First operand 3124 states and 4102 transitions. Second operand has 23 states, 23 states have (on average 7.478260869565218) internal successors, (172), 22 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:23,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:23,248 INFO L93 Difference]: Finished difference Result 6342 states and 8362 transitions. [2025-03-03 14:51:23,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 14:51:23,249 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.478260869565218) internal successors, (172), 22 states have internal predecessors, (172), 0 states have call successors, (0), 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 72 [2025-03-03 14:51:23,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:23,254 INFO L225 Difference]: With dead ends: 6342 [2025-03-03 14:51:23,254 INFO L226 Difference]: Without dead ends: 3260 [2025-03-03 14:51:23,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 14:51:23,258 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 848 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:23,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 398 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:51:23,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3260 states. [2025-03-03 14:51:23,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3260 to 2772. [2025-03-03 14:51:23,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2772 states, 2771 states have (on average 1.3016961385781307) internal successors, (3607), 2771 states have internal predecessors, (3607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2772 states to 2772 states and 3607 transitions. [2025-03-03 14:51:23,311 INFO L78 Accepts]: Start accepts. Automaton has 2772 states and 3607 transitions. Word has length 72 [2025-03-03 14:51:23,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:23,311 INFO L471 AbstractCegarLoop]: Abstraction has 2772 states and 3607 transitions. [2025-03-03 14:51:23,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.478260869565218) internal successors, (172), 22 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:23,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2772 states and 3607 transitions. [2025-03-03 14:51:23,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 14:51:23,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:23,312 INFO L218 NwaCegarLoop]: trace histogram [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-03 14:51:23,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:51:23,517 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,SelfDestructingSolverStorable19 [2025-03-03 14:51:23,517 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:23,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:23,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1623098189, now seen corresponding path program 1 times [2025-03-03 14:51:23,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:23,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007726052] [2025-03-03 14:51:23,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:23,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:23,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 14:51:23,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 14:51:23,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:23,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:23,784 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:23,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:23,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007726052] [2025-03-03 14:51:23,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007726052] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:51:23,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36813064] [2025-03-03 14:51:23,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:23,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:23,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:51:23,787 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:51:23,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:51:23,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 14:51:23,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 14:51:23,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:23,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:23,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:51:23,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:51:24,217 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:24,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:51:24,700 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:24,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36813064] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:51:24,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:51:24,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-03-03 14:51:24,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268404997] [2025-03-03 14:51:24,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:51:24,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 14:51:24,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:24,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 14:51:24,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-03-03 14:51:24,701 INFO L87 Difference]: Start difference. First operand 2772 states and 3607 transitions. Second operand has 26 states, 26 states have (on average 7.3076923076923075) internal successors, (190), 25 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:25,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:25,679 INFO L93 Difference]: Finished difference Result 14226 states and 18662 transitions. [2025-03-03 14:51:25,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-03 14:51:25,679 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.3076923076923075) internal successors, (190), 25 states have internal predecessors, (190), 0 states have call successors, (0), 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 72 [2025-03-03 14:51:25,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:25,696 INFO L225 Difference]: With dead ends: 14226 [2025-03-03 14:51:25,696 INFO L226 Difference]: Without dead ends: 11496 [2025-03-03 14:51:25,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=617, Invalid=2353, Unknown=0, NotChecked=0, Total=2970 [2025-03-03 14:51:25,701 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 1374 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:25,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 925 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:51:25,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11496 states. [2025-03-03 14:51:25,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11496 to 11308. [2025-03-03 14:51:25,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11308 states, 11307 states have (on average 1.2801804192093393) internal successors, (14475), 11307 states have internal predecessors, (14475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:25,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11308 states to 11308 states and 14475 transitions. [2025-03-03 14:51:25,934 INFO L78 Accepts]: Start accepts. Automaton has 11308 states and 14475 transitions. Word has length 72 [2025-03-03 14:51:25,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:25,934 INFO L471 AbstractCegarLoop]: Abstraction has 11308 states and 14475 transitions. [2025-03-03 14:51:25,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.3076923076923075) internal successors, (190), 25 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:25,935 INFO L276 IsEmpty]: Start isEmpty. Operand 11308 states and 14475 transitions. [2025-03-03 14:51:25,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 14:51:25,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:25,937 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:51:25,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:51:26,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:26,141 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:26,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:26,142 INFO L85 PathProgramCache]: Analyzing trace with hash 678209015, now seen corresponding path program 1 times [2025-03-03 14:51:26,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:26,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771417736] [2025-03-03 14:51:26,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:26,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:26,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 14:51:26,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 14:51:26,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:26,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:26,922 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:26,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:26,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771417736] [2025-03-03 14:51:26,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771417736] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:51:26,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582203915] [2025-03-03 14:51:26,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:26,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:26,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:51:26,924 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:51:26,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:51:26,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 14:51:27,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 14:51:27,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:27,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:27,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 14:51:27,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:51:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:27,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:51:28,581 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:28,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582203915] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:51:28,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:51:28,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 36 [2025-03-03 14:51:28,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989627526] [2025-03-03 14:51:28,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:51:28,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 14:51:28,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:28,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 14:51:28,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1148, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 14:51:28,583 INFO L87 Difference]: Start difference. First operand 11308 states and 14475 transitions. Second operand has 36 states, 36 states have (on average 5.75) internal successors, (207), 36 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:33,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:33,992 INFO L93 Difference]: Finished difference Result 27180 states and 34763 transitions. [2025-03-03 14:51:33,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-03-03 14:51:33,992 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.75) internal successors, (207), 36 states have internal predecessors, (207), 0 states have call successors, (0), 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 74 [2025-03-03 14:51:33,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:34,017 INFO L225 Difference]: With dead ends: 27180 [2025-03-03 14:51:34,017 INFO L226 Difference]: Without dead ends: 22090 [2025-03-03 14:51:34,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3578 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=2270, Invalid=10162, Unknown=0, NotChecked=0, Total=12432 [2025-03-03 14:51:34,025 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 2764 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2764 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 1774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:34,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2764 Valid, 1404 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 14:51:34,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22090 states. [2025-03-03 14:51:34,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22090 to 10556. [2025-03-03 14:51:34,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10556 states, 10555 states have (on average 1.2811937470393178) internal successors, (13523), 10555 states have internal predecessors, (13523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:34,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10556 states to 10556 states and 13523 transitions. [2025-03-03 14:51:34,365 INFO L78 Accepts]: Start accepts. Automaton has 10556 states and 13523 transitions. Word has length 74 [2025-03-03 14:51:34,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:34,365 INFO L471 AbstractCegarLoop]: Abstraction has 10556 states and 13523 transitions. [2025-03-03 14:51:34,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.75) internal successors, (207), 36 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:34,365 INFO L276 IsEmpty]: Start isEmpty. Operand 10556 states and 13523 transitions. [2025-03-03 14:51:34,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 14:51:34,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:34,367 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:51:34,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:51:34,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:34,568 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:34,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:34,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1342630264, now seen corresponding path program 1 times [2025-03-03 14:51:34,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:34,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585181310] [2025-03-03 14:51:34,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:34,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:34,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 14:51:34,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 14:51:34,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:34,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:35,471 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:35,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:35,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585181310] [2025-03-03 14:51:35,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585181310] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:51:35,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770480289] [2025-03-03 14:51:35,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:35,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:35,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:51:35,474 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:51:35,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:51:35,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 14:51:35,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 14:51:35,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:35,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:35,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-03 14:51:35,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:51:38,705 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:38,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:51:41,806 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:41,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770480289] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:51:41,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:51:41,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 27, 24] total 66 [2025-03-03 14:51:41,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956613422] [2025-03-03 14:51:41,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:51:41,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-03-03 14:51:41,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:41,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-03-03 14:51:41,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=3783, Unknown=0, NotChecked=0, Total=4290 [2025-03-03 14:51:41,808 INFO L87 Difference]: Start difference. First operand 10556 states and 13523 transitions. Second operand has 66 states, 66 states have (on average 3.0606060606060606) internal successors, (202), 66 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:34,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:34,978 INFO L93 Difference]: Finished difference Result 29142 states and 37091 transitions. [2025-03-03 14:52:34,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2025-03-03 14:52:34,979 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 3.0606060606060606) internal successors, (202), 66 states have internal predecessors, (202), 0 states have call successors, (0), 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 74 [2025-03-03 14:52:34,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:35,004 INFO L225 Difference]: With dead ends: 29142 [2025-03-03 14:52:35,004 INFO L226 Difference]: Without dead ends: 24952 [2025-03-03 14:52:35,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35313 ImplicationChecksByTransitivity, 51.4s TimeCoverageRelationStatistics Valid=14795, Invalid=74307, Unknown=0, NotChecked=0, Total=89102 [2025-03-03 14:52:35,019 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 4758 mSDsluCounter, 3374 mSDsCounter, 0 mSdLazyCounter, 5456 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4758 SdHoareTripleChecker+Valid, 3501 SdHoareTripleChecker+Invalid, 5618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 5456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-03 14:52:35,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4758 Valid, 3501 Invalid, 5618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 5456 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-03 14:52:35,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24952 states. [2025-03-03 14:52:35,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24952 to 14573. [2025-03-03 14:52:35,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14573 states, 14572 states have (on average 1.2833516332692836) internal successors, (18701), 14572 states have internal predecessors, (18701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:35,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14573 states to 14573 states and 18701 transitions. [2025-03-03 14:52:35,507 INFO L78 Accepts]: Start accepts. Automaton has 14573 states and 18701 transitions. Word has length 74 [2025-03-03 14:52:35,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:35,507 INFO L471 AbstractCegarLoop]: Abstraction has 14573 states and 18701 transitions. [2025-03-03 14:52:35,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 3.0606060606060606) internal successors, (202), 66 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:35,508 INFO L276 IsEmpty]: Start isEmpty. Operand 14573 states and 18701 transitions. [2025-03-03 14:52:35,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 14:52:35,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:35,509 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] [2025-03-03 14:52:35,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:52:35,709 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,SelfDestructingSolverStorable22 [2025-03-03 14:52:35,710 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:35,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:35,710 INFO L85 PathProgramCache]: Analyzing trace with hash 279957331, now seen corresponding path program 1 times [2025-03-03 14:52:35,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:35,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551305613] [2025-03-03 14:52:35,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:35,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:35,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 14:52:35,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 14:52:35,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:35,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:35,804 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:52:35,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:35,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551305613] [2025-03-03 14:52:35,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551305613] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:52:35,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119282489] [2025-03-03 14:52:35,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:35,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:52:35,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:52:35,807 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-03 14:52:35,809 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-03 14:52:35,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 14:52:35,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 14:52:35,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:35,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:35,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 14:52:35,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:52:36,025 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:36,026 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:52:36,258 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:36,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119282489] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:52:36,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:52:36,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 6] total 13 [2025-03-03 14:52:36,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875429777] [2025-03-03 14:52:36,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:52:36,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 14:52:36,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:36,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 14:52:36,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:52:36,260 INFO L87 Difference]: Start difference. First operand 14573 states and 18701 transitions. Second operand has 13 states, 13 states have (on average 16.153846153846153) internal successors, (210), 13 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:38,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:38,590 INFO L93 Difference]: Finished difference Result 68983 states and 87320 transitions. [2025-03-03 14:52:38,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 14:52:38,590 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 16.153846153846153) internal successors, (210), 13 states have internal predecessors, (210), 0 states have call successors, (0), 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 75 [2025-03-03 14:52:38,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:38,654 INFO L225 Difference]: With dead ends: 68983 [2025-03-03 14:52:38,654 INFO L226 Difference]: Without dead ends: 53716 [2025-03-03 14:52:38,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2025-03-03 14:52:38,669 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 258 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:52:38,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 946 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:52:38,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53716 states. [2025-03-03 14:52:40,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53716 to 48281. [2025-03-03 14:52:40,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48281 states, 48280 states have (on average 1.2445318972659487) internal successors, (60086), 48280 states have internal predecessors, (60086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48281 states to 48281 states and 60086 transitions. [2025-03-03 14:52:40,645 INFO L78 Accepts]: Start accepts. Automaton has 48281 states and 60086 transitions. Word has length 75 [2025-03-03 14:52:40,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:40,645 INFO L471 AbstractCegarLoop]: Abstraction has 48281 states and 60086 transitions. [2025-03-03 14:52:40,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 16.153846153846153) internal successors, (210), 13 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:40,645 INFO L276 IsEmpty]: Start isEmpty. Operand 48281 states and 60086 transitions. [2025-03-03 14:52:40,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 14:52:40,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:40,646 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] [2025-03-03 14:52:40,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 14:52:40,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:52:40,847 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:40,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:40,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1758874955, now seen corresponding path program 1 times [2025-03-03 14:52:40,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:40,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517271231] [2025-03-03 14:52:40,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:40,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:40,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 14:52:40,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 14:52:40,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:40,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat