./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label02.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/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label02.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 82a99c0caa947a7848bb6875be4893ad373e372b2b1f190b4cefbfd2e0a95c5c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:37:12,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:37:12,950 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:37:12,955 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:37:12,955 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:37:12,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:37:12,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:37:12,976 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:37:12,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:37:12,976 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:37:12,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:37:12,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:37:12,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:37:12,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:37:12,977 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:37:12,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:37:12,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:37:12,977 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:37:12,977 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:37:12,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:37:12,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:37:12,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:37:12,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:37:12,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:37:12,978 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:37:12,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:37:12,978 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:37:12,978 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:37:12,978 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:37:12,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:37:12,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:37:12,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:37:12,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:37:12,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:37:12,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:37:12,978 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:37:12,978 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:37:12,978 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:37:12,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:37:12,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:37:12,979 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:37:12,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:37:12,979 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:37:12,979 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 -> 82a99c0caa947a7848bb6875be4893ad373e372b2b1f190b4cefbfd2e0a95c5c [2025-03-16 20:37:13,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:37:13,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:37:13,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:37:13,217 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:37:13,217 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:37:13,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label02.c [2025-03-16 20:37:14,326 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f8856a41/d34c05269d2b46b786cc4aea5d48d4d1/FLAG11582f580 [2025-03-16 20:37:14,692 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:37:14,693 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label02.c [2025-03-16 20:37:14,721 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f8856a41/d34c05269d2b46b786cc4aea5d48d4d1/FLAG11582f580 [2025-03-16 20:37:14,735 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f8856a41/d34c05269d2b46b786cc4aea5d48d4d1 [2025-03-16 20:37:14,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:37:14,738 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:37:14,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:37:14,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:37:14,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:37:14,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:37:14" (1/1) ... [2025-03-16 20:37:14,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@218ff823 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:14, skipping insertion in model container [2025-03-16 20:37:14,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:37:14" (1/1) ... [2025-03-16 20:37:14,808 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:37:15,084 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/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label02.c[26888,26901] [2025-03-16 20:37:15,125 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/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label02.c[34178,34191] [2025-03-16 20:37:15,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:37:15,489 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:37:15,520 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/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label02.c[26888,26901] [2025-03-16 20:37:15,526 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/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label02.c[34178,34191] [2025-03-16 20:37:15,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:37:15,810 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:37:15,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:15 WrapperNode [2025-03-16 20:37:15,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:37:15,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:37:15,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:37:15,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:37:15,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:15" (1/1) ... [2025-03-16 20:37:15,852 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:15" (1/1) ... [2025-03-16 20:37:16,138 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5285 [2025-03-16 20:37:16,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:37:16,141 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:37:16,142 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:37:16,142 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:37:16,159 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:15" (1/1) ... [2025-03-16 20:37:16,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:15" (1/1) ... [2025-03-16 20:37:16,194 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:15" (1/1) ... [2025-03-16 20:37:16,353 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 20:37:16,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:15" (1/1) ... [2025-03-16 20:37:16,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:15" (1/1) ... [2025-03-16 20:37:16,498 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:15" (1/1) ... [2025-03-16 20:37:16,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:15" (1/1) ... [2025-03-16 20:37:16,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:15" (1/1) ... [2025-03-16 20:37:16,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:15" (1/1) ... [2025-03-16 20:37:16,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:37:16,588 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:37:16,588 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:37:16,588 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:37:16,590 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:15" (1/1) ... [2025-03-16 20:37:16,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:37:16,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:37:16,613 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 20:37:16,615 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 20:37:16,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:37:16,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:37:16,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:37:16,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:37:16,737 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:37:16,738 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:37:19,980 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2375: havoc calculate_output_#t~ret49#1; [2025-03-16 20:37:19,981 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3854: havoc calculate_output2_#t~ret50#1; [2025-03-16 20:37:19,982 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5344: havoc calculate_output3_#t~ret51#1; [2025-03-16 20:37:20,145 INFO L? ?]: Removed 755 outVars from TransFormulas that were not future-live. [2025-03-16 20:37:20,146 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:37:20,179 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:37:20,184 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:37:20,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:37:20 BoogieIcfgContainer [2025-03-16 20:37:20,186 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:37:20,188 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:37:20,188 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:37:20,191 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:37:20,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:37:14" (1/3) ... [2025-03-16 20:37:20,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eefe387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:37:20, skipping insertion in model container [2025-03-16 20:37:20,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:15" (2/3) ... [2025-03-16 20:37:20,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eefe387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:37:20, skipping insertion in model container [2025-03-16 20:37:20,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:37:20" (3/3) ... [2025-03-16 20:37:20,195 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label02.c [2025-03-16 20:37:20,206 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:37:20,210 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label02.c that has 1 procedures, 884 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:37:20,268 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:37:20,280 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;@4a2ff3f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:37:20,280 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:37:20,287 INFO L276 IsEmpty]: Start isEmpty. Operand has 884 states, 881 states have (on average 1.9670828603859252) internal successors, (1733), 883 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states 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 20:37:20,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 20:37:20,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:20,294 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] [2025-03-16 20:37:20,294 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:20,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:20,299 INFO L85 PathProgramCache]: Analyzing trace with hash -39585081, now seen corresponding path program 1 times [2025-03-16 20:37:20,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:20,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884058857] [2025-03-16 20:37:20,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:20,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:20,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 20:37:20,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 20:37:20,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:20,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:20,583 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 20:37:20,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:20,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884058857] [2025-03-16 20:37:20,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884058857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:20,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:20,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:37:20,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702261418] [2025-03-16 20:37:20,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:20,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:37:20,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:20,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:37:20,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:37:20,612 INFO L87 Difference]: Start difference. First operand has 884 states, 881 states have (on average 1.9670828603859252) internal successors, (1733), 883 states have internal predecessors, (1733), 0 states have call successors, (0), 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 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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 20:37:20,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:20,697 INFO L93 Difference]: Finished difference Result 1703 states and 3338 transitions. [2025-03-16 20:37:20,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:37:20,699 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-03-16 20:37:20,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:20,713 INFO L225 Difference]: With dead ends: 1703 [2025-03-16 20:37:20,713 INFO L226 Difference]: Without dead ends: 880 [2025-03-16 20:37:20,719 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 20:37:20,722 INFO L435 NwaCegarLoop]: 1668 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, 1668 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 20:37:20,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:20,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-03-16 20:37:20,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2025-03-16 20:37:20,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 878 states have (on average 1.8952164009111618) internal successors, (1664), 879 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states 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 20:37:20,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1664 transitions. [2025-03-16 20:37:20,784 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1664 transitions. Word has length 27 [2025-03-16 20:37:20,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:20,785 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1664 transitions. [2025-03-16 20:37:20,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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 20:37:20,785 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1664 transitions. [2025-03-16 20:37:20,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 20:37:20,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:20,786 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] [2025-03-16 20:37:20,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:37:20,786 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:20,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:20,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1205179400, now seen corresponding path program 1 times [2025-03-16 20:37:20,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:20,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162480975] [2025-03-16 20:37:20,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:20,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:20,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 20:37:20,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 20:37:20,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:20,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:21,008 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 20:37:21,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:21,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162480975] [2025-03-16 20:37:21,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162480975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:21,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:21,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:37:21,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110755085] [2025-03-16 20:37:21,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:21,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:37:21,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:21,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:37:21,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:37:21,011 INFO L87 Difference]: Start difference. First operand 880 states and 1664 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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 20:37:21,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:21,162 INFO L93 Difference]: Finished difference Result 944 states and 1766 transitions. [2025-03-16 20:37:21,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:37:21,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-03-16 20:37:21,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:21,169 INFO L225 Difference]: With dead ends: 944 [2025-03-16 20:37:21,169 INFO L226 Difference]: Without dead ends: 880 [2025-03-16 20:37:21,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:37:21,170 INFO L435 NwaCegarLoop]: 1663 mSDtfsCounter, 0 mSDsluCounter, 3261 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4924 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:21,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4924 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:37:21,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-03-16 20:37:21,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2025-03-16 20:37:21,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 878 states have (on average 1.825740318906606) internal successors, (1603), 879 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states 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 20:37:21,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1603 transitions. [2025-03-16 20:37:21,197 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1603 transitions. Word has length 27 [2025-03-16 20:37:21,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:21,198 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1603 transitions. [2025-03-16 20:37:21,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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 20:37:21,198 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1603 transitions. [2025-03-16 20:37:21,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 20:37:21,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:21,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:21,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:37:21,201 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:21,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:21,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1658686106, now seen corresponding path program 1 times [2025-03-16 20:37:21,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:21,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029959474] [2025-03-16 20:37:21,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:21,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:21,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 20:37:21,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 20:37:21,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:21,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:21,420 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 20:37:21,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:21,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029959474] [2025-03-16 20:37:21,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029959474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:21,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:21,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:21,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343558609] [2025-03-16 20:37:21,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:21,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:37:21,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:21,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:37:21,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:37:21,422 INFO L87 Difference]: Start difference. First operand 880 states and 1603 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:25,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:25,891 INFO L93 Difference]: Finished difference Result 3135 states and 5912 transitions. [2025-03-16 20:37:25,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:37:25,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-16 20:37:25,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:25,902 INFO L225 Difference]: With dead ends: 3135 [2025-03-16 20:37:25,903 INFO L226 Difference]: Without dead ends: 2382 [2025-03-16 20:37:25,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:37:25,907 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 2522 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5154 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2522 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 6399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 5154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:25,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2522 Valid, 875 Invalid, 6399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 5154 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-16 20:37:25,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2382 states. [2025-03-16 20:37:25,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2382 to 2382. [2025-03-16 20:37:25,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2382 states, 2380 states have (on average 1.503781512605042) internal successors, (3579), 2381 states have internal predecessors, (3579), 0 states have call successors, (0), 0 states 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 20:37:25,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 3579 transitions. [2025-03-16 20:37:25,972 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 3579 transitions. Word has length 62 [2025-03-16 20:37:25,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:25,973 INFO L471 AbstractCegarLoop]: Abstraction has 2382 states and 3579 transitions. [2025-03-16 20:37:25,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:25,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 3579 transitions. [2025-03-16 20:37:25,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 20:37:25,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:25,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:25,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:37:25,977 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:25,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:25,978 INFO L85 PathProgramCache]: Analyzing trace with hash 113676108, now seen corresponding path program 1 times [2025-03-16 20:37:25,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:25,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596499688] [2025-03-16 20:37:25,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:25,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:25,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 20:37:26,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 20:37:26,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:26,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:26,298 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 20:37:26,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:26,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596499688] [2025-03-16 20:37:26,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596499688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:26,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:26,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 20:37:26,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384370633] [2025-03-16 20:37:26,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:26,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:37:26,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:26,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:37:26,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:37:26,301 INFO L87 Difference]: Start difference. First operand 2382 states and 3579 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 20:37:26,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:26,725 INFO L93 Difference]: Finished difference Result 3358 states and 5163 transitions. [2025-03-16 20:37:26,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 20:37:26,725 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-16 20:37:26,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:26,736 INFO L225 Difference]: With dead ends: 3358 [2025-03-16 20:37:26,736 INFO L226 Difference]: Without dead ends: 3297 [2025-03-16 20:37:26,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2025-03-16 20:37:26,738 INFO L435 NwaCegarLoop]: 1597 mSDtfsCounter, 13460 mSDsluCounter, 4332 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13460 SdHoareTripleChecker+Valid, 5929 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:26,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13460 Valid, 5929 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:37:26,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3297 states. [2025-03-16 20:37:26,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3297 to 2441. [2025-03-16 20:37:26,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2441 states, 2439 states have (on average 1.5067650676506765) internal successors, (3675), 2440 states have internal predecessors, (3675), 0 states have call successors, (0), 0 states 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 20:37:26,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 3675 transitions. [2025-03-16 20:37:26,788 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 3675 transitions. Word has length 87 [2025-03-16 20:37:26,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:26,789 INFO L471 AbstractCegarLoop]: Abstraction has 2441 states and 3675 transitions. [2025-03-16 20:37:26,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 20:37:26,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 3675 transitions. [2025-03-16 20:37:26,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 20:37:26,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:26,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:26,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:37:26,792 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:26,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:26,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1905739598, now seen corresponding path program 1 times [2025-03-16 20:37:26,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:26,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615436401] [2025-03-16 20:37:26,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:26,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:26,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 20:37:26,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 20:37:26,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:26,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:27,292 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 20:37:27,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:27,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615436401] [2025-03-16 20:37:27,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615436401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:27,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:27,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 20:37:27,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858275185] [2025-03-16 20:37:27,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:27,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:37:27,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:27,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:37:27,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:37:27,294 INFO L87 Difference]: Start difference. First operand 2441 states and 3675 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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 20:37:27,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:27,630 INFO L93 Difference]: Finished difference Result 2563 states and 3871 transitions. [2025-03-16 20:37:27,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 20:37:27,631 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-16 20:37:27,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:27,637 INFO L225 Difference]: With dead ends: 2563 [2025-03-16 20:37:27,638 INFO L226 Difference]: Without dead ends: 2443 [2025-03-16 20:37:27,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-03-16 20:37:27,639 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 10633 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10633 SdHoareTripleChecker+Valid, 2268 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:27,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10633 Valid, 2268 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:37:27,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2443 states. [2025-03-16 20:37:27,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2443 to 2441. [2025-03-16 20:37:27,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2441 states, 2439 states have (on average 1.5063550635506355) internal successors, (3674), 2440 states have internal predecessors, (3674), 0 states have call successors, (0), 0 states 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 20:37:27,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 3674 transitions. [2025-03-16 20:37:27,676 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 3674 transitions. Word has length 89 [2025-03-16 20:37:27,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:27,676 INFO L471 AbstractCegarLoop]: Abstraction has 2441 states and 3674 transitions. [2025-03-16 20:37:27,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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 20:37:27,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 3674 transitions. [2025-03-16 20:37:27,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 20:37:27,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:27,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:27,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:37:27,677 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:27,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:27,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1904696913, now seen corresponding path program 1 times [2025-03-16 20:37:27,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:27,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139921854] [2025-03-16 20:37:27,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:27,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:27,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 20:37:27,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 20:37:27,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:27,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:27,790 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 20:37:27,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:27,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139921854] [2025-03-16 20:37:27,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139921854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:27,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:27,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:27,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905740893] [2025-03-16 20:37:27,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:27,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:27,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:27,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:27,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:27,793 INFO L87 Difference]: Start difference. First operand 2441 states and 3674 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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 20:37:27,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:27,822 INFO L93 Difference]: Finished difference Result 2670 states and 4043 transitions. [2025-03-16 20:37:27,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:27,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-16 20:37:27,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:27,828 INFO L225 Difference]: With dead ends: 2670 [2025-03-16 20:37:27,829 INFO L226 Difference]: Without dead ends: 2550 [2025-03-16 20:37:27,829 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 20:37:27,830 INFO L435 NwaCegarLoop]: 1599 mSDtfsCounter, 1506 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1691 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:27,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1691 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:27,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2025-03-16 20:37:27,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2546. [2025-03-16 20:37:27,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 2544 states have (on average 1.5098270440251573) internal successors, (3841), 2545 states have internal predecessors, (3841), 0 states have call successors, (0), 0 states 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 20:37:27,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3841 transitions. [2025-03-16 20:37:27,861 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 3841 transitions. Word has length 89 [2025-03-16 20:37:27,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:27,862 INFO L471 AbstractCegarLoop]: Abstraction has 2546 states and 3841 transitions. [2025-03-16 20:37:27,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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 20:37:27,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 3841 transitions. [2025-03-16 20:37:27,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 20:37:27,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:27,863 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:27,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:37:27,863 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:27,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:27,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1050629546, now seen corresponding path program 1 times [2025-03-16 20:37:27,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:27,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050752939] [2025-03-16 20:37:27,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:27,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:27,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 20:37:27,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 20:37:27,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:27,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:28,113 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 20:37:28,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:28,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050752939] [2025-03-16 20:37:28,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050752939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:28,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:28,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:37:28,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437510511] [2025-03-16 20:37:28,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:28,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:37:28,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:28,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:37:28,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:37:28,115 INFO L87 Difference]: Start difference. First operand 2546 states and 3841 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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 20:37:28,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:28,153 INFO L93 Difference]: Finished difference Result 2552 states and 3848 transitions. [2025-03-16 20:37:28,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:37:28,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-03-16 20:37:28,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:28,159 INFO L225 Difference]: With dead ends: 2552 [2025-03-16 20:37:28,159 INFO L226 Difference]: Without dead ends: 2550 [2025-03-16 20:37:28,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:37:28,162 INFO L435 NwaCegarLoop]: 1599 mSDtfsCounter, 0 mSDsluCounter, 6385 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7984 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:28,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7984 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:28,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2025-03-16 20:37:28,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2550. [2025-03-16 20:37:28,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2550 states, 2548 states have (on average 1.5086342229199372) internal successors, (3844), 2549 states have internal predecessors, (3844), 0 states have call successors, (0), 0 states 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 20:37:28,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 3844 transitions. [2025-03-16 20:37:28,193 INFO L78 Accepts]: Start accepts. Automaton has 2550 states and 3844 transitions. Word has length 90 [2025-03-16 20:37:28,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:28,193 INFO L471 AbstractCegarLoop]: Abstraction has 2550 states and 3844 transitions. [2025-03-16 20:37:28,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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 20:37:28,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 3844 transitions. [2025-03-16 20:37:28,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:28,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:28,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:28,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:37:28,195 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:28,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:28,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1274985008, now seen corresponding path program 1 times [2025-03-16 20:37:28,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:28,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290011296] [2025-03-16 20:37:28,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:28,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:28,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:28,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:28,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:28,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:28,263 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 20:37:28,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:28,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290011296] [2025-03-16 20:37:28,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290011296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:28,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:28,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:28,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47778844] [2025-03-16 20:37:28,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:28,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:28,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:28,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:28,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:28,265 INFO L87 Difference]: Start difference. First operand 2550 states and 3844 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 20:37:28,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:28,289 INFO L93 Difference]: Finished difference Result 2992 states and 4544 transitions. [2025-03-16 20:37:28,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:28,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-16 20:37:28,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:28,298 INFO L225 Difference]: With dead ends: 2992 [2025-03-16 20:37:28,298 INFO L226 Difference]: Without dead ends: 2763 [2025-03-16 20:37:28,300 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 20:37:28,301 INFO L435 NwaCegarLoop]: 1679 mSDtfsCounter, 1525 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:28,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 1783 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:28,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2025-03-16 20:37:28,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2761. [2025-03-16 20:37:28,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2759 states have (on average 1.513229430953244) internal successors, (4175), 2760 states have internal predecessors, (4175), 0 states have call successors, (0), 0 states 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 20:37:28,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 4175 transitions. [2025-03-16 20:37:28,344 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 4175 transitions. Word has length 91 [2025-03-16 20:37:28,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:28,345 INFO L471 AbstractCegarLoop]: Abstraction has 2761 states and 4175 transitions. [2025-03-16 20:37:28,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 20:37:28,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 4175 transitions. [2025-03-16 20:37:28,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:28,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:28,347 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:28,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:37:28,347 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:28,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:28,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1254499024, now seen corresponding path program 1 times [2025-03-16 20:37:28,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:28,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336948839] [2025-03-16 20:37:28,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:28,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:28,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:28,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:28,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:28,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:28,453 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 20:37:28,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:28,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336948839] [2025-03-16 20:37:28,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336948839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:28,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:28,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:28,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939741624] [2025-03-16 20:37:28,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:28,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:28,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:28,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:28,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:28,455 INFO L87 Difference]: Start difference. First operand 2761 states and 4175 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 20:37:28,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:28,529 INFO L93 Difference]: Finished difference Result 3609 states and 5509 transitions. [2025-03-16 20:37:28,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:28,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-16 20:37:28,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:28,539 INFO L225 Difference]: With dead ends: 3609 [2025-03-16 20:37:28,539 INFO L226 Difference]: Without dead ends: 3169 [2025-03-16 20:37:28,541 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 20:37:28,541 INFO L435 NwaCegarLoop]: 1677 mSDtfsCounter, 1523 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:28,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1785 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:28,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3169 states. [2025-03-16 20:37:28,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3169 to 3167. [2025-03-16 20:37:28,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3167 states, 3165 states have (on average 1.518167456556082) internal successors, (4805), 3166 states have internal predecessors, (4805), 0 states have call successors, (0), 0 states 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 20:37:28,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3167 states to 3167 states and 4805 transitions. [2025-03-16 20:37:28,666 INFO L78 Accepts]: Start accepts. Automaton has 3167 states and 4805 transitions. Word has length 91 [2025-03-16 20:37:28,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:28,666 INFO L471 AbstractCegarLoop]: Abstraction has 3167 states and 4805 transitions. [2025-03-16 20:37:28,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 20:37:28,666 INFO L276 IsEmpty]: Start isEmpty. Operand 3167 states and 4805 transitions. [2025-03-16 20:37:28,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:28,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:28,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:28,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:37:28,667 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:28,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:28,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1759625264, now seen corresponding path program 1 times [2025-03-16 20:37:28,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:28,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925153284] [2025-03-16 20:37:28,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:28,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:28,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:28,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:28,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:28,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:28,738 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 20:37:28,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:28,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925153284] [2025-03-16 20:37:28,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925153284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:28,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:28,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:28,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022243217] [2025-03-16 20:37:28,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:28,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:28,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:28,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:28,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:28,740 INFO L87 Difference]: Start difference. First operand 3167 states and 4805 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 20:37:28,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:28,782 INFO L93 Difference]: Finished difference Result 4795 states and 7343 transitions. [2025-03-16 20:37:28,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:28,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-16 20:37:28,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:28,801 INFO L225 Difference]: With dead ends: 4795 [2025-03-16 20:37:28,802 INFO L226 Difference]: Without dead ends: 3949 [2025-03-16 20:37:28,805 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 20:37:28,807 INFO L435 NwaCegarLoop]: 1675 mSDtfsCounter, 1521 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:28,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 1787 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:28,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3949 states. [2025-03-16 20:37:28,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3949 to 3947. [2025-03-16 20:37:28,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3947 states, 3945 states have (on average 1.5211660329531052) internal successors, (6001), 3946 states have internal predecessors, (6001), 0 states have call successors, (0), 0 states 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 20:37:28,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3947 states to 3947 states and 6001 transitions. [2025-03-16 20:37:28,883 INFO L78 Accepts]: Start accepts. Automaton has 3947 states and 6001 transitions. Word has length 91 [2025-03-16 20:37:28,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:28,883 INFO L471 AbstractCegarLoop]: Abstraction has 3947 states and 6001 transitions. [2025-03-16 20:37:28,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 20:37:28,883 INFO L276 IsEmpty]: Start isEmpty. Operand 3947 states and 6001 transitions. [2025-03-16 20:37:28,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:28,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:28,884 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:28,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:37:28,884 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:28,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:28,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1691983056, now seen corresponding path program 1 times [2025-03-16 20:37:28,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:28,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504859221] [2025-03-16 20:37:28,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:28,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:28,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:28,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:28,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:28,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:28,948 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 20:37:28,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:28,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504859221] [2025-03-16 20:37:28,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504859221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:28,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:28,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:28,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712430310] [2025-03-16 20:37:28,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:28,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:28,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:28,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:28,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:28,950 INFO L87 Difference]: Start difference. First operand 3947 states and 6001 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 20:37:29,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:29,000 INFO L93 Difference]: Finished difference Result 7071 states and 10819 transitions. [2025-03-16 20:37:29,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:29,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-16 20:37:29,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:29,011 INFO L225 Difference]: With dead ends: 7071 [2025-03-16 20:37:29,011 INFO L226 Difference]: Without dead ends: 5445 [2025-03-16 20:37:29,015 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 20:37:29,015 INFO L435 NwaCegarLoop]: 1673 mSDtfsCounter, 1519 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:29,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 1789 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:29,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5445 states. [2025-03-16 20:37:29,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5445 to 5443. [2025-03-16 20:37:29,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5443 states, 5441 states have (on average 1.5190222385590884) internal successors, (8265), 5442 states have internal predecessors, (8265), 0 states have call successors, (0), 0 states 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 20:37:29,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5443 states to 5443 states and 8265 transitions. [2025-03-16 20:37:29,185 INFO L78 Accepts]: Start accepts. Automaton has 5443 states and 8265 transitions. Word has length 91 [2025-03-16 20:37:29,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:29,186 INFO L471 AbstractCegarLoop]: Abstraction has 5443 states and 8265 transitions. [2025-03-16 20:37:29,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 20:37:29,186 INFO L276 IsEmpty]: Start isEmpty. Operand 5443 states and 8265 transitions. [2025-03-16 20:37:29,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:29,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:29,187 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:29,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:37:29,188 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:29,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:29,188 INFO L85 PathProgramCache]: Analyzing trace with hash -934942416, now seen corresponding path program 1 times [2025-03-16 20:37:29,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:29,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838167141] [2025-03-16 20:37:29,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:29,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:29,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:29,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:29,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:29,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:29,255 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 20:37:29,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:29,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838167141] [2025-03-16 20:37:29,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838167141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:29,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:29,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:29,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040653145] [2025-03-16 20:37:29,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:29,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:29,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:29,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:29,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:29,257 INFO L87 Difference]: Start difference. First operand 5443 states and 8265 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 20:37:29,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:29,339 INFO L93 Difference]: Finished difference Result 11431 states and 17387 transitions. [2025-03-16 20:37:29,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:29,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-16 20:37:29,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:29,354 INFO L225 Difference]: With dead ends: 11431 [2025-03-16 20:37:29,354 INFO L226 Difference]: Without dead ends: 8309 [2025-03-16 20:37:29,360 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 20:37:29,360 INFO L435 NwaCegarLoop]: 1661 mSDtfsCounter, 1515 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:29,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1785 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:29,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8309 states. [2025-03-16 20:37:29,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8309 to 8307. [2025-03-16 20:37:29,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8307 states, 8305 states have (on average 1.5095725466586394) internal successors, (12537), 8306 states have internal predecessors, (12537), 0 states have call successors, (0), 0 states 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 20:37:29,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8307 states to 8307 states and 12537 transitions. [2025-03-16 20:37:29,569 INFO L78 Accepts]: Start accepts. Automaton has 8307 states and 12537 transitions. Word has length 91 [2025-03-16 20:37:29,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:29,569 INFO L471 AbstractCegarLoop]: Abstraction has 8307 states and 12537 transitions. [2025-03-16 20:37:29,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 20:37:29,569 INFO L276 IsEmpty]: Start isEmpty. Operand 8307 states and 12537 transitions. [2025-03-16 20:37:29,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:29,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:29,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:29,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:37:29,571 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:29,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:29,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1484731344, now seen corresponding path program 1 times [2025-03-16 20:37:29,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:29,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749625613] [2025-03-16 20:37:29,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:29,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:29,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:29,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:29,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:29,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:29,630 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 20:37:29,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:29,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749625613] [2025-03-16 20:37:29,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749625613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:29,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:29,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:29,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718527657] [2025-03-16 20:37:29,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:29,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:29,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:29,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:29,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:29,631 INFO L87 Difference]: Start difference. First operand 8307 states and 12537 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 20:37:29,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:29,765 INFO L93 Difference]: Finished difference Result 19767 states and 29755 transitions. [2025-03-16 20:37:29,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:29,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-16 20:37:29,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:29,792 INFO L225 Difference]: With dead ends: 19767 [2025-03-16 20:37:29,792 INFO L226 Difference]: Without dead ends: 13781 [2025-03-16 20:37:29,802 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 20:37:29,803 INFO L435 NwaCegarLoop]: 1659 mSDtfsCounter, 1513 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:29,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 1787 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:29,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13781 states. [2025-03-16 20:37:30,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13781 to 13779. [2025-03-16 20:37:30,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13779 states, 13777 states have (on average 1.492995572330696) internal successors, (20569), 13778 states have internal predecessors, (20569), 0 states have call successors, (0), 0 states 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 20:37:30,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13779 states to 13779 states and 20569 transitions. [2025-03-16 20:37:30,203 INFO L78 Accepts]: Start accepts. Automaton has 13779 states and 20569 transitions. Word has length 91 [2025-03-16 20:37:30,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:30,203 INFO L471 AbstractCegarLoop]: Abstraction has 13779 states and 20569 transitions. [2025-03-16 20:37:30,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 20:37:30,203 INFO L276 IsEmpty]: Start isEmpty. Operand 13779 states and 20569 transitions. [2025-03-16 20:37:30,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:30,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:30,204 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:30,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:37:30,204 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:30,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:30,205 INFO L85 PathProgramCache]: Analyzing trace with hash -868760016, now seen corresponding path program 1 times [2025-03-16 20:37:30,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:30,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793488705] [2025-03-16 20:37:30,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:30,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:30,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:30,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:30,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:30,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:30,301 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 20:37:30,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:30,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793488705] [2025-03-16 20:37:30,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793488705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:30,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:30,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:30,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132608663] [2025-03-16 20:37:30,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:30,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:30,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:30,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:30,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:30,303 INFO L87 Difference]: Start difference. First operand 13779 states and 20569 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 20:37:30,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:30,591 INFO L93 Difference]: Finished difference Result 35671 states and 52955 transitions. [2025-03-16 20:37:30,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:30,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-16 20:37:30,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:30,633 INFO L225 Difference]: With dead ends: 35671 [2025-03-16 20:37:30,634 INFO L226 Difference]: Without dead ends: 24213 [2025-03-16 20:37:30,650 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 20:37:30,650 INFO L435 NwaCegarLoop]: 1671 mSDtfsCounter, 1517 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:30,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1791 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:30,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24213 states. [2025-03-16 20:37:31,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24213 to 24211. [2025-03-16 20:37:31,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24211 states, 24209 states have (on average 1.4708992523441695) internal successors, (35609), 24210 states have internal predecessors, (35609), 0 states have call successors, (0), 0 states 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 20:37:31,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24211 states to 24211 states and 35609 transitions. [2025-03-16 20:37:31,413 INFO L78 Accepts]: Start accepts. Automaton has 24211 states and 35609 transitions. Word has length 91 [2025-03-16 20:37:31,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:31,413 INFO L471 AbstractCegarLoop]: Abstraction has 24211 states and 35609 transitions. [2025-03-16 20:37:31,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 20:37:31,413 INFO L276 IsEmpty]: Start isEmpty. Operand 24211 states and 35609 transitions. [2025-03-16 20:37:31,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 20:37:31,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:31,414 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:31,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:37:31,414 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:31,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:31,415 INFO L85 PathProgramCache]: Analyzing trace with hash -164853808, now seen corresponding path program 1 times [2025-03-16 20:37:31,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:31,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374796953] [2025-03-16 20:37:31,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:31,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:31,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 20:37:31,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 20:37:31,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:31,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:31,476 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 20:37:31,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:31,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374796953] [2025-03-16 20:37:31,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374796953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:31,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:31,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:31,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887531125] [2025-03-16 20:37:31,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:31,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:31,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:31,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:31,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:31,478 INFO L87 Difference]: Start difference. First operand 24211 states and 35609 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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 20:37:31,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:31,906 INFO L93 Difference]: Finished difference Result 46746 states and 69151 transitions. [2025-03-16 20:37:31,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:31,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-03-16 20:37:31,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:31,963 INFO L225 Difference]: With dead ends: 46746 [2025-03-16 20:37:31,963 INFO L226 Difference]: Without dead ends: 34711 [2025-03-16 20:37:31,974 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 20:37:31,975 INFO L435 NwaCegarLoop]: 1684 mSDtfsCounter, 1524 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1784 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:31,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 1784 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:31,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34711 states. [2025-03-16 20:37:32,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34711 to 34709. [2025-03-16 20:37:32,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34709 states, 34707 states have (on average 1.4649206212003343) internal successors, (50843), 34708 states have internal predecessors, (50843), 0 states have call successors, (0), 0 states 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 20:37:32,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34709 states to 34709 states and 50843 transitions. [2025-03-16 20:37:32,668 INFO L78 Accepts]: Start accepts. Automaton has 34709 states and 50843 transitions. Word has length 93 [2025-03-16 20:37:32,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:32,673 INFO L471 AbstractCegarLoop]: Abstraction has 34709 states and 50843 transitions. [2025-03-16 20:37:32,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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 20:37:32,673 INFO L276 IsEmpty]: Start isEmpty. Operand 34709 states and 50843 transitions. [2025-03-16 20:37:32,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 20:37:32,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:32,683 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:32,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:37:32,683 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:32,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:32,687 INFO L85 PathProgramCache]: Analyzing trace with hash -675466654, now seen corresponding path program 1 times [2025-03-16 20:37:32,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:32,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752771148] [2025-03-16 20:37:32,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:32,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:32,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:37:32,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:37:32,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:32,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:33,054 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:37:33,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:33,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752771148] [2025-03-16 20:37:33,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752771148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:33,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:33,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 20:37:33,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043905520] [2025-03-16 20:37:33,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:33,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:37:33,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:33,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:37:33,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:37:33,057 INFO L87 Difference]: Start difference. First operand 34709 states and 50843 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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 20:37:36,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:36,342 INFO L93 Difference]: Finished difference Result 300199 states and 438820 transitions. [2025-03-16 20:37:36,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 20:37:36,343 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 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 115 [2025-03-16 20:37:36,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:37,020 INFO L225 Difference]: With dead ends: 300199 [2025-03-16 20:37:37,020 INFO L226 Difference]: Without dead ends: 267813 [2025-03-16 20:37:37,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-16 20:37:37,074 INFO L435 NwaCegarLoop]: 1705 mSDtfsCounter, 11723 mSDsluCounter, 3496 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11723 SdHoareTripleChecker+Valid, 5201 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:37,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11723 Valid, 5201 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:37:37,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267813 states. [2025-03-16 20:37:39,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267813 to 67093. [2025-03-16 20:37:39,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67093 states, 67091 states have (on average 1.4580047994514913) internal successors, (97819), 67092 states have internal predecessors, (97819), 0 states have call successors, (0), 0 states 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 20:37:39,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67093 states to 67093 states and 97819 transitions. [2025-03-16 20:37:39,669 INFO L78 Accepts]: Start accepts. Automaton has 67093 states and 97819 transitions. Word has length 115 [2025-03-16 20:37:39,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:39,670 INFO L471 AbstractCegarLoop]: Abstraction has 67093 states and 97819 transitions. [2025-03-16 20:37:39,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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 20:37:39,671 INFO L276 IsEmpty]: Start isEmpty. Operand 67093 states and 97819 transitions. [2025-03-16 20:37:39,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 20:37:39,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:39,677 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:39,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:37:39,677 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:39,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:39,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1090016610, now seen corresponding path program 1 times [2025-03-16 20:37:39,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:39,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718909272] [2025-03-16 20:37:39,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:39,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:39,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:37:39,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:37:39,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:39,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:39,894 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:37:39,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:39,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718909272] [2025-03-16 20:37:39,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718909272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:39,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:39,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 20:37:39,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117007274] [2025-03-16 20:37:39,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:39,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:37:39,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:39,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:37:39,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:37:39,896 INFO L87 Difference]: Start difference. First operand 67093 states and 97819 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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 20:37:45,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:45,237 INFO L93 Difference]: Finished difference Result 332583 states and 485796 transitions. [2025-03-16 20:37:45,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 20:37:45,238 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 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 115 [2025-03-16 20:37:45,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:45,710 INFO L225 Difference]: With dead ends: 332583 [2025-03-16 20:37:45,710 INFO L226 Difference]: Without dead ends: 300197 [2025-03-16 20:37:45,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-16 20:37:45,773 INFO L435 NwaCegarLoop]: 1702 mSDtfsCounter, 11751 mSDsluCounter, 3298 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11751 SdHoareTripleChecker+Valid, 5000 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:45,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11751 Valid, 5000 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:37:45,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300197 states. [2025-03-16 20:37:50,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300197 to 115733. [2025-03-16 20:37:50,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115733 states, 115731 states have (on average 1.4513224632985111) internal successors, (167963), 115732 states have internal predecessors, (167963), 0 states have call successors, (0), 0 states 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 20:37:50,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115733 states to 115733 states and 167963 transitions. [2025-03-16 20:37:50,680 INFO L78 Accepts]: Start accepts. Automaton has 115733 states and 167963 transitions. Word has length 115 [2025-03-16 20:37:50,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:50,681 INFO L471 AbstractCegarLoop]: Abstraction has 115733 states and 167963 transitions. [2025-03-16 20:37:50,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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 20:37:50,681 INFO L276 IsEmpty]: Start isEmpty. Operand 115733 states and 167963 transitions. [2025-03-16 20:37:50,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 20:37:50,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:50,688 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:50,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:37:50,688 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:50,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:50,688 INFO L85 PathProgramCache]: Analyzing trace with hash -190826398, now seen corresponding path program 1 times [2025-03-16 20:37:50,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:50,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41742075] [2025-03-16 20:37:50,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:50,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:50,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:37:50,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:37:50,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:50,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 20:37:50,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:50,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41742075] [2025-03-16 20:37:50,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41742075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:50,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:50,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 20:37:50,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331146513] [2025-03-16 20:37:50,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:50,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:37:50,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:50,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:37:50,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:37:50,904 INFO L87 Difference]: Start difference. First operand 115733 states and 167963 transitions. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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 20:37:57,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:57,651 INFO L93 Difference]: Finished difference Result 364967 states and 532772 transitions. [2025-03-16 20:37:57,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 20:37:57,652 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 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 115 [2025-03-16 20:37:57,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:58,208 INFO L225 Difference]: With dead ends: 364967 [2025-03-16 20:37:58,208 INFO L226 Difference]: Without dead ends: 332581 [2025-03-16 20:37:58,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-16 20:37:58,485 INFO L435 NwaCegarLoop]: 1699 mSDtfsCounter, 11787 mSDsluCounter, 3234 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11787 SdHoareTripleChecker+Valid, 4933 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:58,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11787 Valid, 4933 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:37:58,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332581 states.