./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label13.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 67239f1bf7e0cdf325715bd48f4c9c86a0588f752ce48acb5db8e3f7bfd7cd18 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:49:53,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:49:53,546 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:49:53,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:49:53,555 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:49:53,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:49:53,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:49:53,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:49:53,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:49:53,575 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:49:53,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:49:53,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:49:53,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:49:53,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:49:53,577 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:49:53,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:49:53,577 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:49:53,577 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:49:53,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:49:53,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:49:53,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:49:53,578 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:49:53,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:49:53,578 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:49:53,578 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:49:53,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:49:53,578 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:49:53,578 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:49:53,578 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:49:53,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:49:53,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:49:53,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:49:53,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:49:53,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:49:53,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:49:53,579 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:49:53,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:49:53,579 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:49:53,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:49:53,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:49:53,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:49:53,580 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:49:53,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:49:53,580 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 -> 67239f1bf7e0cdf325715bd48f4c9c86a0588f752ce48acb5db8e3f7bfd7cd18 [2025-03-03 09:49:53,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:49:53,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:49:53,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:49:53,809 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:49:53,810 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:49:53,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label13.c [2025-03-03 09:49:54,964 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/376bf65ce/e410fc2ebf874c318a7e23a74355b99e/FLAGd9f883870 [2025-03-03 09:49:55,304 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:49:55,304 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label13.c [2025-03-03 09:49:55,323 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/376bf65ce/e410fc2ebf874c318a7e23a74355b99e/FLAGd9f883870 [2025-03-03 09:49:55,543 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/376bf65ce/e410fc2ebf874c318a7e23a74355b99e [2025-03-03 09:49:55,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:49:55,546 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:49:55,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:49:55,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:49:55,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:49:55,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:49:55" (1/1) ... [2025-03-03 09:49:55,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cf708ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:55, skipping insertion in model container [2025-03-03 09:49:55,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:49:55" (1/1) ... [2025-03-03 09:49:55,608 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:49:55,968 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_label13.c[55139,55152] [2025-03-03 09:49:56,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:49:56,013 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:49:56,146 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_label13.c[55139,55152] [2025-03-03 09:49:56,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:49:56,175 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:49:56,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:56 WrapperNode [2025-03-03 09:49:56,176 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:49:56,177 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:49:56,177 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:49:56,177 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:49:56,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:56" (1/1) ... [2025-03-03 09:49:56,210 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:56" (1/1) ... [2025-03-03 09:49:56,299 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-03-03 09:49:56,299 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:49:56,300 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:49:56,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:49:56,301 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:49:56,306 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:56" (1/1) ... [2025-03-03 09:49:56,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:56" (1/1) ... [2025-03-03 09:49:56,319 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:56" (1/1) ... [2025-03-03 09:49:56,354 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 09:49:56,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:56" (1/1) ... [2025-03-03 09:49:56,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:56" (1/1) ... [2025-03-03 09:49:56,390 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:56" (1/1) ... [2025-03-03 09:49:56,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:56" (1/1) ... [2025-03-03 09:49:56,401 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:56" (1/1) ... [2025-03-03 09:49:56,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:56" (1/1) ... [2025-03-03 09:49:56,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:49:56,421 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:49:56,421 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:49:56,422 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:49:56,422 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:56" (1/1) ... [2025-03-03 09:49:56,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:49:56,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:49:56,449 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 09:49:56,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 09:49:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:49:56,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:49:56,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:49:56,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:49:56,526 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:49:56,527 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:49:57,968 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-03 09:49:57,968 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:49:57,987 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:49:57,987 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:49:57,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:49:57 BoogieIcfgContainer [2025-03-03 09:49:57,988 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:49:57,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:49:57,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:49:57,993 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:49:57,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:49:55" (1/3) ... [2025-03-03 09:49:57,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b41fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:49:57, skipping insertion in model container [2025-03-03 09:49:57,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:56" (2/3) ... [2025-03-03 09:49:57,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b41fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:49:57, skipping insertion in model container [2025-03-03 09:49:57,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:49:57" (3/3) ... [2025-03-03 09:49:57,995 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label13.c [2025-03-03 09:49:58,006 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:49:58,009 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label13.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 09:49:58,060 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:49:58,071 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;@271c354a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:49:58,071 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:49:58,076 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:58,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 09:49:58,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:49:58,087 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] [2025-03-03 09:49:58,087 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:49:58,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:49:58,092 INFO L85 PathProgramCache]: Analyzing trace with hash 986098072, now seen corresponding path program 1 times [2025-03-03 09:49:58,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:49:58,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140199964] [2025-03-03 09:49:58,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:58,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:49:58,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 09:49:58,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 09:49:58,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:58,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:58,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:49:58,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:49:58,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140199964] [2025-03-03 09:49:58,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140199964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:49:58,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:49:58,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:49:58,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211660385] [2025-03-03 09:49:58,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:49:58,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:49:58,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:49:58,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:49:58,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:58,681 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:59,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:49:59,561 INFO L93 Difference]: Finished difference Result 829 states and 1475 transitions. [2025-03-03 09:49:59,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:49:59,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2025-03-03 09:49:59,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:49:59,571 INFO L225 Difference]: With dead ends: 829 [2025-03-03 09:49:59,574 INFO L226 Difference]: Without dead ends: 463 [2025-03-03 09:49:59,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:59,578 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 136 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 09:49:59,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 128 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 09:49:59,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-03-03 09:49:59,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 449. [2025-03-03 09:49:59,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 1.6183035714285714) internal successors, (725), 448 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:59,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 725 transitions. [2025-03-03 09:49:59,622 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 725 transitions. Word has length 155 [2025-03-03 09:49:59,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:49:59,623 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 725 transitions. [2025-03-03 09:49:59,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:59,623 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 725 transitions. [2025-03-03 09:49:59,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 09:49:59,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:49:59,629 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1] [2025-03-03 09:49:59,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:49:59,629 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:49:59,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:49:59,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1884014738, now seen corresponding path program 1 times [2025-03-03 09:49:59,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:49:59,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014045686] [2025-03-03 09:49:59,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:59,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:49:59,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 09:49:59,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 09:49:59,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:59,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:59,916 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:49:59,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:49:59,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014045686] [2025-03-03 09:49:59,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014045686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:49:59,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:49:59,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:49:59,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691499537] [2025-03-03 09:49:59,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:49:59,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:49:59,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:49:59,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:49:59,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:59,918 INFO L87 Difference]: Start difference. First operand 449 states and 725 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-03 09:50:00,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:00,155 INFO L93 Difference]: Finished difference Result 1342 states and 2170 transitions. [2025-03-03 09:50:00,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:00,159 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 160 [2025-03-03 09:50:00,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:00,163 INFO L225 Difference]: With dead ends: 1342 [2025-03-03 09:50:00,163 INFO L226 Difference]: Without dead ends: 895 [2025-03-03 09:50:00,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:00,166 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 366 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:00,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 596 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:50:00,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-03-03 09:50:00,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 893. [2025-03-03 09:50:00,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 892 states have (on average 1.6143497757847534) internal successors, (1440), 892 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:00,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1440 transitions. [2025-03-03 09:50:00,193 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1440 transitions. Word has length 160 [2025-03-03 09:50:00,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:00,193 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1440 transitions. [2025-03-03 09:50:00,193 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-03 09:50:00,193 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1440 transitions. [2025-03-03 09:50:00,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 09:50:00,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:00,195 INFO L218 NwaCegarLoop]: trace histogram [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-03 09:50:00,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:50:00,196 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:00,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:00,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1539944269, now seen corresponding path program 1 times [2025-03-03 09:50:00,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:00,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633502635] [2025-03-03 09:50:00,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:00,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:00,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 09:50:00,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 09:50:00,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:00,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:00,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:50:00,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:00,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633502635] [2025-03-03 09:50:00,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633502635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:00,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:50:00,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:50:00,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13589674] [2025-03-03 09:50:00,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:00,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:50:00,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:00,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:50:00,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:00,421 INFO L87 Difference]: Start difference. First operand 893 states and 1440 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:01,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:01,044 INFO L93 Difference]: Finished difference Result 2636 states and 4274 transitions. [2025-03-03 09:50:01,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:01,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-03-03 09:50:01,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:01,050 INFO L225 Difference]: With dead ends: 2636 [2025-03-03 09:50:01,050 INFO L226 Difference]: Without dead ends: 1745 [2025-03-03 09:50:01,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:01,052 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 89 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:01,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 132 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:50:01,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2025-03-03 09:50:01,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1717. [2025-03-03 09:50:01,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1717 states, 1716 states have (on average 1.6002331002331003) internal successors, (2746), 1716 states have internal predecessors, (2746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:01,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 2746 transitions. [2025-03-03 09:50:01,084 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 2746 transitions. Word has length 162 [2025-03-03 09:50:01,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:01,084 INFO L471 AbstractCegarLoop]: Abstraction has 1717 states and 2746 transitions. [2025-03-03 09:50:01,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:01,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 2746 transitions. [2025-03-03 09:50:01,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 09:50:01,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:01,087 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:50:01,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:50:01,087 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:01,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:01,088 INFO L85 PathProgramCache]: Analyzing trace with hash -66905359, now seen corresponding path program 1 times [2025-03-03 09:50:01,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:01,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150441573] [2025-03-03 09:50:01,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:01,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:01,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 09:50:01,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 09:50:01,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:01,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:01,228 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:50:01,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:01,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150441573] [2025-03-03 09:50:01,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150441573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:01,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:50:01,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:50:01,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023769308] [2025-03-03 09:50:01,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:01,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:50:01,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:01,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:50:01,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:01,229 INFO L87 Difference]: Start difference. First operand 1717 states and 2746 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:01,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:01,555 INFO L93 Difference]: Finished difference Result 5124 states and 8205 transitions. [2025-03-03 09:50:01,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:01,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2025-03-03 09:50:01,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:01,565 INFO L225 Difference]: With dead ends: 5124 [2025-03-03 09:50:01,565 INFO L226 Difference]: Without dead ends: 3409 [2025-03-03 09:50:01,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:01,569 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 349 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:01,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 513 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:50:01,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3409 states. [2025-03-03 09:50:01,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3409 to 3405. [2025-03-03 09:50:01,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3405 states, 3404 states have (on average 1.5940070505287895) internal successors, (5426), 3404 states have internal predecessors, (5426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:01,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3405 states to 3405 states and 5426 transitions. [2025-03-03 09:50:01,629 INFO L78 Accepts]: Start accepts. Automaton has 3405 states and 5426 transitions. Word has length 169 [2025-03-03 09:50:01,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:01,629 INFO L471 AbstractCegarLoop]: Abstraction has 3405 states and 5426 transitions. [2025-03-03 09:50:01,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:01,629 INFO L276 IsEmpty]: Start isEmpty. Operand 3405 states and 5426 transitions. [2025-03-03 09:50:01,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 09:50:01,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:01,636 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:50:01,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:50:01,636 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:01,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:01,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1149867967, now seen corresponding path program 1 times [2025-03-03 09:50:01,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:01,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975219383] [2025-03-03 09:50:01,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:01,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:01,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 09:50:01,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 09:50:01,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:01,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:01,865 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:50:01,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:01,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975219383] [2025-03-03 09:50:01,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975219383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:01,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:50:01,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:50:01,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933996007] [2025-03-03 09:50:01,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:01,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:50:01,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:01,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:50:01,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:01,867 INFO L87 Difference]: Start difference. First operand 3405 states and 5426 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:02,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:02,556 INFO L93 Difference]: Finished difference Result 8464 states and 13446 transitions. [2025-03-03 09:50:02,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:02,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 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 170 [2025-03-03 09:50:02,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:02,572 INFO L225 Difference]: With dead ends: 8464 [2025-03-03 09:50:02,573 INFO L226 Difference]: Without dead ends: 5061 [2025-03-03 09:50:02,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:02,579 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 234 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:02,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 115 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:50:02,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5061 states. [2025-03-03 09:50:02,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5061 to 5057. [2025-03-03 09:50:02,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5057 states, 5056 states have (on average 1.5518196202531647) internal successors, (7846), 5056 states have internal predecessors, (7846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:02,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5057 states to 5057 states and 7846 transitions. [2025-03-03 09:50:02,655 INFO L78 Accepts]: Start accepts. Automaton has 5057 states and 7846 transitions. Word has length 170 [2025-03-03 09:50:02,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:02,655 INFO L471 AbstractCegarLoop]: Abstraction has 5057 states and 7846 transitions. [2025-03-03 09:50:02,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:02,655 INFO L276 IsEmpty]: Start isEmpty. Operand 5057 states and 7846 transitions. [2025-03-03 09:50:02,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 09:50:02,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:02,660 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:50:02,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 09:50:02,660 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:02,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:02,661 INFO L85 PathProgramCache]: Analyzing trace with hash 706983379, now seen corresponding path program 1 times [2025-03-03 09:50:02,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:02,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282562538] [2025-03-03 09:50:02,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:02,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:02,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 09:50:02,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 09:50:02,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:02,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:02,934 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:50:02,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:02,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282562538] [2025-03-03 09:50:02,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282562538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:02,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:50:02,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:50:02,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777525766] [2025-03-03 09:50:02,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:02,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:50:02,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:02,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:50:02,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:02,936 INFO L87 Difference]: Start difference. First operand 5057 states and 7846 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:03,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:03,614 INFO L93 Difference]: Finished difference Result 14172 states and 22001 transitions. [2025-03-03 09:50:03,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:03,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2025-03-03 09:50:03,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:03,640 INFO L225 Difference]: With dead ends: 14172 [2025-03-03 09:50:03,640 INFO L226 Difference]: Without dead ends: 9117 [2025-03-03 09:50:03,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:03,648 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 201 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 194 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.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:03,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 194 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:50:03,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9117 states. [2025-03-03 09:50:03,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9117 to 9117. [2025-03-03 09:50:03,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9117 states, 9116 states have (on average 1.3648530057042563) internal successors, (12442), 9116 states have internal predecessors, (12442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:03,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9117 states to 9117 states and 12442 transitions. [2025-03-03 09:50:03,792 INFO L78 Accepts]: Start accepts. Automaton has 9117 states and 12442 transitions. Word has length 174 [2025-03-03 09:50:03,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:03,792 INFO L471 AbstractCegarLoop]: Abstraction has 9117 states and 12442 transitions. [2025-03-03 09:50:03,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:03,793 INFO L276 IsEmpty]: Start isEmpty. Operand 9117 states and 12442 transitions. [2025-03-03 09:50:03,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-03 09:50:03,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:03,801 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:50:03,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 09:50:03,801 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:03,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:03,802 INFO L85 PathProgramCache]: Analyzing trace with hash 696238006, now seen corresponding path program 1 times [2025-03-03 09:50:03,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:03,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812715108] [2025-03-03 09:50:03,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:03,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:03,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-03 09:50:03,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-03 09:50:03,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:03,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:04,682 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:50:04,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:04,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812715108] [2025-03-03 09:50:04,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812715108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:50:04,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253882374] [2025-03-03 09:50:04,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:04,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:50:04,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:50:04,685 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:50:04,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 09:50:04,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-03 09:50:04,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-03 09:50:04,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:04,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:04,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:50:04,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:50:04,985 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:50:04,986 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:50:04,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253882374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:04,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:50:04,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 09:50:04,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743137648] [2025-03-03 09:50:04,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:04,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:50:04,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:04,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:50:04,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:50:04,987 INFO L87 Difference]: Start difference. First operand 9117 states and 12442 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:05,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:05,715 INFO L93 Difference]: Finished difference Result 26396 states and 36240 transitions. [2025-03-03 09:50:05,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:05,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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 193 [2025-03-03 09:50:05,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:05,761 INFO L225 Difference]: With dead ends: 26396 [2025-03-03 09:50:05,762 INFO L226 Difference]: Without dead ends: 17281 [2025-03-03 09:50:05,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:50:05,776 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 104 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:05,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 382 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:50:05,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17281 states. [2025-03-03 09:50:05,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17281 to 17261. [2025-03-03 09:50:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17261 states, 17260 states have (on average 1.317728852838934) internal successors, (22744), 17260 states have internal predecessors, (22744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:06,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17261 states to 17261 states and 22744 transitions. [2025-03-03 09:50:06,054 INFO L78 Accepts]: Start accepts. Automaton has 17261 states and 22744 transitions. Word has length 193 [2025-03-03 09:50:06,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:06,055 INFO L471 AbstractCegarLoop]: Abstraction has 17261 states and 22744 transitions. [2025-03-03 09:50:06,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:06,056 INFO L276 IsEmpty]: Start isEmpty. Operand 17261 states and 22744 transitions. [2025-03-03 09:50:06,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-03 09:50:06,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:06,070 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:50:06,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 09:50:06,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:50:06,271 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:06,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:06,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1126262530, now seen corresponding path program 1 times [2025-03-03 09:50:06,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:06,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453054891] [2025-03-03 09:50:06,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:06,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:06,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-03 09:50:06,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-03 09:50:06,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:06,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:06,449 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 09:50:06,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:06,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453054891] [2025-03-03 09:50:06,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453054891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:06,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:50:06,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:50:06,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551525784] [2025-03-03 09:50:06,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:06,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:50:06,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:06,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:50:06,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:06,451 INFO L87 Difference]: Start difference. First operand 17261 states and 22744 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-03 09:50:07,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:07,175 INFO L93 Difference]: Finished difference Result 42447 states and 57131 transitions. [2025-03-03 09:50:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:07,175 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 202 [2025-03-03 09:50:07,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:07,220 INFO L225 Difference]: With dead ends: 42447 [2025-03-03 09:50:07,220 INFO L226 Difference]: Without dead ends: 25188 [2025-03-03 09:50:07,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:07,239 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 236 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:07,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 406 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:50:07,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25188 states. [2025-03-03 09:50:07,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25188 to 22744. [2025-03-03 09:50:07,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22744 states, 22743 states have (on average 1.27331486611265) internal successors, (28959), 22743 states have internal predecessors, (28959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:07,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22744 states to 22744 states and 28959 transitions. [2025-03-03 09:50:07,561 INFO L78 Accepts]: Start accepts. Automaton has 22744 states and 28959 transitions. Word has length 202 [2025-03-03 09:50:07,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:07,561 INFO L471 AbstractCegarLoop]: Abstraction has 22744 states and 28959 transitions. [2025-03-03 09:50:07,561 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-03 09:50:07,562 INFO L276 IsEmpty]: Start isEmpty. Operand 22744 states and 28959 transitions. [2025-03-03 09:50:07,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-03-03 09:50:07,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:07,578 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2025-03-03 09:50:07,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 09:50:07,579 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:07,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:07,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1763737709, now seen corresponding path program 1 times [2025-03-03 09:50:07,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:07,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26133939] [2025-03-03 09:50:07,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:07,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:07,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-03 09:50:07,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-03 09:50:07,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:07,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:07,891 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 97 proven. 6 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 09:50:07,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:07,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26133939] [2025-03-03 09:50:07,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26133939] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:50:07,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667040219] [2025-03-03 09:50:07,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:07,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:50:07,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:50:07,894 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:50:07,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 09:50:07,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-03 09:50:08,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-03 09:50:08,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:08,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:08,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:50:08,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:50:08,118 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-03 09:50:08,119 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:50:08,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667040219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:08,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:50:08,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 09:50:08,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330147138] [2025-03-03 09:50:08,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:08,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:50:08,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:08,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:50:08,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:50:08,120 INFO L87 Difference]: Start difference. First operand 22744 states and 28959 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:08,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:08,935 INFO L93 Difference]: Finished difference Result 67486 states and 85772 transitions. [2025-03-03 09:50:08,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:08,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 242 [2025-03-03 09:50:08,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:08,991 INFO L225 Difference]: With dead ends: 67486 [2025-03-03 09:50:08,991 INFO L226 Difference]: Without dead ends: 44744 [2025-03-03 09:50:09,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:50:09,020 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 231 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:09,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 198 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:50:09,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44744 states. [2025-03-03 09:50:09,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44744 to 44740. [2025-03-03 09:50:09,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44740 states, 44739 states have (on average 1.2298889112407518) internal successors, (55024), 44739 states have internal predecessors, (55024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:09,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44740 states to 44740 states and 55024 transitions. [2025-03-03 09:50:09,687 INFO L78 Accepts]: Start accepts. Automaton has 44740 states and 55024 transitions. Word has length 242 [2025-03-03 09:50:09,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:09,687 INFO L471 AbstractCegarLoop]: Abstraction has 44740 states and 55024 transitions. [2025-03-03 09:50:09,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:09,687 INFO L276 IsEmpty]: Start isEmpty. Operand 44740 states and 55024 transitions. [2025-03-03 09:50:09,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-03 09:50:09,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:09,722 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:50:09,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 09:50:09,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-03 09:50:09,926 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:09,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:09,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1509802961, now seen corresponding path program 1 times [2025-03-03 09:50:09,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:09,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583308458] [2025-03-03 09:50:09,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:09,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:09,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-03 09:50:09,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-03 09:50:09,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:09,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:10,923 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-03 09:50:10,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:10,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583308458] [2025-03-03 09:50:10,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583308458] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:50:10,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642916378] [2025-03-03 09:50:10,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:10,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:50:10,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:50:10,925 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:50:10,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 09:50:10,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-03 09:50:11,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-03 09:50:11,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:11,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:11,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:50:11,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:50:11,171 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-03 09:50:11,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:50:11,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642916378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:11,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:50:11,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 09:50:11,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158218264] [2025-03-03 09:50:11,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:11,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:50:11,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:11,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:50:11,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:50:11,173 INFO L87 Difference]: Start difference. First operand 44740 states and 55024 transitions. Second operand has 4 states, 4 states have (on average 49.0) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:12,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:12,411 INFO L93 Difference]: Finished difference Result 137251 states and 169367 transitions. [2025-03-03 09:50:12,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:50:12,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 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 266 [2025-03-03 09:50:12,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:12,538 INFO L225 Difference]: With dead ends: 137251 [2025-03-03 09:50:12,538 INFO L226 Difference]: Without dead ends: 92513 [2025-03-03 09:50:12,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:50:12,578 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 548 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:12,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 560 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 09:50:12,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92513 states. [2025-03-03 09:50:13,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92513 to 92431. [2025-03-03 09:50:13,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92431 states, 92430 states have (on average 1.2284647841609866) internal successors, (113547), 92430 states have internal predecessors, (113547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:13,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92431 states to 92431 states and 113547 transitions. [2025-03-03 09:50:13,752 INFO L78 Accepts]: Start accepts. Automaton has 92431 states and 113547 transitions. Word has length 266 [2025-03-03 09:50:13,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:13,752 INFO L471 AbstractCegarLoop]: Abstraction has 92431 states and 113547 transitions. [2025-03-03 09:50:13,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:13,753 INFO L276 IsEmpty]: Start isEmpty. Operand 92431 states and 113547 transitions. [2025-03-03 09:50:13,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-03 09:50:13,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:13,793 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:50:13,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 09:50:13,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:50:13,998 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:13,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:13,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1823321598, now seen corresponding path program 1 times [2025-03-03 09:50:13,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:13,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319565589] [2025-03-03 09:50:13,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:13,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:14,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-03 09:50:14,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-03 09:50:14,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:14,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:14,469 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-03 09:50:14,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:14,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319565589] [2025-03-03 09:50:14,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319565589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:14,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:50:14,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:50:14,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701962844] [2025-03-03 09:50:14,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:14,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:50:14,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:14,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:50:14,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:14,471 INFO L87 Difference]: Start difference. First operand 92431 states and 113547 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:15,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:15,541 INFO L93 Difference]: Finished difference Result 218799 states and 267690 transitions. [2025-03-03 09:50:15,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:15,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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 295 [2025-03-03 09:50:15,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:15,680 INFO L225 Difference]: With dead ends: 218799 [2025-03-03 09:50:15,681 INFO L226 Difference]: Without dead ends: 126370 [2025-03-03 09:50:15,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:15,727 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 156 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:15,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 206 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:50:15,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126370 states. [2025-03-03 09:50:16,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126370 to 126352. [2025-03-03 09:50:16,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126352 states, 126351 states have (on average 1.1968168039825566) internal successors, (151219), 126351 states have internal predecessors, (151219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:17,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126352 states to 126352 states and 151219 transitions. [2025-03-03 09:50:17,361 INFO L78 Accepts]: Start accepts. Automaton has 126352 states and 151219 transitions. Word has length 295 [2025-03-03 09:50:17,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:17,362 INFO L471 AbstractCegarLoop]: Abstraction has 126352 states and 151219 transitions. [2025-03-03 09:50:17,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:17,362 INFO L276 IsEmpty]: Start isEmpty. Operand 126352 states and 151219 transitions. [2025-03-03 09:50:17,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-03 09:50:17,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:17,408 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 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] [2025-03-03 09:50:17,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 09:50:17,408 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:17,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:17,408 INFO L85 PathProgramCache]: Analyzing trace with hash 72430913, now seen corresponding path program 1 times [2025-03-03 09:50:17,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:17,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449770624] [2025-03-03 09:50:17,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:17,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:17,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-03 09:50:17,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-03 09:50:17,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:17,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:17,775 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-03 09:50:17,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:17,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449770624] [2025-03-03 09:50:17,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449770624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:17,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:50:17,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:50:17,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079483297] [2025-03-03 09:50:17,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:17,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:50:17,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:17,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:50:17,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:50:17,777 INFO L87 Difference]: Start difference. First operand 126352 states and 151219 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:19,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:19,551 INFO L93 Difference]: Finished difference Result 380703 states and 455009 transitions. [2025-03-03 09:50:19,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:50:19,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 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 298 [2025-03-03 09:50:19,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:19,895 INFO L225 Difference]: With dead ends: 380703 [2025-03-03 09:50:19,895 INFO L226 Difference]: Without dead ends: 254353 [2025-03-03 09:50:19,989 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-03 09:50:19,989 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 480 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:19,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 558 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 09:50:20,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254353 states. [2025-03-03 09:50:22,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254353 to 254343. [2025-03-03 09:50:23,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254343 states, 254342 states have (on average 1.177021490748677) internal successors, (299366), 254342 states have internal predecessors, (299366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:23,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254343 states to 254343 states and 299366 transitions. [2025-03-03 09:50:23,610 INFO L78 Accepts]: Start accepts. Automaton has 254343 states and 299366 transitions. Word has length 298 [2025-03-03 09:50:23,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:23,610 INFO L471 AbstractCegarLoop]: Abstraction has 254343 states and 299366 transitions. [2025-03-03 09:50:23,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:23,615 INFO L276 IsEmpty]: Start isEmpty. Operand 254343 states and 299366 transitions. [2025-03-03 09:50:23,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-03 09:50:23,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:23,697 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:50:23,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 09:50:23,697 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:23,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:23,698 INFO L85 PathProgramCache]: Analyzing trace with hash 269445919, now seen corresponding path program 1 times [2025-03-03 09:50:23,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:23,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595939286] [2025-03-03 09:50:23,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:23,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:23,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-03 09:50:23,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-03 09:50:23,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:23,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:23,989 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-03-03 09:50:23,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:23,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595939286] [2025-03-03 09:50:23,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595939286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:23,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:50:23,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:50:23,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331226537] [2025-03-03 09:50:23,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:23,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:50:23,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:23,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:50:23,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:50:23,991 INFO L87 Difference]: Start difference. First operand 254343 states and 299366 transitions. Second operand has 4 states, 4 states have (on average 50.0) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:26,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:26,752 INFO L93 Difference]: Finished difference Result 747987 states and 874388 transitions. [2025-03-03 09:50:26,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:50:26,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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 300 [2025-03-03 09:50:26,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:27,487 INFO L225 Difference]: With dead ends: 747987 [2025-03-03 09:50:27,487 INFO L226 Difference]: Without dead ends: 493646 [2025-03-03 09:50:27,731 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-03 09:50:27,731 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 533 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:27,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 470 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 09:50:28,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493646 states. [2025-03-03 09:50:33,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493646 to 493576. [2025-03-03 09:50:34,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493576 states, 493575 states have (on average 1.1547059717368182) internal successors, (569934), 493575 states have internal predecessors, (569934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:34,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493576 states to 493576 states and 569934 transitions. [2025-03-03 09:50:34,740 INFO L78 Accepts]: Start accepts. Automaton has 493576 states and 569934 transitions. Word has length 300 [2025-03-03 09:50:34,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:34,740 INFO L471 AbstractCegarLoop]: Abstraction has 493576 states and 569934 transitions. [2025-03-03 09:50:34,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:34,743 INFO L276 IsEmpty]: Start isEmpty. Operand 493576 states and 569934 transitions. [2025-03-03 09:50:34,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-03 09:50:34,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:34,819 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, 2, 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] [2025-03-03 09:50:34,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 09:50:34,819 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:34,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:34,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1848398411, now seen corresponding path program 1 times [2025-03-03 09:50:34,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:34,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673335753] [2025-03-03 09:50:34,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:34,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:35,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-03 09:50:35,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-03 09:50:35,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:35,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:35,356 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:50:35,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:35,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673335753] [2025-03-03 09:50:35,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673335753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:35,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:50:35,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:50:35,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416010701] [2025-03-03 09:50:35,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:35,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:50:35,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:35,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:50:35,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:35,358 INFO L87 Difference]: Start difference. First operand 493576 states and 569934 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:39,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:39,132 INFO L93 Difference]: Finished difference Result 1037186 states and 1196357 transitions. [2025-03-03 09:50:39,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:39,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 302 [2025-03-03 09:50:39,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:39,969 INFO L225 Difference]: With dead ends: 1037186 [2025-03-03 09:50:39,969 INFO L226 Difference]: Without dead ends: 543612 [2025-03-03 09:50:40,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:40,706 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 117 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:40,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 355 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:50:40,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543612 states. [2025-03-03 09:50:46,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543612 to 505818. [2025-03-03 09:50:46,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505818 states, 505817 states have (on average 1.1292206469928847) internal successors, (571179), 505817 states have internal predecessors, (571179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)