./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_opt-floodmax.3.1.ufo.BOUNDED-6.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 c6267d36e2eda753e26c9c989bedb16747ddf010783b33bee2d0cb2d2001d5ce --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:03:38,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:03:38,814 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:03:38,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:03:38,828 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:03:38,868 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:03:38,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:03:38,869 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:03:38,869 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:03:38,869 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:03:38,869 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:03:38,870 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:03:38,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:03:38,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:03:38,871 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:03:38,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:03:38,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:03:38,876 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:03:38,876 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:03:38,876 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:03:38,876 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:03:38,876 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:03:38,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:03:38,876 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:03:38,876 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:03:38,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:03:38,876 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:03:38,876 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:03:38,876 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:03:38,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:03:38,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:03:38,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:03:38,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:03:38,876 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:03:38,876 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:03:38,876 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:03:38,876 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:03:38,876 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:03:38,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:03:38,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:03:38,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:03:38,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:03:38,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:03:38,877 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 -> c6267d36e2eda753e26c9c989bedb16747ddf010783b33bee2d0cb2d2001d5ce [2025-03-08 06:03:39,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:03:39,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:03:39,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:03:39,224 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:03:39,225 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:03:39,226 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2025-03-08 06:03:40,851 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c24db10ae/c049e1a42bd44cf1b2f9a442acde93a4/FLAGd2f9e1a43 [2025-03-08 06:03:41,351 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:03:41,351 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2025-03-08 06:03:41,375 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c24db10ae/c049e1a42bd44cf1b2f9a442acde93a4/FLAGd2f9e1a43 [2025-03-08 06:03:41,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c24db10ae/c049e1a42bd44cf1b2f9a442acde93a4 [2025-03-08 06:03:41,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:03:41,485 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:03:41,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:03:41,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:03:41,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:03:41,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:03:41" (1/1) ... [2025-03-08 06:03:41,501 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5df45912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:03:41, skipping insertion in model container [2025-03-08 06:03:41,501 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:03:41" (1/1) ... [2025-03-08 06:03:41,538 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:03:41,838 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_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c[12747,12760] [2025-03-08 06:03:41,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:03:41,882 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:03:41,921 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_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c[12747,12760] [2025-03-08 06:03:41,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:03:41,932 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:03:41,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:03:41 WrapperNode [2025-03-08 06:03:41,932 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:03:41,933 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:03:41,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:03:41,933 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:03:41,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:03:41" (1/1) ... [2025-03-08 06:03:41,944 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:03:41" (1/1) ... [2025-03-08 06:03:41,974 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 479 [2025-03-08 06:03:41,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:03:41,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:03:41,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:03:41,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:03:41,984 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:03:41" (1/1) ... [2025-03-08 06:03:41,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:03:41" (1/1) ... [2025-03-08 06:03:41,987 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:03:41" (1/1) ... [2025-03-08 06:03:42,038 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-08 06:03:42,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:03:41" (1/1) ... [2025-03-08 06:03:42,043 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:03:41" (1/1) ... [2025-03-08 06:03:42,055 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:03:41" (1/1) ... [2025-03-08 06:03:42,061 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:03:41" (1/1) ... [2025-03-08 06:03:42,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:03:41" (1/1) ... [2025-03-08 06:03:42,067 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:03:41" (1/1) ... [2025-03-08 06:03:42,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:03:42,077 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:03:42,077 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:03:42,077 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:03:42,078 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:03:41" (1/1) ... [2025-03-08 06:03:42,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:03:42,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:03:42,162 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-08 06:03:42,186 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-08 06:03:42,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:03:42,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:03:42,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:03:42,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:03:42,373 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:03:42,378 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:03:43,106 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-03-08 06:03:43,106 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:03:43,130 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:03:43,131 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:03:43,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:03:43 BoogieIcfgContainer [2025-03-08 06:03:43,132 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:03:43,135 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:03:43,136 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:03:43,140 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:03:43,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:03:41" (1/3) ... [2025-03-08 06:03:43,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ba467a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:03:43, skipping insertion in model container [2025-03-08 06:03:43,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:03:41" (2/3) ... [2025-03-08 06:03:43,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ba467a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:03:43, skipping insertion in model container [2025-03-08 06:03:43,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:03:43" (3/3) ... [2025-03-08 06:03:43,143 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2025-03-08 06:03:43,166 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:03:43,172 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c that has 1 procedures, 124 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 06:03:43,256 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:03:43,272 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;@36db0b02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:03:43,272 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:03:43,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 122 states have (on average 1.7704918032786885) internal successors, (216), 123 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:43,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 06:03:43,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:03:43,285 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] [2025-03-08 06:03:43,286 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:03:43,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:03:43,291 INFO L85 PathProgramCache]: Analyzing trace with hash -588884754, now seen corresponding path program 1 times [2025-03-08 06:03:43,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:03:43,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172069621] [2025-03-08 06:03:43,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:43,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:03:43,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 06:03:43,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 06:03:43,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:43,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:43,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-08 06:03:44,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:03:44,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172069621] [2025-03-08 06:03:44,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172069621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:03:44,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:03:44,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:03:44,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271393149] [2025-03-08 06:03:44,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:03:44,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:03:44,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:03:44,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:03:44,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:03:44,044 INFO L87 Difference]: Start difference. First operand has 124 states, 122 states have (on average 1.7704918032786885) internal successors, (216), 123 states have internal predecessors, (216), 0 states have call successors, (0), 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 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:44,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:03:44,208 INFO L93 Difference]: Finished difference Result 265 states and 457 transitions. [2025-03-08 06:03:44,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:03:44,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-03-08 06:03:44,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:03:44,217 INFO L225 Difference]: With dead ends: 265 [2025-03-08 06:03:44,218 INFO L226 Difference]: Without dead ends: 188 [2025-03-08 06:03:44,220 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-08 06:03:44,223 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 114 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:03:44,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 808 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:03:44,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-08 06:03:44,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 121. [2025-03-08 06:03:44,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.5583333333333333) internal successors, (187), 120 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:44,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 187 transitions. [2025-03-08 06:03:44,272 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 187 transitions. Word has length 37 [2025-03-08 06:03:44,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:03:44,276 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 187 transitions. [2025-03-08 06:03:44,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:44,276 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 187 transitions. [2025-03-08 06:03:44,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 06:03:44,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:03:44,279 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:03:44,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:03:44,279 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:03:44,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:03:44,280 INFO L85 PathProgramCache]: Analyzing trace with hash 332717847, now seen corresponding path program 1 times [2025-03-08 06:03:44,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:03:44,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075880158] [2025-03-08 06:03:44,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:44,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:03:44,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 06:03:44,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 06:03:44,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:44,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:44,536 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-08 06:03:44,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:03:44,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075880158] [2025-03-08 06:03:44,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075880158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:03:44,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:03:44,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:03:44,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526806945] [2025-03-08 06:03:44,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:03:44,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:03:44,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:03:44,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:03:44,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:03:44,544 INFO L87 Difference]: Start difference. First operand 121 states and 187 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:44,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:03:44,634 INFO L93 Difference]: Finished difference Result 245 states and 399 transitions. [2025-03-08 06:03:44,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:03:44,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-08 06:03:44,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:03:44,635 INFO L225 Difference]: With dead ends: 245 [2025-03-08 06:03:44,642 INFO L226 Difference]: Without dead ends: 178 [2025-03-08 06:03:44,643 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-08 06:03:44,643 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 89 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:03:44,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 336 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:03:44,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-08 06:03:44,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2025-03-08 06:03:44,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 1.5885714285714285) internal successors, (278), 175 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:44,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 278 transitions. [2025-03-08 06:03:44,671 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 278 transitions. Word has length 60 [2025-03-08 06:03:44,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:03:44,672 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 278 transitions. [2025-03-08 06:03:44,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:44,672 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 278 transitions. [2025-03-08 06:03:44,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 06:03:44,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:03:44,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:03:44,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:03:44,673 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:03:44,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:03:44,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1424558564, now seen corresponding path program 1 times [2025-03-08 06:03:44,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:03:44,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114548428] [2025-03-08 06:03:44,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:44,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:03:44,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 06:03:44,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 06:03:44,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:44,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:44,866 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-08 06:03:44,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:03:44,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114548428] [2025-03-08 06:03:44,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114548428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:03:44,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:03:44,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:03:44,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433690400] [2025-03-08 06:03:44,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:03:44,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:03:44,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:03:44,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:03:44,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:03:44,872 INFO L87 Difference]: Start difference. First operand 176 states and 278 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:44,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:03:44,917 INFO L93 Difference]: Finished difference Result 404 states and 662 transitions. [2025-03-08 06:03:44,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:03:44,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-08 06:03:44,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:03:44,919 INFO L225 Difference]: With dead ends: 404 [2025-03-08 06:03:44,925 INFO L226 Difference]: Without dead ends: 282 [2025-03-08 06:03:44,926 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-08 06:03:44,927 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 91 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:03:44,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 344 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:03:44,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-08 06:03:44,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2025-03-08 06:03:44,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 279 states have (on average 1.6236559139784945) internal successors, (453), 279 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:44,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 453 transitions. [2025-03-08 06:03:44,961 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 453 transitions. Word has length 62 [2025-03-08 06:03:44,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:03:44,962 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 453 transitions. [2025-03-08 06:03:44,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:44,962 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 453 transitions. [2025-03-08 06:03:44,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:03:44,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:03:44,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:03:44,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:03:44,963 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:03:44,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:03:44,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1203852673, now seen corresponding path program 1 times [2025-03-08 06:03:44,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:03:44,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850727811] [2025-03-08 06:03:44,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:44,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:03:44,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:03:45,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:03:45,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:45,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:45,187 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-08 06:03:45,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:03:45,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850727811] [2025-03-08 06:03:45,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850727811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:03:45,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:03:45,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:03:45,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071782908] [2025-03-08 06:03:45,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:03:45,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:03:45,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:03:45,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:03:45,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:03:45,188 INFO L87 Difference]: Start difference. First operand 280 states and 453 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:45,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:03:45,245 INFO L93 Difference]: Finished difference Result 700 states and 1159 transitions. [2025-03-08 06:03:45,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:03:45,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-08 06:03:45,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:03:45,247 INFO L225 Difference]: With dead ends: 700 [2025-03-08 06:03:45,247 INFO L226 Difference]: Without dead ends: 474 [2025-03-08 06:03:45,247 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-08 06:03:45,248 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 85 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:03:45,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 345 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:03:45,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-03-08 06:03:45,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 472. [2025-03-08 06:03:45,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 1.6411889596602973) internal successors, (773), 471 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:45,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 773 transitions. [2025-03-08 06:03:45,260 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 773 transitions. Word has length 64 [2025-03-08 06:03:45,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:03:45,260 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 773 transitions. [2025-03-08 06:03:45,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:45,260 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 773 transitions. [2025-03-08 06:03:45,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:03:45,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:03:45,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:03:45,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:03:45,262 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:03:45,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:03:45,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1367395002, now seen corresponding path program 1 times [2025-03-08 06:03:45,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:03:45,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244832476] [2025-03-08 06:03:45,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:45,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:03:45,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:03:45,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:03:45,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:45,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:45,490 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-08 06:03:45,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:03:45,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244832476] [2025-03-08 06:03:45,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244832476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:03:45,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:03:45,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:03:45,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785103804] [2025-03-08 06:03:45,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:03:45,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:03:45,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:03:45,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:03:45,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:03:45,492 INFO L87 Difference]: Start difference. First operand 472 states and 773 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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-08 06:03:45,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:03:45,760 INFO L93 Difference]: Finished difference Result 2012 states and 3391 transitions. [2025-03-08 06:03:45,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:03:45,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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-08 06:03:45,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:03:45,780 INFO L225 Difference]: With dead ends: 2012 [2025-03-08 06:03:45,784 INFO L226 Difference]: Without dead ends: 1594 [2025-03-08 06:03:45,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:03:45,787 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 658 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:03:45,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1257 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:03:45,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2025-03-08 06:03:45,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 837. [2025-03-08 06:03:45,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.6566985645933014) internal successors, (1385), 836 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:45,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1385 transitions. [2025-03-08 06:03:45,900 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1385 transitions. Word has length 66 [2025-03-08 06:03:45,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:03:45,901 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1385 transitions. [2025-03-08 06:03:45,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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-08 06:03:45,901 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1385 transitions. [2025-03-08 06:03:45,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 06:03:45,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:03:45,923 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:03:45,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:03:45,923 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:03:45,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:03:45,923 INFO L85 PathProgramCache]: Analyzing trace with hash 611283093, now seen corresponding path program 1 times [2025-03-08 06:03:45,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:03:45,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59891044] [2025-03-08 06:03:45,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:45,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:03:45,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 06:03:46,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 06:03:46,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:46,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:46,154 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-08 06:03:46,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:03:46,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59891044] [2025-03-08 06:03:46,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59891044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:03:46,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:03:46,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:03:46,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772170810] [2025-03-08 06:03:46,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:03:46,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:03:46,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:03:46,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:03:46,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:03:46,156 INFO L87 Difference]: Start difference. First operand 837 states and 1385 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 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-08 06:03:46,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:03:46,326 INFO L93 Difference]: Finished difference Result 2438 states and 4100 transitions. [2025-03-08 06:03:46,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:03:46,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 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-08 06:03:46,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:03:46,338 INFO L225 Difference]: With dead ends: 2438 [2025-03-08 06:03:46,342 INFO L226 Difference]: Without dead ends: 1655 [2025-03-08 06:03:46,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:03:46,345 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 331 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:03:46,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 606 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:03:46,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2025-03-08 06:03:46,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1237. [2025-03-08 06:03:46,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1236 states have (on average 1.6642394822006472) internal successors, (2057), 1236 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:46,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 2057 transitions. [2025-03-08 06:03:46,429 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 2057 transitions. Word has length 67 [2025-03-08 06:03:46,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:03:46,429 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 2057 transitions. [2025-03-08 06:03:46,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 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-08 06:03:46,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 2057 transitions. [2025-03-08 06:03:46,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 06:03:46,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:03:46,435 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:03:46,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:03:46,436 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:03:46,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:03:46,436 INFO L85 PathProgramCache]: Analyzing trace with hash -940728776, now seen corresponding path program 1 times [2025-03-08 06:03:46,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:03:46,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956972361] [2025-03-08 06:03:46,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:46,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:03:46,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 06:03:46,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 06:03:46,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:46,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:46,642 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-08 06:03:46,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:03:46,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956972361] [2025-03-08 06:03:46,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956972361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:03:46,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:03:46,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:03:46,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605298658] [2025-03-08 06:03:46,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:03:46,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:03:46,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:03:46,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:03:46,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:03:46,646 INFO L87 Difference]: Start difference. First operand 1237 states and 2057 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:46,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:03:46,707 INFO L93 Difference]: Finished difference Result 2752 states and 4627 transitions. [2025-03-08 06:03:46,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:03:46,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-03-08 06:03:46,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:03:46,717 INFO L225 Difference]: With dead ends: 2752 [2025-03-08 06:03:46,718 INFO L226 Difference]: Without dead ends: 1894 [2025-03-08 06:03:46,721 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-08 06:03:46,722 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 98 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:03:46,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 425 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:03:46,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2025-03-08 06:03:46,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1892. [2025-03-08 06:03:46,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1891 states have (on average 1.6636700158646218) internal successors, (3146), 1891 states have internal predecessors, (3146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:46,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 3146 transitions. [2025-03-08 06:03:46,801 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 3146 transitions. Word has length 68 [2025-03-08 06:03:46,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:03:46,802 INFO L471 AbstractCegarLoop]: Abstraction has 1892 states and 3146 transitions. [2025-03-08 06:03:46,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:46,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 3146 transitions. [2025-03-08 06:03:46,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 06:03:46,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:03:46,804 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:03:46,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:03:46,805 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:03:46,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:03:46,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1377028504, now seen corresponding path program 1 times [2025-03-08 06:03:46,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:03:46,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822448627] [2025-03-08 06:03:46,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:46,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:03:46,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 06:03:46,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 06:03:46,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:46,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:46,982 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-08 06:03:46,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:03:46,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822448627] [2025-03-08 06:03:46,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822448627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:03:46,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:03:46,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:03:46,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419799268] [2025-03-08 06:03:46,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:03:46,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:03:46,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:03:46,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:03:46,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:03:46,983 INFO L87 Difference]: Start difference. First operand 1892 states and 3146 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:47,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:03:47,039 INFO L93 Difference]: Finished difference Result 3736 states and 6225 transitions. [2025-03-08 06:03:47,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:03:47,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-03-08 06:03:47,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:03:47,049 INFO L225 Difference]: With dead ends: 3736 [2025-03-08 06:03:47,049 INFO L226 Difference]: Without dead ends: 2678 [2025-03-08 06:03:47,051 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-08 06:03:47,052 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 92 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:03:47,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 423 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:03:47,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2678 states. [2025-03-08 06:03:47,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2678 to 2676. [2025-03-08 06:03:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2676 states, 2675 states have (on average 1.652336448598131) internal successors, (4420), 2675 states have internal predecessors, (4420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:47,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2676 states and 4420 transitions. [2025-03-08 06:03:47,145 INFO L78 Accepts]: Start accepts. Automaton has 2676 states and 4420 transitions. Word has length 68 [2025-03-08 06:03:47,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:03:47,145 INFO L471 AbstractCegarLoop]: Abstraction has 2676 states and 4420 transitions. [2025-03-08 06:03:47,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:47,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2676 states and 4420 transitions. [2025-03-08 06:03:47,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 06:03:47,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:03:47,146 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:03:47,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:03:47,146 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:03:47,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:03:47,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1818914852, now seen corresponding path program 1 times [2025-03-08 06:03:47,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:03:47,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181920991] [2025-03-08 06:03:47,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:47,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:03:47,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 06:03:47,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 06:03:47,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:47,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:47,293 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-08 06:03:47,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:03:47,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181920991] [2025-03-08 06:03:47,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181920991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:03:47,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:03:47,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:03:47,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857384559] [2025-03-08 06:03:47,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:03:47,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:03:47,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:03:47,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:03:47,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:03:47,301 INFO L87 Difference]: Start difference. First operand 2676 states and 4420 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:47,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:03:47,509 INFO L93 Difference]: Finished difference Result 8472 states and 14048 transitions. [2025-03-08 06:03:47,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:03:47,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-03-08 06:03:47,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:03:47,564 INFO L225 Difference]: With dead ends: 8472 [2025-03-08 06:03:47,564 INFO L226 Difference]: Without dead ends: 5860 [2025-03-08 06:03:47,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:03:47,577 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 330 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:03:47,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 596 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:03:47,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5860 states. [2025-03-08 06:03:48,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5860 to 4249. [2025-03-08 06:03:48,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4249 states, 4248 states have (on average 1.643361581920904) internal successors, (6981), 4248 states have internal predecessors, (6981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:48,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4249 states to 4249 states and 6981 transitions. [2025-03-08 06:03:48,059 INFO L78 Accepts]: Start accepts. Automaton has 4249 states and 6981 transitions. Word has length 68 [2025-03-08 06:03:48,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:03:48,060 INFO L471 AbstractCegarLoop]: Abstraction has 4249 states and 6981 transitions. [2025-03-08 06:03:48,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:48,060 INFO L276 IsEmpty]: Start isEmpty. Operand 4249 states and 6981 transitions. [2025-03-08 06:03:48,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 06:03:48,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:03:48,060 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:03:48,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:03:48,061 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:03:48,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:03:48,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1368784120, now seen corresponding path program 1 times [2025-03-08 06:03:48,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:03:48,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253165916] [2025-03-08 06:03:48,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:48,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:03:48,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 06:03:48,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 06:03:48,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:48,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:48,280 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-08 06:03:48,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:03:48,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253165916] [2025-03-08 06:03:48,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253165916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:03:48,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:03:48,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:03:48,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645122827] [2025-03-08 06:03:48,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:03:48,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:03:48,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:03:48,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:03:48,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:03:48,286 INFO L87 Difference]: Start difference. First operand 4249 states and 6981 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:48,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:03:48,477 INFO L93 Difference]: Finished difference Result 8501 states and 13966 transitions. [2025-03-08 06:03:48,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:03:48,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-03-08 06:03:48,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:03:48,502 INFO L225 Difference]: With dead ends: 8501 [2025-03-08 06:03:48,502 INFO L226 Difference]: Without dead ends: 6029 [2025-03-08 06:03:48,505 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-08 06:03:48,506 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 86 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:03:48,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 412 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:03:48,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2025-03-08 06:03:48,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 6027. [2025-03-08 06:03:48,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6027 states, 6026 states have (on average 1.6267839362761367) internal successors, (9803), 6026 states have internal predecessors, (9803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:48,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6027 states to 6027 states and 9803 transitions. [2025-03-08 06:03:48,660 INFO L78 Accepts]: Start accepts. Automaton has 6027 states and 9803 transitions. Word has length 68 [2025-03-08 06:03:48,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:03:48,661 INFO L471 AbstractCegarLoop]: Abstraction has 6027 states and 9803 transitions. [2025-03-08 06:03:48,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:48,661 INFO L276 IsEmpty]: Start isEmpty. Operand 6027 states and 9803 transitions. [2025-03-08 06:03:48,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 06:03:48,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:03:48,665 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:03:48,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:03:48,665 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:03:48,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:03:48,665 INFO L85 PathProgramCache]: Analyzing trace with hash 598946675, now seen corresponding path program 1 times [2025-03-08 06:03:48,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:03:48,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852755052] [2025-03-08 06:03:48,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:48,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:03:48,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 06:03:48,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 06:03:48,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:48,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:48,850 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-08 06:03:48,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:03:48,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852755052] [2025-03-08 06:03:48,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852755052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:03:48,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:03:48,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:03:48,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433769462] [2025-03-08 06:03:48,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:03:48,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:03:48,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:03:48,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:03:48,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:03:48,852 INFO L87 Difference]: Start difference. First operand 6027 states and 9803 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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-08 06:03:49,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:03:49,133 INFO L93 Difference]: Finished difference Result 19002 states and 30974 transitions. [2025-03-08 06:03:49,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:03:49,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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-08 06:03:49,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:03:49,182 INFO L225 Difference]: With dead ends: 19002 [2025-03-08 06:03:49,183 INFO L226 Difference]: Without dead ends: 13047 [2025-03-08 06:03:49,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:03:49,202 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 328 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:03:49,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 598 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:03:49,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13047 states. [2025-03-08 06:03:49,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13047 to 9494. [2025-03-08 06:03:49,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9494 states, 9493 states have (on average 1.614874117770989) internal successors, (15330), 9493 states have internal predecessors, (15330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:49,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9494 states to 9494 states and 15330 transitions. [2025-03-08 06:03:49,674 INFO L78 Accepts]: Start accepts. Automaton has 9494 states and 15330 transitions. Word has length 69 [2025-03-08 06:03:49,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:03:49,674 INFO L471 AbstractCegarLoop]: Abstraction has 9494 states and 15330 transitions. [2025-03-08 06:03:49,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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-08 06:03:49,674 INFO L276 IsEmpty]: Start isEmpty. Operand 9494 states and 15330 transitions. [2025-03-08 06:03:49,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 06:03:49,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:03:49,674 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:03:49,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:03:49,675 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:03:49,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:03:49,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1510340177, now seen corresponding path program 1 times [2025-03-08 06:03:49,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:03:49,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911450596] [2025-03-08 06:03:49,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:49,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:03:49,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 06:03:49,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 06:03:49,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:49,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:50,224 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-08 06:03:50,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:03:50,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911450596] [2025-03-08 06:03:50,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911450596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:03:50,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:03:50,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:03:50,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491448734] [2025-03-08 06:03:50,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:03:50,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:03:50,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:03:50,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:03:50,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:03:50,225 INFO L87 Difference]: Start difference. First operand 9494 states and 15330 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:50,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:03:50,616 INFO L93 Difference]: Finished difference Result 18918 states and 30563 transitions. [2025-03-08 06:03:50,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:03:50,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 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-08 06:03:50,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:03:50,641 INFO L225 Difference]: With dead ends: 18918 [2025-03-08 06:03:50,641 INFO L226 Difference]: Without dead ends: 9496 [2025-03-08 06:03:50,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:03:50,656 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 86 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:03:50,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 644 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:03:50,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9496 states. [2025-03-08 06:03:50,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9496 to 9494. [2025-03-08 06:03:50,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9494 states, 9493 states have (on average 1.6017065205941219) internal successors, (15205), 9493 states have internal predecessors, (15205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9494 states to 9494 states and 15205 transitions. [2025-03-08 06:03:51,002 INFO L78 Accepts]: Start accepts. Automaton has 9494 states and 15205 transitions. Word has length 71 [2025-03-08 06:03:51,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:03:51,002 INFO L471 AbstractCegarLoop]: Abstraction has 9494 states and 15205 transitions. [2025-03-08 06:03:51,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:51,003 INFO L276 IsEmpty]: Start isEmpty. Operand 9494 states and 15205 transitions. [2025-03-08 06:03:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 06:03:51,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:03:51,003 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:03:51,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:03:51,004 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:03:51,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:03:51,004 INFO L85 PathProgramCache]: Analyzing trace with hash 2133198141, now seen corresponding path program 1 times [2025-03-08 06:03:51,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:03:51,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794586255] [2025-03-08 06:03:51,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:51,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:03:51,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 06:03:51,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 06:03:51,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:51,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:51,209 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-08 06:03:51,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:03:51,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794586255] [2025-03-08 06:03:51,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794586255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:03:51,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:03:51,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:03:51,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330011131] [2025-03-08 06:03:51,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:03:51,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:03:51,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:03:51,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:03:51,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:03:51,211 INFO L87 Difference]: Start difference. First operand 9494 states and 15205 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:51,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:03:51,529 INFO L93 Difference]: Finished difference Result 27206 states and 43711 transitions. [2025-03-08 06:03:51,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:03:51,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-08 06:03:51,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:03:51,573 INFO L225 Difference]: With dead ends: 27206 [2025-03-08 06:03:51,573 INFO L226 Difference]: Without dead ends: 17784 [2025-03-08 06:03:51,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:03:51,667 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 250 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:03:51,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 495 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:03:51,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17784 states. [2025-03-08 06:03:52,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17784 to 17782. [2025-03-08 06:03:52,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17782 states, 17781 states have (on average 1.5867499015803386) internal successors, (28214), 17781 states have internal predecessors, (28214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:52,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17782 states to 17782 states and 28214 transitions. [2025-03-08 06:03:52,854 INFO L78 Accepts]: Start accepts. Automaton has 17782 states and 28214 transitions. Word has length 74 [2025-03-08 06:03:52,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:03:52,855 INFO L471 AbstractCegarLoop]: Abstraction has 17782 states and 28214 transitions. [2025-03-08 06:03:52,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:52,855 INFO L276 IsEmpty]: Start isEmpty. Operand 17782 states and 28214 transitions. [2025-03-08 06:03:52,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 06:03:52,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:03:52,856 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:03:52,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:03:52,856 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:03:52,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:03:52,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1737017706, now seen corresponding path program 1 times [2025-03-08 06:03:52,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:03:52,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229144191] [2025-03-08 06:03:52,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:52,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:03:52,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 06:03:52,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 06:03:52,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:52,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:53,123 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-08 06:03:53,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:03:53,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229144191] [2025-03-08 06:03:53,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229144191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:03:53,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:03:53,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:03:53,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291944920] [2025-03-08 06:03:53,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:03:53,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:03:53,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:03:53,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:03:53,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:03:53,127 INFO L87 Difference]: Start difference. First operand 17782 states and 28214 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:53,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:03:53,518 INFO L93 Difference]: Finished difference Result 18870 states and 29663 transitions. [2025-03-08 06:03:53,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:03:53,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 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-08 06:03:53,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:03:53,552 INFO L225 Difference]: With dead ends: 18870 [2025-03-08 06:03:53,552 INFO L226 Difference]: Without dead ends: 18868 [2025-03-08 06:03:53,557 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-08 06:03:53,559 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 0 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:03:53,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 722 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:03:53,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18868 states. [2025-03-08 06:03:54,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18868 to 18868. [2025-03-08 06:03:54,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18868 states, 18867 states have (on average 1.5524990724545502) internal successors, (29291), 18867 states have internal predecessors, (29291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:54,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18868 states to 18868 states and 29291 transitions. [2025-03-08 06:03:54,167 INFO L78 Accepts]: Start accepts. Automaton has 18868 states and 29291 transitions. Word has length 75 [2025-03-08 06:03:54,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:03:54,167 INFO L471 AbstractCegarLoop]: Abstraction has 18868 states and 29291 transitions. [2025-03-08 06:03:54,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:54,168 INFO L276 IsEmpty]: Start isEmpty. Operand 18868 states and 29291 transitions. [2025-03-08 06:03:54,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 06:03:54,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:03:54,173 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:03:54,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:03:54,173 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:03:54,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:03:54,174 INFO L85 PathProgramCache]: Analyzing trace with hash 683310146, now seen corresponding path program 1 times [2025-03-08 06:03:54,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:03:54,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596355696] [2025-03-08 06:03:54,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:54,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:03:54,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 06:03:54,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 06:03:54,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:54,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:54,396 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 06:03:54,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:03:54,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596355696] [2025-03-08 06:03:54,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596355696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:03:54,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:03:54,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:03:54,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823308190] [2025-03-08 06:03:54,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:03:54,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:03:54,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:03:54,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:03:54,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:03:54,401 INFO L87 Difference]: Start difference. First operand 18868 states and 29291 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:55,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:03:55,170 INFO L93 Difference]: Finished difference Result 46584 states and 72575 transitions. [2025-03-08 06:03:55,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:03:55,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-08 06:03:55,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:03:55,246 INFO L225 Difference]: With dead ends: 46584 [2025-03-08 06:03:55,246 INFO L226 Difference]: Without dead ends: 37342 [2025-03-08 06:03:55,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:03:55,266 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 416 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:03:55,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 805 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:03:55,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37342 states. [2025-03-08 06:03:56,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37342 to 29092. [2025-03-08 06:03:56,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29092 states, 29091 states have (on average 1.5493107834038018) internal successors, (45071), 29091 states have internal predecessors, (45071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:56,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29092 states to 29092 states and 45071 transitions. [2025-03-08 06:03:56,318 INFO L78 Accepts]: Start accepts. Automaton has 29092 states and 45071 transitions. Word has length 101 [2025-03-08 06:03:56,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:03:56,318 INFO L471 AbstractCegarLoop]: Abstraction has 29092 states and 45071 transitions. [2025-03-08 06:03:56,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:56,318 INFO L276 IsEmpty]: Start isEmpty. Operand 29092 states and 45071 transitions. [2025-03-08 06:03:56,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 06:03:56,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:03:56,320 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:03:56,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:03:56,320 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:03:56,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:03:56,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1293899870, now seen corresponding path program 1 times [2025-03-08 06:03:56,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:03:56,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328651561] [2025-03-08 06:03:56,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:56,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:03:56,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 06:03:56,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 06:03:56,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:56,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:56,444 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 06:03:56,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:03:56,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328651561] [2025-03-08 06:03:56,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328651561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:03:56,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:03:56,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:03:56,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819030214] [2025-03-08 06:03:56,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:03:56,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:03:56,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:03:56,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:03:56,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:03:56,445 INFO L87 Difference]: Start difference. First operand 29092 states and 45071 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:57,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:03:57,048 INFO L93 Difference]: Finished difference Result 52276 states and 81445 transitions. [2025-03-08 06:03:57,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:03:57,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-08 06:03:57,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:03:57,157 INFO L225 Difference]: With dead ends: 52276 [2025-03-08 06:03:57,157 INFO L226 Difference]: Without dead ends: 43294 [2025-03-08 06:03:57,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:03:57,183 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 415 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:03:57,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 790 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:03:57,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43294 states. [2025-03-08 06:03:58,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43294 to 39560. [2025-03-08 06:03:58,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39560 states, 39559 states have (on average 1.5506711494223817) internal successors, (61343), 39559 states have internal predecessors, (61343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:58,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39560 states to 39560 states and 61343 transitions. [2025-03-08 06:03:58,158 INFO L78 Accepts]: Start accepts. Automaton has 39560 states and 61343 transitions. Word has length 101 [2025-03-08 06:03:58,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:03:58,158 INFO L471 AbstractCegarLoop]: Abstraction has 39560 states and 61343 transitions. [2025-03-08 06:03:58,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:58,158 INFO L276 IsEmpty]: Start isEmpty. Operand 39560 states and 61343 transitions. [2025-03-08 06:03:58,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 06:03:58,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:03:58,160 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:03:58,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:03:58,161 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:03:58,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:03:58,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1302144254, now seen corresponding path program 1 times [2025-03-08 06:03:58,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:03:58,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648122536] [2025-03-08 06:03:58,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:58,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:03:58,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 06:03:58,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 06:03:58,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:58,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:58,307 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:03:58,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:03:58,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648122536] [2025-03-08 06:03:58,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648122536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:03:58,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:03:58,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:03:58,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625527592] [2025-03-08 06:03:58,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:03:58,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:03:58,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:03:58,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:03:58,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:03:58,310 INFO L87 Difference]: Start difference. First operand 39560 states and 61343 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:58,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:03:58,900 INFO L93 Difference]: Finished difference Result 55900 states and 87085 transitions. [2025-03-08 06:03:58,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:03:58,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-08 06:03:58,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:03:59,004 INFO L225 Difference]: With dead ends: 55900 [2025-03-08 06:03:59,005 INFO L226 Difference]: Without dead ends: 46918 [2025-03-08 06:03:59,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:03:59,029 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 423 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:03:59,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 808 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:03:59,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46918 states. [2025-03-08 06:03:59,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46918 to 45408. [2025-03-08 06:03:59,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45408 states, 45407 states have (on average 1.5525139295703305) internal successors, (70495), 45407 states have internal predecessors, (70495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:59,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45408 states to 45408 states and 70495 transitions. [2025-03-08 06:03:59,923 INFO L78 Accepts]: Start accepts. Automaton has 45408 states and 70495 transitions. Word has length 101 [2025-03-08 06:03:59,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:03:59,923 INFO L471 AbstractCegarLoop]: Abstraction has 45408 states and 70495 transitions. [2025-03-08 06:03:59,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:03:59,923 INFO L276 IsEmpty]: Start isEmpty. Operand 45408 states and 70495 transitions. [2025-03-08 06:03:59,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 06:03:59,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:03:59,925 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:03:59,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:03:59,925 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:03:59,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:03:59,926 INFO L85 PathProgramCache]: Analyzing trace with hash -241366759, now seen corresponding path program 1 times [2025-03-08 06:03:59,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:03:59,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834600231] [2025-03-08 06:03:59,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:59,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:03:59,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 06:03:59,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 06:03:59,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:59,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:04:00,177 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 06:04:00,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:04:00,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834600231] [2025-03-08 06:04:00,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834600231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:04:00,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:04:00,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:04:00,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238028690] [2025-03-08 06:04:00,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:04:00,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:04:00,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:04:00,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:04:00,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:04:00,179 INFO L87 Difference]: Start difference. First operand 45408 states and 70495 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:04:00,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:04:00,866 INFO L93 Difference]: Finished difference Result 74291 states and 115964 transitions. [2025-03-08 06:04:00,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:04:00,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2025-03-08 06:04:00,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:04:00,990 INFO L225 Difference]: With dead ends: 74291 [2025-03-08 06:04:00,991 INFO L226 Difference]: Without dead ends: 59097 [2025-03-08 06:04:01,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:04:01,016 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 171 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:04:01,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 621 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:04:01,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59097 states. [2025-03-08 06:04:02,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59097 to 57589. [2025-03-08 06:04:02,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57589 states, 57588 states have (on average 1.5524935750503577) internal successors, (89405), 57588 states have internal predecessors, (89405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:04:02,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57589 states to 57589 states and 89405 transitions. [2025-03-08 06:04:02,395 INFO L78 Accepts]: Start accepts. Automaton has 57589 states and 89405 transitions. Word has length 102 [2025-03-08 06:04:02,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:04:02,396 INFO L471 AbstractCegarLoop]: Abstraction has 57589 states and 89405 transitions. [2025-03-08 06:04:02,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:04:02,396 INFO L276 IsEmpty]: Start isEmpty. Operand 57589 states and 89405 transitions. [2025-03-08 06:04:02,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 06:04:02,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:04:02,398 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:04:02,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:04:02,398 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:04:02,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:04:02,399 INFO L85 PathProgramCache]: Analyzing trace with hash -30015846, now seen corresponding path program 1 times [2025-03-08 06:04:02,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:04:02,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929497275] [2025-03-08 06:04:02,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:04:02,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:04:02,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 06:04:02,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 06:04:02,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:04:02,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:04:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 06:04:02,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:04:02,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929497275] [2025-03-08 06:04:02,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929497275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:04:02,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:04:02,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:04:02,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493845466] [2025-03-08 06:04:02,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:04:02,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:04:02,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:04:02,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:04:02,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:04:02,461 INFO L87 Difference]: Start difference. First operand 57589 states and 89405 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:04:03,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:04:03,343 INFO L93 Difference]: Finished difference Result 124855 states and 194471 transitions. [2025-03-08 06:04:03,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:04:03,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2025-03-08 06:04:03,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:04:03,501 INFO L225 Difference]: With dead ends: 124855 [2025-03-08 06:04:03,501 INFO L226 Difference]: Without dead ends: 97585 [2025-03-08 06:04:03,535 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-08 06:04:03,536 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 74 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:04:03,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 341 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:04:03,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97585 states. [2025-03-08 06:04:05,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97585 to 97307. [2025-03-08 06:04:05,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97307 states, 97306 states have (on average 1.5516617680307483) internal successors, (150986), 97306 states have internal predecessors, (150986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:04:05,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97307 states to 97307 states and 150986 transitions. [2025-03-08 06:04:05,548 INFO L78 Accepts]: Start accepts. Automaton has 97307 states and 150986 transitions. Word has length 102 [2025-03-08 06:04:05,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:04:05,548 INFO L471 AbstractCegarLoop]: Abstraction has 97307 states and 150986 transitions. [2025-03-08 06:04:05,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:04:05,548 INFO L276 IsEmpty]: Start isEmpty. Operand 97307 states and 150986 transitions. [2025-03-08 06:04:05,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 06:04:05,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:04:05,551 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:04:05,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:04:05,551 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:04:05,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:04:05,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1451524131, now seen corresponding path program 1 times [2025-03-08 06:04:05,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:04:05,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707547963] [2025-03-08 06:04:05,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:04:05,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:04:05,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 06:04:05,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 06:04:05,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:04:05,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:04:05,633 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:04:05,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:04:05,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707547963] [2025-03-08 06:04:05,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707547963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:04:05,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:04:05,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:04:05,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100789701] [2025-03-08 06:04:05,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:04:05,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:04:05,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:04:05,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:04:05,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:04:05,635 INFO L87 Difference]: Start difference. First operand 97307 states and 150986 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:04:07,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:04:07,752 INFO L93 Difference]: Finished difference Result 289625 states and 448415 transitions. [2025-03-08 06:04:07,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:04:07,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-03-08 06:04:07,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:04:08,125 INFO L225 Difference]: With dead ends: 289625 [2025-03-08 06:04:08,126 INFO L226 Difference]: Without dead ends: 192384 [2025-03-08 06:04:08,242 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-08 06:04:08,243 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 119 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:04:08,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 416 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:04:08,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192384 states. [2025-03-08 06:04:11,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192384 to 192382. [2025-03-08 06:04:11,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192382 states, 192381 states have (on average 1.5350164517286011) internal successors, (295308), 192381 states have internal predecessors, (295308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:04:11,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192382 states to 192382 states and 295308 transitions. [2025-03-08 06:04:11,951 INFO L78 Accepts]: Start accepts. Automaton has 192382 states and 295308 transitions. Word has length 103 [2025-03-08 06:04:11,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:04:11,951 INFO L471 AbstractCegarLoop]: Abstraction has 192382 states and 295308 transitions. [2025-03-08 06:04:11,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:04:11,951 INFO L276 IsEmpty]: Start isEmpty. Operand 192382 states and 295308 transitions. [2025-03-08 06:04:11,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 06:04:11,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:04:11,955 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:04:11,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 06:04:11,955 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:04:11,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:04:11,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1360032675, now seen corresponding path program 1 times [2025-03-08 06:04:11,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:04:11,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856540499] [2025-03-08 06:04:11,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:04:11,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:04:11,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 06:04:11,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 06:04:11,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:04:11,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:04:12,011 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:04:12,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:04:12,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856540499] [2025-03-08 06:04:12,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856540499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:04:12,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:04:12,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:04:12,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901052207] [2025-03-08 06:04:12,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:04:12,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:04:12,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:04:12,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:04:12,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:04:12,013 INFO L87 Difference]: Start difference. First operand 192382 states and 295308 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:04:15,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:04:15,807 INFO L93 Difference]: Finished difference Result 572595 states and 876913 transitions. [2025-03-08 06:04:15,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:04:15,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-03-08 06:04:15,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:04:16,535 INFO L225 Difference]: With dead ends: 572595 [2025-03-08 06:04:16,535 INFO L226 Difference]: Without dead ends: 380335 [2025-03-08 06:04:16,800 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-08 06:04:16,801 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 138 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:04:16,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 442 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:04:17,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380335 states. [2025-03-08 06:04:22,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380335 to 380333. [2025-03-08 06:04:23,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380333 states, 380332 states have (on average 1.5180026923845482) internal successors, (577345), 380332 states have internal predecessors, (577345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:04:25,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380333 states to 380333 states and 577345 transitions. [2025-03-08 06:04:25,210 INFO L78 Accepts]: Start accepts. Automaton has 380333 states and 577345 transitions. Word has length 103 [2025-03-08 06:04:25,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:04:25,211 INFO L471 AbstractCegarLoop]: Abstraction has 380333 states and 577345 transitions. [2025-03-08 06:04:25,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:04:25,211 INFO L276 IsEmpty]: Start isEmpty. Operand 380333 states and 577345 transitions. [2025-03-08 06:04:25,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 06:04:25,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:04:25,236 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:04:25,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 06:04:25,236 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:04:25,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:04:25,236 INFO L85 PathProgramCache]: Analyzing trace with hash 714686868, now seen corresponding path program 1 times [2025-03-08 06:04:25,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:04:25,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342906132] [2025-03-08 06:04:25,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:04:25,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:04:25,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 06:04:25,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 06:04:25,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:04:25,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:04:25,403 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-08 06:04:25,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:04:25,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342906132] [2025-03-08 06:04:25,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342906132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:04:25,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:04:25,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:04:25,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185307823] [2025-03-08 06:04:25,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:04:25,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:04:25,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:04:25,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:04:25,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:04:25,409 INFO L87 Difference]: Start difference. First operand 380333 states and 577345 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)