./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label09.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 d7f66091a22b7f33dbae7f0078b7d76412336b82f61d79dbfed76c4950c4dfdc --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:59:12,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:59:12,388 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:59:12,392 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:59:12,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:59:12,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:59:12,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:59:12,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:59:12,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:59:12,412 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:59:12,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:59:12,413 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:59:12,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:59:12,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:59:12,413 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:59:12,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:59:12,414 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:59:12,414 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:59:12,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:59:12,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:59:12,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:59:12,414 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:59:12,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:59:12,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:59:12,414 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:59:12,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:59:12,415 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:59:12,415 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:59:12,415 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:59:12,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:59:12,415 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:59:12,415 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:59:12,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:59:12,415 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:59:12,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:59:12,416 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:59:12,416 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:59:12,416 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:59:12,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:59:12,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:59:12,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:59:12,416 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:59:12,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:59:12,416 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 -> d7f66091a22b7f33dbae7f0078b7d76412336b82f61d79dbfed76c4950c4dfdc [2025-03-16 14:59:12,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:59:12,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:59:12,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:59:12,628 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:59:12,628 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:59:12,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label09.c [2025-03-16 14:59:13,783 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/223d1a5c9/a5d03254a664465488c2dbfb484f4577/FLAGd183731f9 [2025-03-16 14:59:14,258 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:59:14,259 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label09.c [2025-03-16 14:59:14,289 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/223d1a5c9/a5d03254a664465488c2dbfb484f4577/FLAGd183731f9 [2025-03-16 14:59:14,346 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/223d1a5c9/a5d03254a664465488c2dbfb484f4577 [2025-03-16 14:59:14,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:59:14,348 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:59:14,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:59:14,349 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:59:14,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:59:14,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:59:14" (1/1) ... [2025-03-16 14:59:14,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f92fc21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:14, skipping insertion in model container [2025-03-16 14:59:14,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:59:14" (1/1) ... [2025-03-16 14:59:14,426 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:59:14,652 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/Problem13_label09.c[8517,8530] [2025-03-16 14:59:15,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:59:15,175 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:59:15,195 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/Problem13_label09.c[8517,8530] [2025-03-16 14:59:15,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:59:15,516 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:59:15,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:15 WrapperNode [2025-03-16 14:59:15,517 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:59:15,518 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:59:15,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:59:15,519 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:59:15,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:15" (1/1) ... [2025-03-16 14:59:15,568 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:15" (1/1) ... [2025-03-16 14:59:15,981 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-16 14:59:15,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:59:15,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:59:15,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:59:15,983 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:59:15,990 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:15" (1/1) ... [2025-03-16 14:59:15,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:15" (1/1) ... [2025-03-16 14:59:16,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:15" (1/1) ... [2025-03-16 14:59:16,250 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 14:59:16,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:15" (1/1) ... [2025-03-16 14:59:16,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:15" (1/1) ... [2025-03-16 14:59:16,389 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:15" (1/1) ... [2025-03-16 14:59:16,414 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:15" (1/1) ... [2025-03-16 14:59:16,450 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:15" (1/1) ... [2025-03-16 14:59:16,473 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:15" (1/1) ... [2025-03-16 14:59:16,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:59:16,570 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:59:16,570 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:59:16,570 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:59:16,571 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:15" (1/1) ... [2025-03-16 14:59:16,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:59:16,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:59:16,614 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 14:59:16,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 14:59:16,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:59:16,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:59:16,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:59:16,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:59:16,692 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:59:16,693 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:59:20,650 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-16 14:59:20,650 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-16 14:59:20,651 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-16 14:59:20,790 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-16 14:59:20,790 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:59:20,822 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:59:20,822 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:59:20,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:59:20 BoogieIcfgContainer [2025-03-16 14:59:20,823 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:59:20,828 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:59:20,828 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:59:20,831 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:59:20,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:59:14" (1/3) ... [2025-03-16 14:59:20,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423c4505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:59:20, skipping insertion in model container [2025-03-16 14:59:20,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:15" (2/3) ... [2025-03-16 14:59:20,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423c4505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:59:20, skipping insertion in model container [2025-03-16 14:59:20,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:59:20" (3/3) ... [2025-03-16 14:59:20,832 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label09.c [2025-03-16 14:59:20,842 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:59:20,843 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label09.c that has 1 procedures, 1037 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:59:20,903 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:59:20,910 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;@4879b0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:59:20,911 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:59:20,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 1037 states, 1035 states have (on average 1.8753623188405797) internal successors, (1941), 1036 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:20,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 14:59:20,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:20,920 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] [2025-03-16 14:59:20,920 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:20,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:20,923 INFO L85 PathProgramCache]: Analyzing trace with hash -2009499460, now seen corresponding path program 1 times [2025-03-16 14:59:20,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:20,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242540733] [2025-03-16 14:59:20,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:20,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:20,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 14:59:20,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 14:59:20,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:20,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:21,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:59:21,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:21,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242540733] [2025-03-16 14:59:21,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242540733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:21,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:21,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:59:21,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960865398] [2025-03-16 14:59:21,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:21,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:59:21,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:21,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:59:21,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:59:21,052 INFO L87 Difference]: Start difference. First operand has 1037 states, 1035 states have (on average 1.8753623188405797) internal successors, (1941), 1036 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:21,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:21,123 INFO L93 Difference]: Finished difference Result 2073 states and 3881 transitions. [2025-03-16 14:59:21,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:59:21,124 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-16 14:59:21,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:21,139 INFO L225 Difference]: With dead ends: 2073 [2025-03-16 14:59:21,140 INFO L226 Difference]: Without dead ends: 1034 [2025-03-16 14:59:21,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:59:21,145 INFO L435 NwaCegarLoop]: 1879 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:21,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:59:21,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2025-03-16 14:59:21,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2025-03-16 14:59:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:21,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2025-03-16 14:59:21,224 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 59 [2025-03-16 14:59:21,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:21,224 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2025-03-16 14:59:21,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:21,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2025-03-16 14:59:21,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 14:59:21,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:21,225 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] [2025-03-16 14:59:21,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:59:21,225 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:21,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:21,226 INFO L85 PathProgramCache]: Analyzing trace with hash 302165020, now seen corresponding path program 1 times [2025-03-16 14:59:21,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:21,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097739446] [2025-03-16 14:59:21,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:21,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:21,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 14:59:21,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 14:59:21,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:21,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:21,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:59:21,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:21,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097739446] [2025-03-16 14:59:21,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097739446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:21,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:21,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:59:21,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770174451] [2025-03-16 14:59:21,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:21,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:21,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:21,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:21,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:21,437 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:25,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:25,440 INFO L93 Difference]: Finished difference Result 2976 states and 5471 transitions. [2025-03-16 14:59:25,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:25,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-16 14:59:25,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:25,447 INFO L225 Difference]: With dead ends: 2976 [2025-03-16 14:59:25,447 INFO L226 Difference]: Without dead ends: 1943 [2025-03-16 14:59:25,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:25,452 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 895 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 3049 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 3581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 3049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:25,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 535 Invalid, 3581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 3049 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-16 14:59:25,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2025-03-16 14:59:25,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1872. [2025-03-16 14:59:25,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1871 states have (on average 1.7397113842864778) internal successors, (3255), 1871 states have internal predecessors, (3255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:25,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 3255 transitions. [2025-03-16 14:59:25,507 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 3255 transitions. Word has length 59 [2025-03-16 14:59:25,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:25,507 INFO L471 AbstractCegarLoop]: Abstraction has 1872 states and 3255 transitions. [2025-03-16 14:59:25,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:25,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 3255 transitions. [2025-03-16 14:59:25,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-16 14:59:25,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:25,511 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:59:25,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:59:25,512 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:25,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:25,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1528664465, now seen corresponding path program 1 times [2025-03-16 14:59:25,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:25,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5264408] [2025-03-16 14:59:25,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:25,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:25,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-16 14:59:25,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-16 14:59:25,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:25,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:25,888 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:59:25,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:25,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5264408] [2025-03-16 14:59:25,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5264408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:25,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:25,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:59:25,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498562522] [2025-03-16 14:59:25,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:25,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:25,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:25,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:25,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:25,892 INFO L87 Difference]: Start difference. First operand 1872 states and 3255 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:28,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:28,539 INFO L93 Difference]: Finished difference Result 4603 states and 7963 transitions. [2025-03-16 14:59:28,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:28,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-03-16 14:59:28,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:28,548 INFO L225 Difference]: With dead ends: 4603 [2025-03-16 14:59:28,549 INFO L226 Difference]: Without dead ends: 2732 [2025-03-16 14:59:28,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:28,553 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 815 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 3016 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 3180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 3016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:28,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 737 Invalid, 3180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 3016 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 14:59:28,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2025-03-16 14:59:28,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 2669. [2025-03-16 14:59:28,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2669 states, 2668 states have (on average 1.6581709145427286) internal successors, (4424), 2668 states have internal predecessors, (4424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:28,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2669 states and 4424 transitions. [2025-03-16 14:59:28,595 INFO L78 Accepts]: Start accepts. Automaton has 2669 states and 4424 transitions. Word has length 124 [2025-03-16 14:59:28,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:28,596 INFO L471 AbstractCegarLoop]: Abstraction has 2669 states and 4424 transitions. [2025-03-16 14:59:28,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:28,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 4424 transitions. [2025-03-16 14:59:28,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-16 14:59:28,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:28,599 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:59:28,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:59:28,599 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:28,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:28,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1183049889, now seen corresponding path program 1 times [2025-03-16 14:59:28,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:28,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027937693] [2025-03-16 14:59:28,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:28,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:28,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-16 14:59:28,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-16 14:59:28,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:28,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:28,722 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:59:28,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:28,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027937693] [2025-03-16 14:59:28,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027937693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:28,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:28,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:59:28,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753123614] [2025-03-16 14:59:28,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:28,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:28,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:28,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:28,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:28,723 INFO L87 Difference]: Start difference. First operand 2669 states and 4424 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:31,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:31,552 INFO L93 Difference]: Finished difference Result 7731 states and 12863 transitions. [2025-03-16 14:59:31,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:31,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-03-16 14:59:31,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:31,566 INFO L225 Difference]: With dead ends: 7731 [2025-03-16 14:59:31,566 INFO L226 Difference]: Without dead ends: 5063 [2025-03-16 14:59:31,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:31,572 INFO L435 NwaCegarLoop]: 982 mSDtfsCounter, 870 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 3255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:31,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 1135 Invalid, 3255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-16 14:59:31,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5063 states. [2025-03-16 14:59:31,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5063 to 5062. [2025-03-16 14:59:31,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5062 states, 5061 states have (on average 1.4546532305868405) internal successors, (7362), 5061 states have internal predecessors, (7362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:31,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5062 states to 5062 states and 7362 transitions. [2025-03-16 14:59:31,642 INFO L78 Accepts]: Start accepts. Automaton has 5062 states and 7362 transitions. Word has length 125 [2025-03-16 14:59:31,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:31,643 INFO L471 AbstractCegarLoop]: Abstraction has 5062 states and 7362 transitions. [2025-03-16 14:59:31,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:31,644 INFO L276 IsEmpty]: Start isEmpty. Operand 5062 states and 7362 transitions. [2025-03-16 14:59:31,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 14:59:31,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:31,645 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:59:31,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:59:31,646 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:31,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:31,646 INFO L85 PathProgramCache]: Analyzing trace with hash 313180517, now seen corresponding path program 1 times [2025-03-16 14:59:31,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:31,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617281752] [2025-03-16 14:59:31,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:31,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:31,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 14:59:31,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 14:59:31,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:31,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:31,763 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:59:31,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:31,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617281752] [2025-03-16 14:59:31,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617281752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:31,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:31,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:59:31,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146712300] [2025-03-16 14:59:31,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:31,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:31,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:31,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:31,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:31,766 INFO L87 Difference]: Start difference. First operand 5062 states and 7362 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:34,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:34,431 INFO L93 Difference]: Finished difference Result 12512 states and 18430 transitions. [2025-03-16 14:59:34,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:34,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2025-03-16 14:59:34,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:34,446 INFO L225 Difference]: With dead ends: 12512 [2025-03-16 14:59:34,446 INFO L226 Difference]: Without dead ends: 7451 [2025-03-16 14:59:34,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:34,451 INFO L435 NwaCegarLoop]: 1041 mSDtfsCounter, 871 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2661 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 3380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 2661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:34,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1174 Invalid, 3380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 2661 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 14:59:34,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7451 states. [2025-03-16 14:59:34,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7451 to 7443. [2025-03-16 14:59:34,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7443 states, 7442 states have (on average 1.3368718086535878) internal successors, (9949), 7442 states have internal predecessors, (9949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:34,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7443 states to 7443 states and 9949 transitions. [2025-03-16 14:59:34,541 INFO L78 Accepts]: Start accepts. Automaton has 7443 states and 9949 transitions. Word has length 128 [2025-03-16 14:59:34,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:34,541 INFO L471 AbstractCegarLoop]: Abstraction has 7443 states and 9949 transitions. [2025-03-16 14:59:34,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:34,541 INFO L276 IsEmpty]: Start isEmpty. Operand 7443 states and 9949 transitions. [2025-03-16 14:59:34,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 14:59:34,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:34,542 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:59:34,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:59:34,542 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:34,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:34,543 INFO L85 PathProgramCache]: Analyzing trace with hash -446952711, now seen corresponding path program 1 times [2025-03-16 14:59:34,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:34,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603543659] [2025-03-16 14:59:34,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:34,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:34,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 14:59:34,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 14:59:34,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:34,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:34,696 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:59:34,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:34,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603543659] [2025-03-16 14:59:34,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603543659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:34,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:34,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:59:34,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196186948] [2025-03-16 14:59:34,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:34,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:34,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:34,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:34,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:34,697 INFO L87 Difference]: Start difference. First operand 7443 states and 9949 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:37,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:37,151 INFO L93 Difference]: Finished difference Result 20423 states and 27780 transitions. [2025-03-16 14:59:37,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:37,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2025-03-16 14:59:37,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:37,179 INFO L225 Difference]: With dead ends: 20423 [2025-03-16 14:59:37,179 INFO L226 Difference]: Without dead ends: 13768 [2025-03-16 14:59:37,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:37,187 INFO L435 NwaCegarLoop]: 1009 mSDtfsCounter, 805 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2489 mSolverCounterSat, 784 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 3273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 784 IncrementalHoareTripleChecker+Valid, 2489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:37,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 1160 Invalid, 3273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [784 Valid, 2489 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 14:59:37,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13768 states. [2025-03-16 14:59:37,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13768 to 12961. [2025-03-16 14:59:37,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12961 states, 12960 states have (on average 1.2383487654320988) internal successors, (16049), 12960 states have internal predecessors, (16049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:37,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12961 states to 12961 states and 16049 transitions. [2025-03-16 14:59:37,532 INFO L78 Accepts]: Start accepts. Automaton has 12961 states and 16049 transitions. Word has length 132 [2025-03-16 14:59:37,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:37,534 INFO L471 AbstractCegarLoop]: Abstraction has 12961 states and 16049 transitions. [2025-03-16 14:59:37,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:37,534 INFO L276 IsEmpty]: Start isEmpty. Operand 12961 states and 16049 transitions. [2025-03-16 14:59:37,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-16 14:59:37,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:37,535 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:59:37,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:59:37,536 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:37,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:37,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1166065075, now seen corresponding path program 1 times [2025-03-16 14:59:37,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:37,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423918788] [2025-03-16 14:59:37,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:37,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:37,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-16 14:59:37,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-16 14:59:37,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:37,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:37,818 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:59:37,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:37,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423918788] [2025-03-16 14:59:37,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423918788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:37,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:37,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:59:37,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034179810] [2025-03-16 14:59:37,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:37,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:37,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:37,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:37,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:37,820 INFO L87 Difference]: Start difference. First operand 12961 states and 16049 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:39,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:39,962 INFO L93 Difference]: Finished difference Result 25134 states and 31300 transitions. [2025-03-16 14:59:39,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:39,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2025-03-16 14:59:39,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:39,982 INFO L225 Difference]: With dead ends: 25134 [2025-03-16 14:59:39,983 INFO L226 Difference]: Without dead ends: 12961 [2025-03-16 14:59:39,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:39,992 INFO L435 NwaCegarLoop]: 1082 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 2524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:39,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1211 Invalid, 2524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 14:59:40,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12961 states. [2025-03-16 14:59:40,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12961 to 12961. [2025-03-16 14:59:40,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12961 states, 12960 states have (on average 1.237962962962963) internal successors, (16044), 12960 states have internal predecessors, (16044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:40,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12961 states to 12961 states and 16044 transitions. [2025-03-16 14:59:40,140 INFO L78 Accepts]: Start accepts. Automaton has 12961 states and 16044 transitions. Word has length 148 [2025-03-16 14:59:40,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:40,141 INFO L471 AbstractCegarLoop]: Abstraction has 12961 states and 16044 transitions. [2025-03-16 14:59:40,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:40,141 INFO L276 IsEmpty]: Start isEmpty. Operand 12961 states and 16044 transitions. [2025-03-16 14:59:40,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-16 14:59:40,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:40,143 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:59:40,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:59:40,143 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:40,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:40,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1818579437, now seen corresponding path program 1 times [2025-03-16 14:59:40,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:40,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477146650] [2025-03-16 14:59:40,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:40,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:40,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-16 14:59:40,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-16 14:59:40,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:40,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:40,240 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-16 14:59:40,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:40,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477146650] [2025-03-16 14:59:40,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477146650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:40,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:40,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:59:40,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099875374] [2025-03-16 14:59:40,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:40,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:40,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:40,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:40,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:40,242 INFO L87 Difference]: Start difference. First operand 12961 states and 16044 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:43,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:43,244 INFO L93 Difference]: Finished difference Result 36202 states and 45320 transitions. [2025-03-16 14:59:43,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:43,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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-16 14:59:43,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:43,283 INFO L225 Difference]: With dead ends: 36202 [2025-03-16 14:59:43,283 INFO L226 Difference]: Without dead ends: 24029 [2025-03-16 14:59:43,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:43,297 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 907 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 2913 mSolverCounterSat, 534 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 3447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 534 IncrementalHoareTripleChecker+Valid, 2913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:43,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 692 Invalid, 3447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [534 Valid, 2913 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-16 14:59:43,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24029 states. [2025-03-16 14:59:43,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24029 to 24022. [2025-03-16 14:59:43,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24022 states, 24021 states have (on average 1.2176845260397153) internal successors, (29250), 24021 states have internal predecessors, (29250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:43,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24022 states to 24022 states and 29250 transitions. [2025-03-16 14:59:43,669 INFO L78 Accepts]: Start accepts. Automaton has 24022 states and 29250 transitions. Word has length 155 [2025-03-16 14:59:43,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:43,670 INFO L471 AbstractCegarLoop]: Abstraction has 24022 states and 29250 transitions. [2025-03-16 14:59:43,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:43,670 INFO L276 IsEmpty]: Start isEmpty. Operand 24022 states and 29250 transitions. [2025-03-16 14:59:43,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-16 14:59:43,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:43,675 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:59:43,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:59:43,675 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:43,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:43,676 INFO L85 PathProgramCache]: Analyzing trace with hash -874599175, now seen corresponding path program 1 times [2025-03-16 14:59:43,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:43,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386920317] [2025-03-16 14:59:43,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:43,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:43,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-16 14:59:43,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-16 14:59:43,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:43,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:43,943 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:59:43,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:43,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386920317] [2025-03-16 14:59:43,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386920317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:43,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:43,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:59:43,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948733459] [2025-03-16 14:59:43,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:43,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:43,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:43,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:43,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:43,946 INFO L87 Difference]: Start difference. First operand 24022 states and 29250 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:46,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:46,620 INFO L93 Difference]: Finished difference Result 59094 states and 73595 transitions. [2025-03-16 14:59:46,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:46,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 271 [2025-03-16 14:59:46,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:46,662 INFO L225 Difference]: With dead ends: 59094 [2025-03-16 14:59:46,662 INFO L226 Difference]: Without dead ends: 35860 [2025-03-16 14:59:46,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:46,676 INFO L435 NwaCegarLoop]: 1774 mSDtfsCounter, 774 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2547 mSolverCounterSat, 720 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1916 SdHoareTripleChecker+Invalid, 3267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 720 IncrementalHoareTripleChecker+Valid, 2547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:46,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 1916 Invalid, 3267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [720 Valid, 2547 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 14:59:46,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35860 states. [2025-03-16 14:59:46,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35860 to 35832. [2025-03-16 14:59:47,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35832 states, 35831 states have (on average 1.177611565404259) internal successors, (42195), 35831 states have internal predecessors, (42195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:47,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35832 states to 35832 states and 42195 transitions. [2025-03-16 14:59:47,069 INFO L78 Accepts]: Start accepts. Automaton has 35832 states and 42195 transitions. Word has length 271 [2025-03-16 14:59:47,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:47,069 INFO L471 AbstractCegarLoop]: Abstraction has 35832 states and 42195 transitions. [2025-03-16 14:59:47,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:47,070 INFO L276 IsEmpty]: Start isEmpty. Operand 35832 states and 42195 transitions. [2025-03-16 14:59:47,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-16 14:59:47,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:47,074 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:59:47,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:59:47,074 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:47,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:47,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1406457985, now seen corresponding path program 1 times [2025-03-16 14:59:47,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:47,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291323751] [2025-03-16 14:59:47,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:47,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:47,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-16 14:59:47,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-16 14:59:47,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:47,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:47,179 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:59:47,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:47,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291323751] [2025-03-16 14:59:47,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291323751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:47,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:47,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:59:47,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530308104] [2025-03-16 14:59:47,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:47,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:47,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:47,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:47,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:47,182 INFO L87 Difference]: Start difference. First operand 35832 states and 42195 transitions. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:49,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:49,958 INFO L93 Difference]: Finished difference Result 99982 states and 118663 transitions. [2025-03-16 14:59:49,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:49,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 273 [2025-03-16 14:59:49,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:50,035 INFO L225 Difference]: With dead ends: 99982 [2025-03-16 14:59:50,035 INFO L226 Difference]: Without dead ends: 62573 [2025-03-16 14:59:50,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:50,067 INFO L435 NwaCegarLoop]: 1664 mSDtfsCounter, 956 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2409 mSolverCounterSat, 813 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 1800 SdHoareTripleChecker+Invalid, 3222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 813 IncrementalHoareTripleChecker+Valid, 2409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:50,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 1800 Invalid, 3222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [813 Valid, 2409 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 14:59:50,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62573 states. [2025-03-16 14:59:50,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62573 to 60204. [2025-03-16 14:59:50,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60204 states, 60203 states have (on average 1.150308124179858) internal successors, (69252), 60203 states have internal predecessors, (69252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:50,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60204 states to 60204 states and 69252 transitions. [2025-03-16 14:59:50,883 INFO L78 Accepts]: Start accepts. Automaton has 60204 states and 69252 transitions. Word has length 273 [2025-03-16 14:59:50,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:50,887 INFO L471 AbstractCegarLoop]: Abstraction has 60204 states and 69252 transitions. [2025-03-16 14:59:50,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:50,887 INFO L276 IsEmpty]: Start isEmpty. Operand 60204 states and 69252 transitions. [2025-03-16 14:59:50,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-03-16 14:59:50,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:50,892 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:59:50,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:59:50,892 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:50,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:50,893 INFO L85 PathProgramCache]: Analyzing trace with hash 374925958, now seen corresponding path program 1 times [2025-03-16 14:59:50,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:50,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923216968] [2025-03-16 14:59:50,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:50,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:50,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-16 14:59:50,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-16 14:59:50,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:50,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:51,330 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-16 14:59:51,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:51,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923216968] [2025-03-16 14:59:51,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923216968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:51,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:51,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:59:51,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612427093] [2025-03-16 14:59:51,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:51,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:59:51,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:51,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:59:51,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:59:51,332 INFO L87 Difference]: Start difference. First operand 60204 states and 69252 transitions. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:57,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:57,002 INFO L93 Difference]: Finished difference Result 170197 states and 196121 transitions. [2025-03-16 14:59:57,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:59:57,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 347 [2025-03-16 14:59:57,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:57,143 INFO L225 Difference]: With dead ends: 170197 [2025-03-16 14:59:57,144 INFO L226 Difference]: Without dead ends: 110781 [2025-03-16 14:59:57,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:59:57,195 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 1700 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 6988 mSolverCounterSat, 942 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1700 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 7930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 942 IncrementalHoareTripleChecker+Valid, 6988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:57,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1700 Valid, 1093 Invalid, 7930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [942 Valid, 6988 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-03-16 14:59:57,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110781 states. [2025-03-16 14:59:58,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110781 to 108294. [2025-03-16 14:59:58,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108294 states, 108293 states have (on average 1.140323012567756) internal successors, (123489), 108293 states have internal predecessors, (123489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108294 states to 108294 states and 123489 transitions. [2025-03-16 14:59:58,547 INFO L78 Accepts]: Start accepts. Automaton has 108294 states and 123489 transitions. Word has length 347 [2025-03-16 14:59:58,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:58,547 INFO L471 AbstractCegarLoop]: Abstraction has 108294 states and 123489 transitions. [2025-03-16 14:59:58,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:58,547 INFO L276 IsEmpty]: Start isEmpty. Operand 108294 states and 123489 transitions. [2025-03-16 14:59:58,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-03-16 14:59:58,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:58,551 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:59:58,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:59:58,551 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:58,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:58,552 INFO L85 PathProgramCache]: Analyzing trace with hash 394903309, now seen corresponding path program 1 times [2025-03-16 14:59:58,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:58,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340321464] [2025-03-16 14:59:58,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:58,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:58,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-16 14:59:58,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-16 14:59:58,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:58,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:59,277 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 90 proven. 50 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-16 14:59:59,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:59,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340321464] [2025-03-16 14:59:59,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340321464] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:59:59,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679426566] [2025-03-16 14:59:59,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:59,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:59:59,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:59:59,280 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:59:59,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 14:59:59,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-16 14:59:59,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-16 14:59:59,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:59,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:59,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:59:59,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:59:59,649 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-16 14:59:59,653 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:59:59,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679426566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:59,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:59:59,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 14:59:59,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061251908] [2025-03-16 14:59:59,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:59,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:59,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:59,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:59,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:59:59,655 INFO L87 Difference]: Start difference. First operand 108294 states and 123489 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:02,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:02,287 INFO L93 Difference]: Finished difference Result 215789 states and 246175 transitions. [2025-03-16 15:00:02,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:02,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 350 [2025-03-16 15:00:02,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:02,430 INFO L225 Difference]: With dead ends: 215789 [2025-03-16 15:00:02,430 INFO L226 Difference]: Without dead ends: 108283 [2025-03-16 15:00:02,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:00:02,492 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 1080 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:02,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 798 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:00:02,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108283 states. [2025-03-16 15:00:03,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108283 to 108280. [2025-03-16 15:00:03,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108280 states, 108279 states have (on average 1.1037689672050905) internal successors, (119515), 108279 states have internal predecessors, (119515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:04,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108280 states to 108280 states and 119515 transitions. [2025-03-16 15:00:04,081 INFO L78 Accepts]: Start accepts. Automaton has 108280 states and 119515 transitions. Word has length 350 [2025-03-16 15:00:04,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:04,082 INFO L471 AbstractCegarLoop]: Abstraction has 108280 states and 119515 transitions. [2025-03-16 15:00:04,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:04,082 INFO L276 IsEmpty]: Start isEmpty. Operand 108280 states and 119515 transitions. [2025-03-16 15:00:04,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-03-16 15:00:04,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:04,087 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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-16 15:00:04,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 15:00:04,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-16 15:00:04,292 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:04,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:04,293 INFO L85 PathProgramCache]: Analyzing trace with hash -950184131, now seen corresponding path program 1 times [2025-03-16 15:00:04,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:04,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235900220] [2025-03-16 15:00:04,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:04,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:04,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-03-16 15:00:04,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-03-16 15:00:04,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:04,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:05,359 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 284 proven. 113 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-16 15:00:05,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:05,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235900220] [2025-03-16 15:00:05,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235900220] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:00:05,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345873709] [2025-03-16 15:00:05,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:05,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:00:05,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:00:05,362 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:00:05,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 15:00:05,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-03-16 15:00:05,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-03-16 15:00:05,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:05,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:05,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:00:05,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:00:05,630 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-03-16 15:00:05,630 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:00:05,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345873709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:05,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:00:05,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-16 15:00:05,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615109092] [2025-03-16 15:00:05,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:05,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:00:05,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:05,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:00:05,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:00:05,632 INFO L87 Difference]: Start difference. First operand 108280 states and 119515 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:08,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:08,987 INFO L93 Difference]: Finished difference Result 215770 states and 238236 transitions. [2025-03-16 15:00:08,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:08,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 385 [2025-03-16 15:00:08,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:09,130 INFO L225 Difference]: With dead ends: 215770 [2025-03-16 15:00:09,131 INFO L226 Difference]: Without dead ends: 108278 [2025-03-16 15:00:09,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:00:09,171 INFO L435 NwaCegarLoop]: 1342 mSDtfsCounter, 1113 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2450 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 2894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:09,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1419 Invalid, 2894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2450 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:00:09,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108278 states. [2025-03-16 15:00:10,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108278 to 107486. [2025-03-16 15:00:10,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107486 states, 107485 states have (on average 1.079052891101084) internal successors, (115982), 107485 states have internal predecessors, (115982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:10,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107486 states to 107486 states and 115982 transitions. [2025-03-16 15:00:10,499 INFO L78 Accepts]: Start accepts. Automaton has 107486 states and 115982 transitions. Word has length 385 [2025-03-16 15:00:10,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:10,500 INFO L471 AbstractCegarLoop]: Abstraction has 107486 states and 115982 transitions. [2025-03-16 15:00:10,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:10,500 INFO L276 IsEmpty]: Start isEmpty. Operand 107486 states and 115982 transitions. [2025-03-16 15:00:10,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-16 15:00:10,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:10,507 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:00:10,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 15:00:10,707 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,SelfDestructingSolverStorable12 [2025-03-16 15:00:10,707 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:10,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:10,708 INFO L85 PathProgramCache]: Analyzing trace with hash -827506313, now seen corresponding path program 1 times [2025-03-16 15:00:10,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:10,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49882478] [2025-03-16 15:00:10,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:10,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:10,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-16 15:00:10,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-16 15:00:10,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:10,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:10,927 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-16 15:00:10,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:10,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49882478] [2025-03-16 15:00:10,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49882478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:10,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:00:10,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:00:10,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38535047] [2025-03-16 15:00:10,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:10,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:00:10,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:10,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:00:10,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:10,929 INFO L87 Difference]: Start difference. First operand 107486 states and 115982 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:14,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:14,375 INFO L93 Difference]: Finished difference Result 251188 states and 273307 transitions. [2025-03-16 15:00:14,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:14,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 453 [2025-03-16 15:00:14,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:14,524 INFO L225 Difference]: With dead ends: 251188 [2025-03-16 15:00:14,524 INFO L226 Difference]: Without dead ends: 141342 [2025-03-16 15:00:14,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:14,573 INFO L435 NwaCegarLoop]: 1736 mSDtfsCounter, 786 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2518 mSolverCounterSat, 711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 3229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 711 IncrementalHoareTripleChecker+Valid, 2518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:14,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1879 Invalid, 3229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [711 Valid, 2518 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:00:14,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141342 states. [2025-03-16 15:00:15,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141342 to 138965. [2025-03-16 15:00:15,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138965 states, 138964 states have (on average 1.0677297717394434) internal successors, (148376), 138964 states have internal predecessors, (148376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138965 states to 138965 states and 148376 transitions. [2025-03-16 15:00:16,129 INFO L78 Accepts]: Start accepts. Automaton has 138965 states and 148376 transitions. Word has length 453 [2025-03-16 15:00:16,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:16,130 INFO L471 AbstractCegarLoop]: Abstraction has 138965 states and 148376 transitions. [2025-03-16 15:00:16,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:16,130 INFO L276 IsEmpty]: Start isEmpty. Operand 138965 states and 148376 transitions. [2025-03-16 15:00:16,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-03-16 15:00:16,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:16,141 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:00:16,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:00:16,142 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:16,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:16,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1478034048, now seen corresponding path program 1 times [2025-03-16 15:00:16,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:16,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790023876] [2025-03-16 15:00:16,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:16,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:16,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-03-16 15:00:16,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-03-16 15:00:16,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:16,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:17,410 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 353 proven. 113 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-16 15:00:17,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:17,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790023876] [2025-03-16 15:00:17,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790023876] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:00:17,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824741750] [2025-03-16 15:00:17,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:17,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:00:17,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:00:17,415 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:00:17,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 15:00:17,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-03-16 15:00:17,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-03-16 15:00:17,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:17,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:17,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:00:17,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:00:17,586 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-03-16 15:00:17,586 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:00:17,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824741750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:17,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:00:17,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-16 15:00:17,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82356937] [2025-03-16 15:00:17,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:17,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:00:17,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:17,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:00:17,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:00:17,588 INFO L87 Difference]: Start difference. First operand 138965 states and 148376 transitions. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:21,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:21,078 INFO L93 Difference]: Finished difference Result 301522 states and 322759 transitions. [2025-03-16 15:00:21,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:21,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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 475 [2025-03-16 15:00:21,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:21,346 INFO L225 Difference]: With dead ends: 301522 [2025-03-16 15:00:21,347 INFO L226 Difference]: Without dead ends: 175154 [2025-03-16 15:00:21,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:00:21,455 INFO L435 NwaCegarLoop]: 1586 mSDtfsCounter, 943 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 2578 mSolverCounterSat, 723 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 3301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 723 IncrementalHoareTripleChecker+Valid, 2578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:21,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 1699 Invalid, 3301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [723 Valid, 2578 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 15:00:21,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175154 states. [2025-03-16 15:00:23,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175154 to 165703. [2025-03-16 15:00:23,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165703 states, 165702 states have (on average 1.062027012347467) internal successors, (175980), 165702 states have internal predecessors, (175980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:23,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165703 states to 165703 states and 175980 transitions. [2025-03-16 15:00:23,547 INFO L78 Accepts]: Start accepts. Automaton has 165703 states and 175980 transitions. Word has length 475 [2025-03-16 15:00:23,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:23,548 INFO L471 AbstractCegarLoop]: Abstraction has 165703 states and 175980 transitions. [2025-03-16 15:00:23,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:23,548 INFO L276 IsEmpty]: Start isEmpty. Operand 165703 states and 175980 transitions. [2025-03-16 15:00:23,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2025-03-16 15:00:23,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:23,563 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:00:23,569 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-16 15:00:23,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:00:23,764 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:23,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:23,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1301702557, now seen corresponding path program 1 times [2025-03-16 15:00:23,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:23,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303370718] [2025-03-16 15:00:23,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:23,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:23,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-03-16 15:00:23,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-03-16 15:00:23,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:23,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:24,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1046 backedges. 613 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2025-03-16 15:00:24,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:24,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303370718] [2025-03-16 15:00:24,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303370718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:24,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:00:24,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:00:24,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547063443] [2025-03-16 15:00:24,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:24,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:00:24,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:24,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:00:24,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:24,048 INFO L87 Difference]: Start difference. First operand 165703 states and 175980 transitions. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:27,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:27,821 INFO L93 Difference]: Finished difference Result 366827 states and 391863 transitions. [2025-03-16 15:00:27,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:27,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 516 [2025-03-16 15:00:27,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:28,089 INFO L225 Difference]: With dead ends: 366827 [2025-03-16 15:00:28,089 INFO L226 Difference]: Without dead ends: 201912 [2025-03-16 15:00:28,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:28,161 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 879 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 970 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 3324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 970 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:28,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 724 Invalid, 3324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [970 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:00:28,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201912 states. [2025-03-16 15:00:30,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201912 to 198745. [2025-03-16 15:00:30,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198745 states, 198744 states have (on average 1.0656774544137182) internal successors, (211797), 198744 states have internal predecessors, (211797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:30,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198745 states to 198745 states and 211797 transitions. [2025-03-16 15:00:30,439 INFO L78 Accepts]: Start accepts. Automaton has 198745 states and 211797 transitions. Word has length 516 [2025-03-16 15:00:30,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:30,440 INFO L471 AbstractCegarLoop]: Abstraction has 198745 states and 211797 transitions. [2025-03-16 15:00:30,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:30,440 INFO L276 IsEmpty]: Start isEmpty. Operand 198745 states and 211797 transitions. [2025-03-16 15:00:30,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2025-03-16 15:00:30,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:30,459 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:00:30,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:00:30,459 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:30,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:30,460 INFO L85 PathProgramCache]: Analyzing trace with hash 101733085, now seen corresponding path program 1 times [2025-03-16 15:00:30,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:30,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517747166] [2025-03-16 15:00:30,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:30,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:30,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-03-16 15:00:30,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-03-16 15:00:30,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:30,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:31,602 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 356 proven. 110 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-16 15:00:31,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:31,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517747166] [2025-03-16 15:00:31,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517747166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:00:31,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528673701] [2025-03-16 15:00:31,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:31,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:00:31,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:00:31,604 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:00:31,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 15:00:31,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-03-16 15:00:31,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-03-16 15:00:31,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:31,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:31,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:00:31,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:00:31,738 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2025-03-16 15:00:31,738 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:00:31,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528673701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:31,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:00:31,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:00:31,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747700194] [2025-03-16 15:00:31,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:31,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:00:31,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:31,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:00:31,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:00:31,739 INFO L87 Difference]: Start difference. First operand 198745 states and 211797 transitions. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:34,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:34,393 INFO L93 Difference]: Finished difference Result 379379 states and 404839 transitions. [2025-03-16 15:00:34,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:34,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 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 531 [2025-03-16 15:00:34,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:34,606 INFO L225 Difference]: With dead ends: 379379 [2025-03-16 15:00:34,606 INFO L226 Difference]: Without dead ends: 200315 [2025-03-16 15:00:34,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:00:34,690 INFO L435 NwaCegarLoop]: 1643 mSDtfsCounter, 911 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 2346 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 1767 SdHoareTripleChecker+Invalid, 2634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 2346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:34,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 1767 Invalid, 2634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 2346 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 15:00:34,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200315 states.