./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label08.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label08.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 cfb40cb555a14fd95bceea51ff65e6513c4cf2d7cc92f4af25db414fd945afd5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:09:09,537 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:09:09,591 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:09:09,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:09:09,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:09:09,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:09:09,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:09:09,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:09:09,614 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:09:09,615 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:09:09,615 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:09:09,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:09:09,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:09:09,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:09:09,616 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:09:09,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:09:09,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:09:09,617 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:09:09,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:09:09,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:09:09,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:09:09,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:09:09,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:09:09,617 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:09:09,617 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:09:09,617 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:09:09,617 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:09:09,617 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:09:09,618 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:09:09,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:09:09,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:09:09,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:09:09,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:09:09,618 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:09:09,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:09:09,619 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:09:09,619 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:09:09,619 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:09:09,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:09:09,619 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:09:09,619 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:09:09,619 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:09:09,619 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:09:09,619 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 -> cfb40cb555a14fd95bceea51ff65e6513c4cf2d7cc92f4af25db414fd945afd5 [2025-03-16 14:09:09,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:09:09,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:09:09,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:09:09,864 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:09:09,864 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:09:09,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label08.c [2025-03-16 14:09:11,083 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a35c829eb/bfd3b6c8798a40e095bd95a0648339d2/FLAGadfdba45e [2025-03-16 14:09:11,472 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:09:11,474 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label08.c [2025-03-16 14:09:11,490 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a35c829eb/bfd3b6c8798a40e095bd95a0648339d2/FLAGadfdba45e [2025-03-16 14:09:11,506 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a35c829eb/bfd3b6c8798a40e095bd95a0648339d2 [2025-03-16 14:09:11,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:09:11,509 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:09:11,510 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:09:11,511 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:09:11,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:09:11,514 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:09:11" (1/1) ... [2025-03-16 14:09:11,515 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ee39ca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:11, skipping insertion in model container [2025-03-16 14:09:11,515 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:09:11" (1/1) ... [2025-03-16 14:09:11,556 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:09:11,929 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label08.c[55410,55423] [2025-03-16 14:09:11,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:09:11,979 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:09:12,100 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label08.c[55410,55423] [2025-03-16 14:09:12,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:09:12,130 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:09:12,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:12 WrapperNode [2025-03-16 14:09:12,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:09:12,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:09:12,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:09:12,132 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:09:12,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:12" (1/1) ... [2025-03-16 14:09:12,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:12" (1/1) ... [2025-03-16 14:09:12,241 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-03-16 14:09:12,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:09:12,242 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:09:12,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:09:12,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:09:12,249 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:12" (1/1) ... [2025-03-16 14:09:12,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:12" (1/1) ... [2025-03-16 14:09:12,257 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:12" (1/1) ... [2025-03-16 14:09:12,286 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 14:09:12,290 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:12" (1/1) ... [2025-03-16 14:09:12,290 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:12" (1/1) ... [2025-03-16 14:09:12,329 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:12" (1/1) ... [2025-03-16 14:09:12,333 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:12" (1/1) ... [2025-03-16 14:09:12,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:12" (1/1) ... [2025-03-16 14:09:12,344 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:12" (1/1) ... [2025-03-16 14:09:12,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:09:12,354 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:09:12,354 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:09:12,354 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:09:12,356 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:12" (1/1) ... [2025-03-16 14:09:12,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:09:12,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:09:12,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 14:09:12,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 14:09:12,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:09:12,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:09:12,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:09:12,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:09:12,490 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:09:12,492 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:09:13,807 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-16 14:09:13,807 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:09:13,821 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:09:13,824 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:09:13,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:09:13 BoogieIcfgContainer [2025-03-16 14:09:13,824 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:09:13,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:09:13,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:09:13,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:09:13,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:09:11" (1/3) ... [2025-03-16 14:09:13,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ecc8a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:09:13, skipping insertion in model container [2025-03-16 14:09:13,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:12" (2/3) ... [2025-03-16 14:09:13,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ecc8a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:09:13, skipping insertion in model container [2025-03-16 14:09:13,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:09:13" (3/3) ... [2025-03-16 14:09:13,832 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label08.c [2025-03-16 14:09:13,846 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:09:13,851 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label08.c that has 1 procedures, 241 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:09:13,918 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:09:13,927 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;@7327d1dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:09:13,928 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:09:13,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 241 states, 239 states have (on average 1.9121338912133892) internal successors, (457), 240 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:13,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-16 14:09:13,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:13,944 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:13,944 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:13,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:13,950 INFO L85 PathProgramCache]: Analyzing trace with hash -104051510, now seen corresponding path program 1 times [2025-03-16 14:09:13,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:13,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423241405] [2025-03-16 14:09:13,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:13,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:14,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-16 14:09:14,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-16 14:09:14,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:14,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:14,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:09:14,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:14,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423241405] [2025-03-16 14:09:14,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423241405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:14,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:14,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:09:14,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817772090] [2025-03-16 14:09:14,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:14,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:09:14,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:14,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:09:14,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:09:14,398 INFO L87 Difference]: Start difference. First operand has 241 states, 239 states have (on average 1.9121338912133892) internal successors, (457), 240 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 78.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:14,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:14,431 INFO L93 Difference]: Finished difference Result 481 states and 913 transitions. [2025-03-16 14:09:14,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:09:14,433 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 78.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2025-03-16 14:09:14,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:14,440 INFO L225 Difference]: With dead ends: 481 [2025-03-16 14:09:14,440 INFO L226 Difference]: Without dead ends: 238 [2025-03-16 14:09:14,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:09:14,446 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:14,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:09:14,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-16 14:09:14,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2025-03-16 14:09:14,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:14,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2025-03-16 14:09:14,483 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 156 [2025-03-16 14:09:14,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:14,484 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2025-03-16 14:09:14,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 78.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:14,485 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2025-03-16 14:09:14,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-16 14:09:14,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:14,489 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:14,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:09:14,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:14,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:14,491 INFO L85 PathProgramCache]: Analyzing trace with hash -407400501, now seen corresponding path program 1 times [2025-03-16 14:09:14,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:14,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082177365] [2025-03-16 14:09:14,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:14,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:14,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-16 14:09:14,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-16 14:09:14,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:14,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:09:14,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:14,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082177365] [2025-03-16 14:09:14,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082177365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:14,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:14,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:09:14,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730377469] [2025-03-16 14:09:14,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:14,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:14,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:14,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:14,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:14,965 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:15,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:15,721 INFO L93 Difference]: Finished difference Result 680 states and 1127 transitions. [2025-03-16 14:09:15,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:15,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2025-03-16 14:09:15,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:15,725 INFO L225 Difference]: With dead ends: 680 [2025-03-16 14:09:15,727 INFO L226 Difference]: Without dead ends: 443 [2025-03-16 14:09:15,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:15,729 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 65 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:15,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 193 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:09:15,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-03-16 14:09:15,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2025-03-16 14:09:15,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 1.4298642533936652) internal successors, (632), 442 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:15,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 632 transitions. [2025-03-16 14:09:15,746 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 632 transitions. Word has length 156 [2025-03-16 14:09:15,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:15,747 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 632 transitions. [2025-03-16 14:09:15,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:15,747 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 632 transitions. [2025-03-16 14:09:15,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-16 14:09:15,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:15,752 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:15,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:09:15,752 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:15,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:15,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1474842745, now seen corresponding path program 1 times [2025-03-16 14:09:15,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:15,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573634497] [2025-03-16 14:09:15,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:15,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:15,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-16 14:09:15,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-16 14:09:15,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:15,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:15,932 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:09:15,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:15,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573634497] [2025-03-16 14:09:15,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573634497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:15,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:15,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:09:15,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375115832] [2025-03-16 14:09:15,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:15,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:15,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:15,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:15,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:15,935 INFO L87 Difference]: Start difference. First operand 443 states and 632 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:16,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:16,673 INFO L93 Difference]: Finished difference Result 1311 states and 1877 transitions. [2025-03-16 14:09:16,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:16,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2025-03-16 14:09:16,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:16,678 INFO L225 Difference]: With dead ends: 1311 [2025-03-16 14:09:16,678 INFO L226 Difference]: Without dead ends: 869 [2025-03-16 14:09:16,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:16,681 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:16,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 90 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:09:16,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-03-16 14:09:16,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 855. [2025-03-16 14:09:16,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 854 states have (on average 1.395784543325527) internal successors, (1192), 854 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:16,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1192 transitions. [2025-03-16 14:09:16,712 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1192 transitions. Word has length 164 [2025-03-16 14:09:16,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:16,712 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1192 transitions. [2025-03-16 14:09:16,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:16,713 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1192 transitions. [2025-03-16 14:09:16,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-16 14:09:16,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:16,715 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:16,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:09:16,715 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:16,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:16,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1258346428, now seen corresponding path program 1 times [2025-03-16 14:09:16,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:16,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129501127] [2025-03-16 14:09:16,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:16,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:16,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-16 14:09:16,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-16 14:09:16,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:16,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:16,911 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:09:16,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:16,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129501127] [2025-03-16 14:09:16,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129501127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:16,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:16,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:09:16,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002202690] [2025-03-16 14:09:16,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:16,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:16,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:16,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:16,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:16,914 INFO L87 Difference]: Start difference. First operand 855 states and 1192 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:17,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:17,608 INFO L93 Difference]: Finished difference Result 2540 states and 3550 transitions. [2025-03-16 14:09:17,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:17,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2025-03-16 14:09:17,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:17,614 INFO L225 Difference]: With dead ends: 2540 [2025-03-16 14:09:17,614 INFO L226 Difference]: Without dead ends: 1686 [2025-03-16 14:09:17,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:17,616 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 87 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:17,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 363 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:09:17,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2025-03-16 14:09:17,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1672. [2025-03-16 14:09:17,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1671 states have (on average 1.3602633153800119) internal successors, (2273), 1671 states have internal predecessors, (2273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:17,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2273 transitions. [2025-03-16 14:09:17,649 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2273 transitions. Word has length 171 [2025-03-16 14:09:17,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:17,649 INFO L471 AbstractCegarLoop]: Abstraction has 1672 states and 2273 transitions. [2025-03-16 14:09:17,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:17,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2273 transitions. [2025-03-16 14:09:17,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-16 14:09:17,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:17,656 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:17,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:09:17,656 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:17,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:17,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1026148933, now seen corresponding path program 1 times [2025-03-16 14:09:17,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:17,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124933066] [2025-03-16 14:09:17,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:17,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:17,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-16 14:09:17,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-16 14:09:17,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:17,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:17,794 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:09:17,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:17,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124933066] [2025-03-16 14:09:17,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124933066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:17,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:17,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:09:17,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953265566] [2025-03-16 14:09:17,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:17,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:17,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:17,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:17,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:17,796 INFO L87 Difference]: Start difference. First operand 1672 states and 2273 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:18,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:18,441 INFO L93 Difference]: Finished difference Result 4975 states and 6769 transitions. [2025-03-16 14:09:18,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:18,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 177 [2025-03-16 14:09:18,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:18,451 INFO L225 Difference]: With dead ends: 4975 [2025-03-16 14:09:18,452 INFO L226 Difference]: Without dead ends: 3304 [2025-03-16 14:09:18,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:18,458 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 258 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:18,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 355 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:09:18,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3304 states. [2025-03-16 14:09:18,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3304 to 3299. [2025-03-16 14:09:18,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3299 states, 3298 states have (on average 1.3101879927228623) internal successors, (4321), 3298 states have internal predecessors, (4321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3299 states to 3299 states and 4321 transitions. [2025-03-16 14:09:18,529 INFO L78 Accepts]: Start accepts. Automaton has 3299 states and 4321 transitions. Word has length 177 [2025-03-16 14:09:18,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:18,529 INFO L471 AbstractCegarLoop]: Abstraction has 3299 states and 4321 transitions. [2025-03-16 14:09:18,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:18,529 INFO L276 IsEmpty]: Start isEmpty. Operand 3299 states and 4321 transitions. [2025-03-16 14:09:18,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-16 14:09:18,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:18,534 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:18,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:09:18,534 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:18,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:18,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2058690960, now seen corresponding path program 1 times [2025-03-16 14:09:18,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:18,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877696782] [2025-03-16 14:09:18,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:18,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:18,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-16 14:09:18,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-16 14:09:18,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:18,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:18,709 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 14:09:18,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:18,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877696782] [2025-03-16 14:09:18,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877696782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:18,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:18,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:09:18,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258368100] [2025-03-16 14:09:18,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:18,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:18,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:18,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:18,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:18,715 INFO L87 Difference]: Start difference. First operand 3299 states and 4321 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:19,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:19,387 INFO L93 Difference]: Finished difference Result 8021 states and 10768 transitions. [2025-03-16 14:09:19,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:19,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 183 [2025-03-16 14:09:19,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:19,400 INFO L225 Difference]: With dead ends: 8021 [2025-03-16 14:09:19,400 INFO L226 Difference]: Without dead ends: 4723 [2025-03-16 14:09:19,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:19,405 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 237 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:19,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 404 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:09:19,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4723 states. [2025-03-16 14:09:19,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4723 to 4721. [2025-03-16 14:09:19,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4721 states, 4720 states have (on average 1.2677966101694915) internal successors, (5984), 4720 states have internal predecessors, (5984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:19,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4721 states to 4721 states and 5984 transitions. [2025-03-16 14:09:19,478 INFO L78 Accepts]: Start accepts. Automaton has 4721 states and 5984 transitions. Word has length 183 [2025-03-16 14:09:19,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:19,478 INFO L471 AbstractCegarLoop]: Abstraction has 4721 states and 5984 transitions. [2025-03-16 14:09:19,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:19,479 INFO L276 IsEmpty]: Start isEmpty. Operand 4721 states and 5984 transitions. [2025-03-16 14:09:19,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-16 14:09:19,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:19,484 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:19,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:09:19,484 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:19,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:19,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1460727884, now seen corresponding path program 1 times [2025-03-16 14:09:19,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:19,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704488612] [2025-03-16 14:09:19,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:19,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:19,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-16 14:09:19,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-16 14:09:19,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:19,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:19,630 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-16 14:09:19,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:19,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704488612] [2025-03-16 14:09:19,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704488612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:19,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:19,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:09:19,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437904933] [2025-03-16 14:09:19,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:19,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:19,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:19,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:19,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:19,632 INFO L87 Difference]: Start difference. First operand 4721 states and 5984 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:19,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:19,980 INFO L93 Difference]: Finished difference Result 9215 states and 11717 transitions. [2025-03-16 14:09:19,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:19,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2025-03-16 14:09:19,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:19,994 INFO L225 Difference]: With dead ends: 9215 [2025-03-16 14:09:19,994 INFO L226 Difference]: Without dead ends: 4495 [2025-03-16 14:09:19,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:20,000 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 326 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:20,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 30 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:09:20,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4495 states. [2025-03-16 14:09:20,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4495 to 4495. [2025-03-16 14:09:20,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4495 states, 4494 states have (on average 1.2298620382732532) internal successors, (5527), 4494 states have internal predecessors, (5527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:20,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4495 states to 4495 states and 5527 transitions. [2025-03-16 14:09:20,079 INFO L78 Accepts]: Start accepts. Automaton has 4495 states and 5527 transitions. Word has length 184 [2025-03-16 14:09:20,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:20,079 INFO L471 AbstractCegarLoop]: Abstraction has 4495 states and 5527 transitions. [2025-03-16 14:09:20,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:20,079 INFO L276 IsEmpty]: Start isEmpty. Operand 4495 states and 5527 transitions. [2025-03-16 14:09:20,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-16 14:09:20,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:20,084 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:20,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:09:20,084 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:20,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:20,085 INFO L85 PathProgramCache]: Analyzing trace with hash -432226282, now seen corresponding path program 1 times [2025-03-16 14:09:20,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:20,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036334257] [2025-03-16 14:09:20,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:20,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:20,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-16 14:09:20,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-16 14:09:20,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:20,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:20,268 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:09:20,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:20,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036334257] [2025-03-16 14:09:20,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036334257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:20,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:20,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:09:20,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114721049] [2025-03-16 14:09:20,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:20,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:20,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:20,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:20,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:20,270 INFO L87 Difference]: Start difference. First operand 4495 states and 5527 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:20,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:20,990 INFO L93 Difference]: Finished difference Result 12855 states and 15739 transitions. [2025-03-16 14:09:20,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:20,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2025-03-16 14:09:20,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:21,013 INFO L225 Difference]: With dead ends: 12855 [2025-03-16 14:09:21,013 INFO L226 Difference]: Without dead ends: 8361 [2025-03-16 14:09:21,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:21,018 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 189 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:21,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 154 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:09:21,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8361 states. [2025-03-16 14:09:21,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8361 to 8357. [2025-03-16 14:09:21,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8357 states, 8356 states have (on average 1.193274293920536) internal successors, (9971), 8356 states have internal predecessors, (9971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:21,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8357 states to 8357 states and 9971 transitions. [2025-03-16 14:09:21,142 INFO L78 Accepts]: Start accepts. Automaton has 8357 states and 9971 transitions. Word has length 210 [2025-03-16 14:09:21,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:21,142 INFO L471 AbstractCegarLoop]: Abstraction has 8357 states and 9971 transitions. [2025-03-16 14:09:21,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:21,142 INFO L276 IsEmpty]: Start isEmpty. Operand 8357 states and 9971 transitions. [2025-03-16 14:09:21,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-16 14:09:21,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:21,151 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:21,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:09:21,151 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:21,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:21,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1652179488, now seen corresponding path program 1 times [2025-03-16 14:09:21,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:21,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239410640] [2025-03-16 14:09:21,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:21,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:21,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-16 14:09:21,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-16 14:09:21,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:21,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:21,372 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 14:09:21,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:21,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239410640] [2025-03-16 14:09:21,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239410640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:21,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:21,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:09:21,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026595590] [2025-03-16 14:09:21,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:21,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:21,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:21,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:21,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:21,374 INFO L87 Difference]: Start difference. First operand 8357 states and 9971 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:22,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:22,018 INFO L93 Difference]: Finished difference Result 20792 states and 24812 transitions. [2025-03-16 14:09:22,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:22,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 218 [2025-03-16 14:09:22,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:22,045 INFO L225 Difference]: With dead ends: 20792 [2025-03-16 14:09:22,046 INFO L226 Difference]: Without dead ends: 12436 [2025-03-16 14:09:22,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:22,057 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 207 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:22,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 68 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:09:22,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12436 states. [2025-03-16 14:09:22,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12436 to 12433. [2025-03-16 14:09:22,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12433 states, 12432 states have (on average 1.190958815958816) internal successors, (14806), 12432 states have internal predecessors, (14806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:22,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12433 states to 12433 states and 14806 transitions. [2025-03-16 14:09:22,297 INFO L78 Accepts]: Start accepts. Automaton has 12433 states and 14806 transitions. Word has length 218 [2025-03-16 14:09:22,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:22,298 INFO L471 AbstractCegarLoop]: Abstraction has 12433 states and 14806 transitions. [2025-03-16 14:09:22,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:22,299 INFO L276 IsEmpty]: Start isEmpty. Operand 12433 states and 14806 transitions. [2025-03-16 14:09:22,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-16 14:09:22,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:22,317 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:22,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:09:22,317 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:22,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:22,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1733995293, now seen corresponding path program 1 times [2025-03-16 14:09:22,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:22,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100203551] [2025-03-16 14:09:22,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:22,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:22,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-16 14:09:22,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-16 14:09:22,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:22,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:22,669 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 68 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 14:09:22,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:22,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100203551] [2025-03-16 14:09:22,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100203551] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:09:22,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349062641] [2025-03-16 14:09:22,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:22,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:09:22,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:09:22,672 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:09:22,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 14:09:22,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-16 14:09:22,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-16 14:09:22,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:22,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:22,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:09:22,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:09:23,054 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-16 14:09:23,054 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:09:23,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349062641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:23,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:09:23,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-16 14:09:23,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368704777] [2025-03-16 14:09:23,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:23,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:23,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:23,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:23,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:09:23,057 INFO L87 Difference]: Start difference. First operand 12433 states and 14806 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:23,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:23,658 INFO L93 Difference]: Finished difference Result 24871 states and 29623 transitions. [2025-03-16 14:09:23,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:23,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2025-03-16 14:09:23,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:23,680 INFO L225 Difference]: With dead ends: 24871 [2025-03-16 14:09:23,680 INFO L226 Difference]: Without dead ends: 12439 [2025-03-16 14:09:23,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 224 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-16 14:09:23,692 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 97 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:23,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 95 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:09:23,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12439 states. [2025-03-16 14:09:23,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12439 to 12433. [2025-03-16 14:09:23,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12433 states, 12432 states have (on average 1.1632882882882882) internal successors, (14462), 12432 states have internal predecessors, (14462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:23,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12433 states to 12433 states and 14462 transitions. [2025-03-16 14:09:23,869 INFO L78 Accepts]: Start accepts. Automaton has 12433 states and 14462 transitions. Word has length 225 [2025-03-16 14:09:23,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:23,869 INFO L471 AbstractCegarLoop]: Abstraction has 12433 states and 14462 transitions. [2025-03-16 14:09:23,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:23,870 INFO L276 IsEmpty]: Start isEmpty. Operand 12433 states and 14462 transitions. [2025-03-16 14:09:23,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-16 14:09:23,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:23,883 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:23,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 14:09:24,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-16 14:09:24,088 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:24,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:24,089 INFO L85 PathProgramCache]: Analyzing trace with hash 652627431, now seen corresponding path program 1 times [2025-03-16 14:09:24,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:24,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780036867] [2025-03-16 14:09:24,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:24,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:24,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-16 14:09:24,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-16 14:09:24,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:24,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:24,333 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:09:24,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:24,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780036867] [2025-03-16 14:09:24,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780036867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:24,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:24,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:09:24,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217429177] [2025-03-16 14:09:24,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:24,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:24,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:24,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:24,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:24,334 INFO L87 Difference]: Start difference. First operand 12433 states and 14462 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:24,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:24,942 INFO L93 Difference]: Finished difference Result 25888 states and 30185 transitions. [2025-03-16 14:09:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:24,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 249 [2025-03-16 14:09:24,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:24,964 INFO L225 Difference]: With dead ends: 25888 [2025-03-16 14:09:24,964 INFO L226 Difference]: Without dead ends: 13456 [2025-03-16 14:09:24,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:24,977 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 143 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:24,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 338 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:09:24,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13456 states. [2025-03-16 14:09:25,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13456 to 13451. [2025-03-16 14:09:25,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13451 states, 13450 states have (on average 1.1601486988847585) internal successors, (15604), 13450 states have internal predecessors, (15604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:25,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13451 states to 13451 states and 15604 transitions. [2025-03-16 14:09:25,129 INFO L78 Accepts]: Start accepts. Automaton has 13451 states and 15604 transitions. Word has length 249 [2025-03-16 14:09:25,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:25,129 INFO L471 AbstractCegarLoop]: Abstraction has 13451 states and 15604 transitions. [2025-03-16 14:09:25,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:25,129 INFO L276 IsEmpty]: Start isEmpty. Operand 13451 states and 15604 transitions. [2025-03-16 14:09:25,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-16 14:09:25,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:25,144 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:25,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:09:25,144 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:25,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:25,145 INFO L85 PathProgramCache]: Analyzing trace with hash 164300103, now seen corresponding path program 1 times [2025-03-16 14:09:25,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:25,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361372337] [2025-03-16 14:09:25,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:25,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:25,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-16 14:09:25,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-16 14:09:25,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:25,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:09:25,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:25,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361372337] [2025-03-16 14:09:25,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361372337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:25,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:25,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:09:25,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472859009] [2025-03-16 14:09:25,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:25,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:25,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:25,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:25,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:25,440 INFO L87 Difference]: Start difference. First operand 13451 states and 15604 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:26,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:26,041 INFO L93 Difference]: Finished difference Result 26702 states and 30999 transitions. [2025-03-16 14:09:26,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:26,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 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 252 [2025-03-16 14:09:26,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:26,062 INFO L225 Difference]: With dead ends: 26702 [2025-03-16 14:09:26,062 INFO L226 Difference]: Without dead ends: 13252 [2025-03-16 14:09:26,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:26,076 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 108 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:26,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 289 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:09:26,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13252 states. [2025-03-16 14:09:26,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13252 to 13248. [2025-03-16 14:09:26,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13248 states, 13247 states have (on average 1.1521854004680305) internal successors, (15263), 13247 states have internal predecessors, (15263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:26,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13248 states to 13248 states and 15263 transitions. [2025-03-16 14:09:26,206 INFO L78 Accepts]: Start accepts. Automaton has 13248 states and 15263 transitions. Word has length 252 [2025-03-16 14:09:26,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:26,207 INFO L471 AbstractCegarLoop]: Abstraction has 13248 states and 15263 transitions. [2025-03-16 14:09:26,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:26,207 INFO L276 IsEmpty]: Start isEmpty. Operand 13248 states and 15263 transitions. [2025-03-16 14:09:26,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-16 14:09:26,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:26,220 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:26,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:09:26,220 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:26,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:26,220 INFO L85 PathProgramCache]: Analyzing trace with hash 92672638, now seen corresponding path program 1 times [2025-03-16 14:09:26,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:26,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950391265] [2025-03-16 14:09:26,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:26,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:26,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-16 14:09:26,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-16 14:09:26,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:26,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:26,373 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-16 14:09:26,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:26,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950391265] [2025-03-16 14:09:26,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950391265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:26,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:26,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:09:26,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617498241] [2025-03-16 14:09:26,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:26,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:26,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:26,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:26,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:26,375 INFO L87 Difference]: Start difference. First operand 13248 states and 15263 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 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-16 14:09:26,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:26,973 INFO L93 Difference]: Finished difference Result 37478 states and 43228 transitions. [2025-03-16 14:09:26,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:26,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 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) Word has length 264 [2025-03-16 14:09:26,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:27,012 INFO L225 Difference]: With dead ends: 37478 [2025-03-16 14:09:27,013 INFO L226 Difference]: Without dead ends: 24231 [2025-03-16 14:09:27,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:27,028 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 220 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:27,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 149 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:09:27,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24231 states. [2025-03-16 14:09:27,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24231 to 24229. [2025-03-16 14:09:27,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24229 states, 24228 states have (on average 1.1378570249298332) internal successors, (27568), 24228 states have internal predecessors, (27568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:27,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24229 states to 24229 states and 27568 transitions. [2025-03-16 14:09:27,370 INFO L78 Accepts]: Start accepts. Automaton has 24229 states and 27568 transitions. Word has length 264 [2025-03-16 14:09:27,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:27,370 INFO L471 AbstractCegarLoop]: Abstraction has 24229 states and 27568 transitions. [2025-03-16 14:09:27,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 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-16 14:09:27,370 INFO L276 IsEmpty]: Start isEmpty. Operand 24229 states and 27568 transitions. [2025-03-16 14:09:27,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-16 14:09:27,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:27,393 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:27,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:09:27,394 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:27,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:27,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1976978517, now seen corresponding path program 1 times [2025-03-16 14:09:27,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:27,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108125633] [2025-03-16 14:09:27,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:27,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:27,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-16 14:09:27,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-16 14:09:27,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:27,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:27,581 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:09:27,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:27,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108125633] [2025-03-16 14:09:27,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108125633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:27,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:27,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:09:27,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324555751] [2025-03-16 14:09:27,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:27,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:27,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:27,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:27,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:27,582 INFO L87 Difference]: Start difference. First operand 24229 states and 27568 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:28,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:28,290 INFO L93 Difference]: Finished difference Result 63534 states and 72242 transitions. [2025-03-16 14:09:28,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:28,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 271 [2025-03-16 14:09:28,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:28,341 INFO L225 Difference]: With dead ends: 63534 [2025-03-16 14:09:28,341 INFO L226 Difference]: Without dead ends: 39306 [2025-03-16 14:09:28,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:28,361 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 121 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:28,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 89 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:09:28,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39306 states. [2025-03-16 14:09:28,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39306 to 38899. [2025-03-16 14:09:28,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38899 states, 38898 states have (on average 1.134505630109517) internal successors, (44130), 38898 states have internal predecessors, (44130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:28,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38899 states to 38899 states and 44130 transitions. [2025-03-16 14:09:28,936 INFO L78 Accepts]: Start accepts. Automaton has 38899 states and 44130 transitions. Word has length 271 [2025-03-16 14:09:28,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:28,937 INFO L471 AbstractCegarLoop]: Abstraction has 38899 states and 44130 transitions. [2025-03-16 14:09:28,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:28,937 INFO L276 IsEmpty]: Start isEmpty. Operand 38899 states and 44130 transitions. [2025-03-16 14:09:28,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-16 14:09:28,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:28,972 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:28,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 14:09:28,973 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:28,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:28,973 INFO L85 PathProgramCache]: Analyzing trace with hash 907645234, now seen corresponding path program 1 times [2025-03-16 14:09:28,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:28,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825279949] [2025-03-16 14:09:28,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:28,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:29,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-16 14:09:29,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-16 14:09:29,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:29,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:29,243 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:09:29,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:29,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825279949] [2025-03-16 14:09:29,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825279949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:29,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:29,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:09:29,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054586896] [2025-03-16 14:09:29,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:29,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:09:29,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:29,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:09:29,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:09:29,245 INFO L87 Difference]: Start difference. First operand 38899 states and 44130 transitions. Second operand has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 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-16 14:09:30,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:30,240 INFO L93 Difference]: Finished difference Result 99208 states and 112642 transitions. [2025-03-16 14:09:30,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:09:30,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 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) Word has length 278 [2025-03-16 14:09:30,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:30,320 INFO L225 Difference]: With dead ends: 99208 [2025-03-16 14:09:30,320 INFO L226 Difference]: Without dead ends: 60310 [2025-03-16 14:09:30,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:09:30,339 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 431 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:30,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 334 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:09:30,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60310 states. [2025-03-16 14:09:30,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60310 to 59249. [2025-03-16 14:09:31,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59249 states, 59248 states have (on average 1.1311436672967863) internal successors, (67018), 59248 states have internal predecessors, (67018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:31,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59249 states to 59249 states and 67018 transitions. [2025-03-16 14:09:31,102 INFO L78 Accepts]: Start accepts. Automaton has 59249 states and 67018 transitions. Word has length 278 [2025-03-16 14:09:31,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:31,102 INFO L471 AbstractCegarLoop]: Abstraction has 59249 states and 67018 transitions. [2025-03-16 14:09:31,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 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-16 14:09:31,103 INFO L276 IsEmpty]: Start isEmpty. Operand 59249 states and 67018 transitions. [2025-03-16 14:09:31,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-16 14:09:31,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:31,134 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:31,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:09:31,134 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:31,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:31,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1261008739, now seen corresponding path program 1 times [2025-03-16 14:09:31,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:31,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988597777] [2025-03-16 14:09:31,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:31,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:31,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-16 14:09:31,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-16 14:09:31,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:31,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:31,529 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 156 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:09:31,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:31,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988597777] [2025-03-16 14:09:31,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988597777] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:09:31,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155724962] [2025-03-16 14:09:31,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:31,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:09:31,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:09:31,532 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:09:31,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 14:09:31,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-16 14:09:31,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-16 14:09:31,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:31,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:31,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:09:31,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:09:31,813 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 14:09:31,813 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:09:31,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155724962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:31,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:09:31,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 14:09:31,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218457141] [2025-03-16 14:09:31,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:31,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:31,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:31,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:31,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:09:31,815 INFO L87 Difference]: Start difference. First operand 59249 states and 67018 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:32,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:32,543 INFO L93 Difference]: Finished difference Result 119124 states and 134828 transitions. [2025-03-16 14:09:32,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:32,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 313 [2025-03-16 14:09:32,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:32,617 INFO L225 Difference]: With dead ends: 119124 [2025-03-16 14:09:32,617 INFO L226 Difference]: Without dead ends: 59876 [2025-03-16 14:09:32,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 312 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-16 14:09:32,762 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 68 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:32,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 363 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:09:32,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59876 states. [2025-03-16 14:09:33,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59876 to 59858. [2025-03-16 14:09:33,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59858 states, 59857 states have (on average 1.1297592595686385) internal successors, (67624), 59857 states have internal predecessors, (67624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:33,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59858 states to 59858 states and 67624 transitions. [2025-03-16 14:09:33,608 INFO L78 Accepts]: Start accepts. Automaton has 59858 states and 67624 transitions. Word has length 313 [2025-03-16 14:09:33,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:33,608 INFO L471 AbstractCegarLoop]: Abstraction has 59858 states and 67624 transitions. [2025-03-16 14:09:33,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:33,608 INFO L276 IsEmpty]: Start isEmpty. Operand 59858 states and 67624 transitions. [2025-03-16 14:09:33,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-03-16 14:09:33,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:33,778 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:33,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 14:09:33,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 14:09:33,979 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:33,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:33,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1952601496, now seen corresponding path program 1 times [2025-03-16 14:09:33,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:33,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702857836] [2025-03-16 14:09:33,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:33,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:34,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-16 14:09:34,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-16 14:09:34,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:34,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:34,309 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-03-16 14:09:34,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:34,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702857836] [2025-03-16 14:09:34,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702857836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:34,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:34,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:09:34,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82696513] [2025-03-16 14:09:34,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:34,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:34,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:34,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:34,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:34,311 INFO L87 Difference]: Start difference. First operand 59858 states and 67624 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:35,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:35,085 INFO L93 Difference]: Finished difference Result 126468 states and 142750 transitions. [2025-03-16 14:09:35,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:35,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 435 [2025-03-16 14:09:35,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:35,173 INFO L225 Difference]: With dead ends: 126468 [2025-03-16 14:09:35,173 INFO L226 Difference]: Without dead ends: 66611 [2025-03-16 14:09:35,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:35,216 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 187 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:35,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 333 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:09:35,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66611 states. [2025-03-16 14:09:35,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66611 to 63309. [2025-03-16 14:09:35,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63309 states, 63308 states have (on average 1.1194793706956467) internal successors, (70872), 63308 states have internal predecessors, (70872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:36,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63309 states to 63309 states and 70872 transitions. [2025-03-16 14:09:36,021 INFO L78 Accepts]: Start accepts. Automaton has 63309 states and 70872 transitions. Word has length 435 [2025-03-16 14:09:36,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:36,022 INFO L471 AbstractCegarLoop]: Abstraction has 63309 states and 70872 transitions. [2025-03-16 14:09:36,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:36,022 INFO L276 IsEmpty]: Start isEmpty. Operand 63309 states and 70872 transitions. [2025-03-16 14:09:36,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-16 14:09:36,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:36,071 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 14:09:36,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 14:09:36,071 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:36,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:36,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1352055372, now seen corresponding path program 1 times [2025-03-16 14:09:36,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:36,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780193428] [2025-03-16 14:09:36,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:36,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:36,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-16 14:09:36,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-16 14:09:36,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:36,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 620 proven. 59 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2025-03-16 14:09:36,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:36,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780193428] [2025-03-16 14:09:36,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780193428] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:09:36,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648842499] [2025-03-16 14:09:36,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:36,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:09:36,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:09:36,828 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:09:36,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 14:09:37,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-16 14:09:37,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-16 14:09:37,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:37,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:37,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:09:37,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:09:37,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 777 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2025-03-16 14:09:37,191 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:09:37,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648842499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:37,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:09:37,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 14:09:37,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799866849] [2025-03-16 14:09:37,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:37,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:37,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:37,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:37,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:09:37,192 INFO L87 Difference]: Start difference. First operand 63309 states and 70872 transitions. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:37,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:37,829 INFO L93 Difference]: Finished difference Result 159372 states and 178564 transitions. [2025-03-16 14:09:37,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:37,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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 608 [2025-03-16 14:09:37,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:37,970 INFO L225 Difference]: With dead ends: 159372 [2025-03-16 14:09:37,970 INFO L226 Difference]: Without dead ends: 96064 [2025-03-16 14:09:38,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 607 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-16 14:09:38,017 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 242 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:38,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 782 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:09:38,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96064 states. [2025-03-16 14:09:39,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96064 to 96064. [2025-03-16 14:09:39,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96064 states, 96063 states have (on average 1.1085121222531047) internal successors, (106487), 96063 states have internal predecessors, (106487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96064 states to 96064 states and 106487 transitions. [2025-03-16 14:09:39,378 INFO L78 Accepts]: Start accepts. Automaton has 96064 states and 106487 transitions. Word has length 608 [2025-03-16 14:09:39,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:39,379 INFO L471 AbstractCegarLoop]: Abstraction has 96064 states and 106487 transitions. [2025-03-16 14:09:39,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:39,379 INFO L276 IsEmpty]: Start isEmpty. Operand 96064 states and 106487 transitions. [2025-03-16 14:09:39,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-03-16 14:09:39,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:39,469 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 14:09:39,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 14:09:39,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-16 14:09:39,670 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:39,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:39,671 INFO L85 PathProgramCache]: Analyzing trace with hash 120073155, now seen corresponding path program 1 times [2025-03-16 14:09:39,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:39,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558249139] [2025-03-16 14:09:39,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:39,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:39,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-03-16 14:09:39,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-03-16 14:09:39,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:39,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1241 backedges. 651 proven. 59 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2025-03-16 14:09:40,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:40,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558249139] [2025-03-16 14:09:40,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558249139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:09:40,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511483510] [2025-03-16 14:09:40,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:40,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:09:40,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:09:40,612 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:09:40,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 14:09:40,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-03-16 14:09:40,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-03-16 14:09:40,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:40,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:40,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 944 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:09:40,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:09:40,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1241 backedges. 818 proven. 0 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2025-03-16 14:09:40,919 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:09:40,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511483510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:40,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:09:40,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 14:09:40,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686799697] [2025-03-16 14:09:40,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:40,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:40,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:40,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:40,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:09:40,921 INFO L87 Difference]: Start difference. First operand 96064 states and 106487 transitions. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:41,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:41,603 INFO L93 Difference]: Finished difference Result 240755 states and 267759 transitions. [2025-03-16 14:09:41,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:41,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 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 631 [2025-03-16 14:09:41,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:41,783 INFO L225 Difference]: With dead ends: 240755 [2025-03-16 14:09:41,784 INFO L226 Difference]: Without dead ends: 144692 [2025-03-16 14:09:41,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 630 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-16 14:09:41,863 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 183 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:41,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 839 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:09:41,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144692 states. [2025-03-16 14:09:43,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144692 to 143880. [2025-03-16 14:09:43,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143880 states, 143879 states have (on average 1.105275961050605) internal successors, (159026), 143879 states have internal predecessors, (159026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:44,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143880 states to 143880 states and 159026 transitions. [2025-03-16 14:09:44,085 INFO L78 Accepts]: Start accepts. Automaton has 143880 states and 159026 transitions. Word has length 631 [2025-03-16 14:09:44,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:44,086 INFO L471 AbstractCegarLoop]: Abstraction has 143880 states and 159026 transitions. [2025-03-16 14:09:44,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:44,086 INFO L276 IsEmpty]: Start isEmpty. Operand 143880 states and 159026 transitions. [2025-03-16 14:09:44,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 726 [2025-03-16 14:09:44,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:44,553 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:44,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 14:09:44,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:09:44,754 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:44,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:44,754 INFO L85 PathProgramCache]: Analyzing trace with hash -184408881, now seen corresponding path program 1 times [2025-03-16 14:09:44,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:44,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970657929] [2025-03-16 14:09:44,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:44,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:44,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 725 statements into 1 equivalence classes. [2025-03-16 14:09:44,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 725 of 725 statements. [2025-03-16 14:09:44,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:44,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:45,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1733 backedges. 800 proven. 59 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2025-03-16 14:09:45,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:45,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970657929] [2025-03-16 14:09:45,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970657929] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:09:45,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320861009] [2025-03-16 14:09:45,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:45,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:09:45,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:09:45,529 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:09:45,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 14:09:45,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 725 statements into 1 equivalence classes. [2025-03-16 14:09:45,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 725 of 725 statements. [2025-03-16 14:09:45,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:45,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:45,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 1116 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 14:09:45,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:09:46,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1733 backedges. 568 proven. 438 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2025-03-16 14:09:46,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:09:46,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1733 backedges. 568 proven. 438 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2025-03-16 14:09:46,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320861009] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:09:46,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:09:46,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-16 14:09:46,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113936047] [2025-03-16 14:09:46,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:09:46,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 14:09:46,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:46,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 14:09:46,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:09:46,717 INFO L87 Difference]: Start difference. First operand 143880 states and 159026 transitions. Second operand has 6 states, 6 states have (on average 100.33333333333333) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:50,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:50,454 INFO L93 Difference]: Finished difference Result 574994 states and 632587 transitions. [2025-03-16 14:09:50,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 14:09:50,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 100.33333333333333) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 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 725 [2025-03-16 14:09:50,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:51,066 INFO L225 Difference]: With dead ends: 574994 [2025-03-16 14:09:51,066 INFO L226 Difference]: Without dead ends: 431107 [2025-03-16 14:09:51,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1462 GetRequests, 1447 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2025-03-16 14:09:51,259 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 2708 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 3117 mSolverCounterSat, 981 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2708 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 4098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 981 IncrementalHoareTripleChecker+Valid, 3117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:51,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2708 Valid, 490 Invalid, 4098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [981 Valid, 3117 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 14:09:51,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431107 states. [2025-03-16 14:09:57,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431107 to 430212. [2025-03-16 14:09:57,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430212 states, 430211 states have (on average 1.0766740041514513) internal successors, (463197), 430211 states have internal predecessors, (463197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:58,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430212 states to 430212 states and 463197 transitions. [2025-03-16 14:09:58,167 INFO L78 Accepts]: Start accepts. Automaton has 430212 states and 463197 transitions. Word has length 725 [2025-03-16 14:09:58,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:58,168 INFO L471 AbstractCegarLoop]: Abstraction has 430212 states and 463197 transitions. [2025-03-16 14:09:58,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.33333333333333) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:58,168 INFO L276 IsEmpty]: Start isEmpty. Operand 430212 states and 463197 transitions. [2025-03-16 14:09:58,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2025-03-16 14:09:58,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:58,949 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:58,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 14:09:59,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:09:59,149 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:59,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:59,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2107511798, now seen corresponding path program 1 times [2025-03-16 14:09:59,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:59,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021708749] [2025-03-16 14:09:59,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:59,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:59,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 773 statements into 1 equivalence classes. [2025-03-16 14:09:59,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 773 of 773 statements. [2025-03-16 14:09:59,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:59,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:10:00,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2055 backedges. 609 proven. 0 refuted. 0 times theorem prover too weak. 1446 trivial. 0 not checked. [2025-03-16 14:10:00,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:10:00,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021708749] [2025-03-16 14:10:00,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021708749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:10:00,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:10:00,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:10:00,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936606331] [2025-03-16 14:10:00,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:10:00,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:10:00,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:10:00,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:10:00,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:10:00,187 INFO L87 Difference]: Start difference. First operand 430212 states and 463197 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:10:02,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:10:02,695 INFO L93 Difference]: Finished difference Result 869243 states and 936361 transitions. [2025-03-16 14:10:02,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:10:02,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 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 773 [2025-03-16 14:10:02,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:10:03,732 INFO L225 Difference]: With dead ends: 869243 [2025-03-16 14:10:03,733 INFO L226 Difference]: Without dead ends: 432536 [2025-03-16 14:10:03,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:10:03,877 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 89 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:10:03,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 135 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:10:04,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432536 states.