./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label09.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2ad2a2d7efc66be7018560448e0fdde06e9f20074a5c17d4202d9a0c4a0be5de --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:12:14,481 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:12:14,528 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:12:14,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:12:14,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:12:14,555 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:12:14,556 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:12:14,556 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:12:14,557 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:12:14,557 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:12:14,557 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:12:14,557 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:12:14,558 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:12:14,558 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:12:14,558 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:12:14,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:12:14,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:12:14,558 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:12:14,558 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:12:14,559 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:12:14,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:12:14,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:12:14,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:12:14,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:12:14,559 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:12:14,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:12:14,559 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:12:14,559 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:12:14,559 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:12:14,559 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:12:14,559 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:12:14,559 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:12:14,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:12:14,560 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:12:14,560 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:12:14,560 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:12:14,560 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:12:14,560 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:12:14,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:12:14,561 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:12:14,561 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:12:14,561 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:12:14,561 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:12:14,561 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 -> 2ad2a2d7efc66be7018560448e0fdde06e9f20074a5c17d4202d9a0c4a0be5de [2025-03-03 16:12:14,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:12:14,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:12:14,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:12:14,777 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:12:14,777 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:12:14,778 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label09.c [2025-03-03 16:12:15,911 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/621893d6d/d991d947c6b34ea7a332bc8b933c3978/FLAGbb4ed3f2a [2025-03-03 16:12:16,274 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:12:16,275 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label09.c [2025-03-03 16:12:16,301 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/621893d6d/d991d947c6b34ea7a332bc8b933c3978/FLAGbb4ed3f2a [2025-03-03 16:12:16,467 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/621893d6d/d991d947c6b34ea7a332bc8b933c3978 [2025-03-03 16:12:16,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:12:16,471 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:12:16,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:12:16,472 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:12:16,474 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:12:16,475 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:12:16" (1/1) ... [2025-03-03 16:12:16,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4ae29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:16, skipping insertion in model container [2025-03-03 16:12:16,475 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:12:16" (1/1) ... [2025-03-03 16:12:16,549 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:12:16,882 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.6.1.ufo.UNBOUNDED.pals+Problem12_label09.c[15547,15560] [2025-03-03 16:12:16,935 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.6.1.ufo.UNBOUNDED.pals+Problem12_label09.c[23295,23308] [2025-03-03 16:12:17,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:12:17,325 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:12:17,361 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.6.1.ufo.UNBOUNDED.pals+Problem12_label09.c[15547,15560] [2025-03-03 16:12:17,372 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.6.1.ufo.UNBOUNDED.pals+Problem12_label09.c[23295,23308] [2025-03-03 16:12:17,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:12:17,608 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:12:17,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:17 WrapperNode [2025-03-03 16:12:17,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:12:17,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:12:17,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:12:17,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:12:17,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:17" (1/1) ... [2025-03-03 16:12:17,651 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:17" (1/1) ... [2025-03-03 16:12:17,895 INFO L138 Inliner]: procedures = 38, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5152 [2025-03-03 16:12:17,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:12:17,896 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:12:17,896 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:12:17,896 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:12:17,903 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:17" (1/1) ... [2025-03-03 16:12:17,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:17" (1/1) ... [2025-03-03 16:12:17,943 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:17" (1/1) ... [2025-03-03 16:12:18,052 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:12:18,052 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:17" (1/1) ... [2025-03-03 16:12:18,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:17" (1/1) ... [2025-03-03 16:12:18,129 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:17" (1/1) ... [2025-03-03 16:12:18,140 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:17" (1/1) ... [2025-03-03 16:12:18,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:17" (1/1) ... [2025-03-03 16:12:18,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:17" (1/1) ... [2025-03-03 16:12:18,247 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:12:18,248 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:12:18,249 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:12:18,249 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:12:18,250 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:17" (1/1) ... [2025-03-03 16:12:18,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:12:18,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:12:18,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:12:18,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:12:18,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:12:18,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:12:18,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:12:18,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:12:18,361 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:12:18,363 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:12:21,536 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3687: havoc calculate_output2_#t~ret42#1; [2025-03-03 16:12:21,537 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5177: havoc calculate_output3_#t~ret43#1; [2025-03-03 16:12:21,537 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2208: havoc calculate_output_#t~ret41#1; [2025-03-03 16:12:21,639 INFO L? ?]: Removed 749 outVars from TransFormulas that were not future-live. [2025-03-03 16:12:21,639 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:12:21,670 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:12:21,670 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:12:21,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:12:21 BoogieIcfgContainer [2025-03-03 16:12:21,671 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:12:21,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:12:21,673 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:12:21,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:12:21,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:12:16" (1/3) ... [2025-03-03 16:12:21,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3463f60a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:12:21, skipping insertion in model container [2025-03-03 16:12:21,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:17" (2/3) ... [2025-03-03 16:12:21,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3463f60a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:12:21, skipping insertion in model container [2025-03-03 16:12:21,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:12:21" (3/3) ... [2025-03-03 16:12:21,677 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label09.c [2025-03-03 16:12:21,687 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:12:21,691 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label09.c that has 1 procedures, 915 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-03 16:12:21,756 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:12:21,763 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;@7e06b74b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:12:21,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:12:21,768 INFO L276 IsEmpty]: Start isEmpty. Operand has 915 states, 912 states have (on average 1.9024122807017543) internal successors, (1735), 914 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:21,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 16:12:21,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:21,776 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] [2025-03-03 16:12:21,776 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:21,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:21,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1738102833, now seen corresponding path program 1 times [2025-03-03 16:12:21,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:21,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101151667] [2025-03-03 16:12:21,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:21,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:21,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 16:12:21,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 16:12:21,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:21,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:21,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:21,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:21,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101151667] [2025-03-03 16:12:21,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101151667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:21,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:21,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:12:21,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402814327] [2025-03-03 16:12:21,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:21,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 16:12:21,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:22,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 16:12:22,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 16:12:22,013 INFO L87 Difference]: Start difference. First operand has 915 states, 912 states have (on average 1.9024122807017543) internal successors, (1735), 914 states have internal predecessors, (1735), 0 states have call successors, (0), 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.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:22,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:22,079 INFO L93 Difference]: Finished difference Result 1783 states and 3381 transitions. [2025-03-03 16:12:22,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 16:12:22,080 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-03-03 16:12:22,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:22,097 INFO L225 Difference]: With dead ends: 1783 [2025-03-03 16:12:22,097 INFO L226 Difference]: Without dead ends: 850 [2025-03-03 16:12:22,104 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-03 16:12:22,106 INFO L435 NwaCegarLoop]: 1669 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, 1669 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-03 16:12:22,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1669 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:12:22,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2025-03-03 16:12:22,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2025-03-03 16:12:22,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 848 states have (on average 1.892688679245283) internal successors, (1605), 849 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:22,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1605 transitions. [2025-03-03 16:12:22,181 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1605 transitions. Word has length 26 [2025-03-03 16:12:22,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:22,182 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1605 transitions. [2025-03-03 16:12:22,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:22,183 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1605 transitions. [2025-03-03 16:12:22,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 16:12:22,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:22,185 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] [2025-03-03 16:12:22,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:12:22,186 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:22,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:22,186 INFO L85 PathProgramCache]: Analyzing trace with hash -2146927058, now seen corresponding path program 1 times [2025-03-03 16:12:22,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:22,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153156607] [2025-03-03 16:12:22,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:22,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:22,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 16:12:22,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 16:12:22,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:22,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:22,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:22,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:22,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153156607] [2025-03-03 16:12:22,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153156607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:22,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:22,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:12:22,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847961370] [2025-03-03 16:12:22,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:22,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:12:22,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:22,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:12:22,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:12:22,444 INFO L87 Difference]: Start difference. First operand 850 states and 1605 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:22,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:22,541 INFO L93 Difference]: Finished difference Result 904 states and 1689 transitions. [2025-03-03 16:12:22,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:12:22,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-03-03 16:12:22,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:22,545 INFO L225 Difference]: With dead ends: 904 [2025-03-03 16:12:22,546 INFO L226 Difference]: Without dead ends: 850 [2025-03-03 16:12:22,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:12:22,547 INFO L435 NwaCegarLoop]: 1603 mSDtfsCounter, 0 mSDsluCounter, 4764 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6367 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:22,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6367 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:12:22,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2025-03-03 16:12:22,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2025-03-03 16:12:22,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 848 states have (on average 1.8455188679245282) internal successors, (1565), 849 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:22,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1565 transitions. [2025-03-03 16:12:22,574 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1565 transitions. Word has length 26 [2025-03-03 16:12:22,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:22,575 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1565 transitions. [2025-03-03 16:12:22,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:22,575 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1565 transitions. [2025-03-03 16:12:22,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:12:22,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:22,576 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] [2025-03-03 16:12:22,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:12:22,576 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:22,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:22,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1878112614, now seen corresponding path program 1 times [2025-03-03 16:12:22,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:22,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733578471] [2025-03-03 16:12:22,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:22,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:22,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:12:22,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:12:22,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:22,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:22,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:22,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733578471] [2025-03-03 16:12:22,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733578471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:22,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:22,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:12:22,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326803509] [2025-03-03 16:12:22,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:22,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:12:22,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:22,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:12:22,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:12:22,804 INFO L87 Difference]: Start difference. First operand 850 states and 1565 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:23,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:23,081 INFO L93 Difference]: Finished difference Result 1450 states and 2525 transitions. [2025-03-03 16:12:23,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 16:12:23,081 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-03 16:12:23,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:23,088 INFO L225 Difference]: With dead ends: 1450 [2025-03-03 16:12:23,088 INFO L226 Difference]: Without dead ends: 1400 [2025-03-03 16:12:23,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-03-03 16:12:23,090 INFO L435 NwaCegarLoop]: 1559 mSDtfsCounter, 9729 mSDsluCounter, 1968 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9729 SdHoareTripleChecker+Valid, 3527 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:23,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9729 Valid, 3527 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:12:23,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2025-03-03 16:12:23,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 898. [2025-03-03 16:12:23,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 896 states have (on average 1.8325892857142858) internal successors, (1642), 897 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:23,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1642 transitions. [2025-03-03 16:12:23,121 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1642 transitions. Word has length 65 [2025-03-03 16:12:23,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:23,122 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1642 transitions. [2025-03-03 16:12:23,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:23,122 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1642 transitions. [2025-03-03 16:12:23,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 16:12:23,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:23,125 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:12:23,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:12:23,126 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:23,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:23,127 INFO L85 PathProgramCache]: Analyzing trace with hash 140395509, now seen corresponding path program 1 times [2025-03-03 16:12:23,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:23,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891198930] [2025-03-03 16:12:23,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:23,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:23,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 16:12:23,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 16:12:23,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:23,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:23,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:23,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891198930] [2025-03-03 16:12:23,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891198930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:23,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:23,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:12:23,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250008810] [2025-03-03 16:12:23,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:23,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:12:23,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:23,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:12:23,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:23,255 INFO L87 Difference]: Start difference. First operand 898 states and 1642 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:23,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:23,291 INFO L93 Difference]: Finished difference Result 1083 states and 1937 transitions. [2025-03-03 16:12:23,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:12:23,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 16:12:23,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:23,296 INFO L225 Difference]: With dead ends: 1083 [2025-03-03 16:12:23,296 INFO L226 Difference]: Without dead ends: 985 [2025-03-03 16:12:23,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:23,298 INFO L435 NwaCegarLoop]: 1561 mSDtfsCounter, 1492 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 1634 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-03 16:12:23,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 1634 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:12:23,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2025-03-03 16:12:23,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 981. [2025-03-03 16:12:23,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 979 states have (on average 1.8100102145045964) internal successors, (1772), 980 states have internal predecessors, (1772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:23,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1772 transitions. [2025-03-03 16:12:23,327 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1772 transitions. Word has length 67 [2025-03-03 16:12:23,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:23,328 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1772 transitions. [2025-03-03 16:12:23,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:23,328 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1772 transitions. [2025-03-03 16:12:23,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 16:12:23,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:23,329 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:12:23,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:12:23,330 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:23,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:23,330 INFO L85 PathProgramCache]: Analyzing trace with hash 172718744, now seen corresponding path program 1 times [2025-03-03 16:12:23,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:23,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912853080] [2025-03-03 16:12:23,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:23,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:23,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 16:12:23,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 16:12:23,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:23,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:23,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:23,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:23,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912853080] [2025-03-03 16:12:23,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912853080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:23,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:23,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:12:23,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996821871] [2025-03-03 16:12:23,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:23,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:12:23,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:23,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:12:23,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:12:23,677 INFO L87 Difference]: Start difference. First operand 981 states and 1772 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:23,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:23,877 INFO L93 Difference]: Finished difference Result 1164 states and 2060 transitions. [2025-03-03 16:12:23,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:12:23,877 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 16:12:23,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:23,880 INFO L225 Difference]: With dead ends: 1164 [2025-03-03 16:12:23,881 INFO L226 Difference]: Without dead ends: 983 [2025-03-03 16:12:23,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-03 16:12:23,881 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 6020 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6020 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:23,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6020 Valid, 1941 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:12:23,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2025-03-03 16:12:23,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 981. [2025-03-03 16:12:23,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 979 states have (on average 1.8079673135852912) internal successors, (1770), 980 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:23,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1770 transitions. [2025-03-03 16:12:23,898 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1770 transitions. Word has length 67 [2025-03-03 16:12:23,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:23,898 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1770 transitions. [2025-03-03 16:12:23,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:23,898 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1770 transitions. [2025-03-03 16:12:23,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 16:12:23,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:23,899 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:12:23,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:12:23,899 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:23,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:23,900 INFO L85 PathProgramCache]: Analyzing trace with hash -95874001, now seen corresponding path program 1 times [2025-03-03 16:12:23,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:23,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471768824] [2025-03-03 16:12:23,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:23,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:23,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 16:12:23,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 16:12:23,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:23,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:24,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:24,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:24,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471768824] [2025-03-03 16:12:24,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471768824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:24,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:24,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:12:24,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558205456] [2025-03-03 16:12:24,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:24,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:12:24,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:24,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:12:24,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:12:24,032 INFO L87 Difference]: Start difference. First operand 981 states and 1770 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:28,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:28,387 INFO L93 Difference]: Finished difference Result 3236 states and 6079 transitions. [2025-03-03 16:12:28,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:12:28,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 16:12:28,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:28,395 INFO L225 Difference]: With dead ends: 3236 [2025-03-03 16:12:28,395 INFO L226 Difference]: Without dead ends: 2483 [2025-03-03 16:12:28,396 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-03 16:12:28,397 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 2431 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2431 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:28,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2431 Valid, 819 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-03 16:12:28,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2025-03-03 16:12:28,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 2483. [2025-03-03 16:12:28,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2483 states, 2481 states have (on average 1.5654977831519548) internal successors, (3884), 2482 states have internal predecessors, (3884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:28,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 3884 transitions. [2025-03-03 16:12:28,435 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 3884 transitions. Word has length 67 [2025-03-03 16:12:28,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:28,436 INFO L471 AbstractCegarLoop]: Abstraction has 2483 states and 3884 transitions. [2025-03-03 16:12:28,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:28,436 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 3884 transitions. [2025-03-03 16:12:28,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:12:28,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:28,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:12:28,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:12:28,438 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:28,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:28,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1089851502, now seen corresponding path program 1 times [2025-03-03 16:12:28,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:28,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342142161] [2025-03-03 16:12:28,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:28,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:28,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:12:28,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:12:28,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:28,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:28,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:28,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:28,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342142161] [2025-03-03 16:12:28,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342142161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:28,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:28,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:12:28,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431958604] [2025-03-03 16:12:28,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:28,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:12:28,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:28,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:12:28,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:12:28,651 INFO L87 Difference]: Start difference. First operand 2483 states and 3884 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:28,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:28,731 INFO L93 Difference]: Finished difference Result 2491 states and 3893 transitions. [2025-03-03 16:12:28,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:12:28,732 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 16:12:28,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:28,739 INFO L225 Difference]: With dead ends: 2491 [2025-03-03 16:12:28,739 INFO L226 Difference]: Without dead ends: 2489 [2025-03-03 16:12:28,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:12:28,741 INFO L435 NwaCegarLoop]: 1559 mSDtfsCounter, 0 mSDsluCounter, 9341 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10900 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:28,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10900 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:12:28,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2025-03-03 16:12:28,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 2489. [2025-03-03 16:12:28,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2489 states, 2487 states have (on average 1.5637314032971452) internal successors, (3889), 2488 states have internal predecessors, (3889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:28,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2489 states to 2489 states and 3889 transitions. [2025-03-03 16:12:28,778 INFO L78 Accepts]: Start accepts. Automaton has 2489 states and 3889 transitions. Word has length 68 [2025-03-03 16:12:28,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:28,778 INFO L471 AbstractCegarLoop]: Abstraction has 2489 states and 3889 transitions. [2025-03-03 16:12:28,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:28,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 3889 transitions. [2025-03-03 16:12:28,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:12:28,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:28,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:12:28,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:12:28,779 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:28,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:28,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1188896010, now seen corresponding path program 1 times [2025-03-03 16:12:28,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:28,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341428854] [2025-03-03 16:12:28,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:28,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:28,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:12:28,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:12:28,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:28,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:28,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:28,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:28,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341428854] [2025-03-03 16:12:28,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341428854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:28,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:28,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:12:28,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303619758] [2025-03-03 16:12:28,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:28,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:12:28,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:28,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:12:28,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:28,829 INFO L87 Difference]: Start difference. First operand 2489 states and 3889 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:28,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:28,849 INFO L93 Difference]: Finished difference Result 2847 states and 4441 transitions. [2025-03-03 16:12:28,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:12:28,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 16:12:28,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:28,857 INFO L225 Difference]: With dead ends: 2847 [2025-03-03 16:12:28,857 INFO L226 Difference]: Without dead ends: 2660 [2025-03-03 16:12:28,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:28,858 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 1507 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1707 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-03 16:12:28,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1707 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:12:28,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states. [2025-03-03 16:12:28,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2658. [2025-03-03 16:12:28,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2658 states, 2656 states have (on average 1.5609939759036144) internal successors, (4146), 2657 states have internal predecessors, (4146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:28,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 4146 transitions. [2025-03-03 16:12:28,895 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 4146 transitions. Word has length 69 [2025-03-03 16:12:28,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:28,895 INFO L471 AbstractCegarLoop]: Abstraction has 2658 states and 4146 transitions. [2025-03-03 16:12:28,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:28,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 4146 transitions. [2025-03-03 16:12:28,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:12:28,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:28,896 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:12:28,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:12:28,896 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:28,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:28,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2127140790, now seen corresponding path program 1 times [2025-03-03 16:12:28,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:28,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106566708] [2025-03-03 16:12:28,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:28,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:28,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:12:28,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:12:28,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:28,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:28,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:28,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:28,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106566708] [2025-03-03 16:12:28,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106566708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:28,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:28,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:12:28,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726219891] [2025-03-03 16:12:28,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:28,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:12:28,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:28,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:12:28,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:28,948 INFO L87 Difference]: Start difference. First operand 2658 states and 4146 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:28,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:28,973 INFO L93 Difference]: Finished difference Result 3338 states and 5184 transitions. [2025-03-03 16:12:28,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:12:28,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 16:12:28,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:28,981 INFO L225 Difference]: With dead ends: 3338 [2025-03-03 16:12:28,981 INFO L226 Difference]: Without dead ends: 2982 [2025-03-03 16:12:28,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:28,983 INFO L435 NwaCegarLoop]: 1620 mSDtfsCounter, 1505 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 1709 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-03 16:12:28,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1709 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:12:28,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2025-03-03 16:12:29,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2980. [2025-03-03 16:12:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2980 states, 2978 states have (on average 1.5540631296171927) internal successors, (4628), 2979 states have internal predecessors, (4628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:29,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2980 states to 2980 states and 4628 transitions. [2025-03-03 16:12:29,028 INFO L78 Accepts]: Start accepts. Automaton has 2980 states and 4628 transitions. Word has length 69 [2025-03-03 16:12:29,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:29,028 INFO L471 AbstractCegarLoop]: Abstraction has 2980 states and 4628 transitions. [2025-03-03 16:12:29,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:29,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2980 states and 4628 transitions. [2025-03-03 16:12:29,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:12:29,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:29,032 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:12:29,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:12:29,033 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:29,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:29,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1679195254, now seen corresponding path program 1 times [2025-03-03 16:12:29,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:29,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450037870] [2025-03-03 16:12:29,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:29,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:29,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:12:29,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:12:29,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:29,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:29,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:29,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450037870] [2025-03-03 16:12:29,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450037870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:29,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:29,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:12:29,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948473285] [2025-03-03 16:12:29,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:29,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:12:29,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:29,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:12:29,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:29,075 INFO L87 Difference]: Start difference. First operand 2980 states and 4628 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:29,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:29,100 INFO L93 Difference]: Finished difference Result 4272 states and 6574 transitions. [2025-03-03 16:12:29,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:12:29,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 16:12:29,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:29,110 INFO L225 Difference]: With dead ends: 4272 [2025-03-03 16:12:29,110 INFO L226 Difference]: Without dead ends: 3594 [2025-03-03 16:12:29,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:29,111 INFO L435 NwaCegarLoop]: 1618 mSDtfsCounter, 1503 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1711 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-03 16:12:29,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 1711 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:12:29,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2025-03-03 16:12:29,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3592. [2025-03-03 16:12:29,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3592 states, 3590 states have (on average 1.5398328690807799) internal successors, (5528), 3591 states have internal predecessors, (5528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:29,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5528 transitions. [2025-03-03 16:12:29,167 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5528 transitions. Word has length 69 [2025-03-03 16:12:29,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:29,167 INFO L471 AbstractCegarLoop]: Abstraction has 3592 states and 5528 transitions. [2025-03-03 16:12:29,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:29,167 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5528 transitions. [2025-03-03 16:12:29,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:12:29,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:29,169 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:12:29,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:12:29,169 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:29,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:29,170 INFO L85 PathProgramCache]: Analyzing trace with hash 2094371126, now seen corresponding path program 1 times [2025-03-03 16:12:29,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:29,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326739380] [2025-03-03 16:12:29,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:29,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:29,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:12:29,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:12:29,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:29,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:29,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:29,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:29,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326739380] [2025-03-03 16:12:29,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326739380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:29,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:29,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:12:29,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292118204] [2025-03-03 16:12:29,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:29,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:12:29,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:29,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:12:29,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:29,209 INFO L87 Difference]: Start difference. First operand 3592 states and 5528 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:29,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:29,244 INFO L93 Difference]: Finished difference Result 6044 states and 9162 transitions. [2025-03-03 16:12:29,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:12:29,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 16:12:29,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:29,266 INFO L225 Difference]: With dead ends: 6044 [2025-03-03 16:12:29,267 INFO L226 Difference]: Without dead ends: 4754 [2025-03-03 16:12:29,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:29,272 INFO L435 NwaCegarLoop]: 1616 mSDtfsCounter, 1501 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 1713 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-03 16:12:29,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 1713 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:12:29,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4754 states. [2025-03-03 16:12:29,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4754 to 4752. [2025-03-03 16:12:29,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4752 states, 4750 states have (on average 1.5157894736842106) internal successors, (7200), 4751 states have internal predecessors, (7200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4752 states to 4752 states and 7200 transitions. [2025-03-03 16:12:29,351 INFO L78 Accepts]: Start accepts. Automaton has 4752 states and 7200 transitions. Word has length 69 [2025-03-03 16:12:29,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:29,351 INFO L471 AbstractCegarLoop]: Abstraction has 4752 states and 7200 transitions. [2025-03-03 16:12:29,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:29,351 INFO L276 IsEmpty]: Start isEmpty. Operand 4752 states and 7200 transitions. [2025-03-03 16:12:29,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:12:29,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:29,352 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:12:29,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:12:29,352 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:29,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:29,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1607652854, now seen corresponding path program 1 times [2025-03-03 16:12:29,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:29,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925631607] [2025-03-03 16:12:29,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:29,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:29,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:12:29,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:12:29,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:29,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:29,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:29,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:29,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925631607] [2025-03-03 16:12:29,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925631607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:29,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:29,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:12:29,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135368862] [2025-03-03 16:12:29,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:29,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:12:29,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:29,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:12:29,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:29,398 INFO L87 Difference]: Start difference. First operand 4752 states and 7200 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:29,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:29,454 INFO L93 Difference]: Finished difference Result 9396 states and 13954 transitions. [2025-03-03 16:12:29,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:12:29,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 16:12:29,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:29,467 INFO L225 Difference]: With dead ends: 9396 [2025-03-03 16:12:29,467 INFO L226 Difference]: Without dead ends: 6946 [2025-03-03 16:12:29,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:29,473 INFO L435 NwaCegarLoop]: 1614 mSDtfsCounter, 1499 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 1715 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-03 16:12:29,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 1715 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:12:29,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2025-03-03 16:12:29,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 6944. [2025-03-03 16:12:29,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6944 states, 6942 states have (on average 1.4819936617689426) internal successors, (10288), 6943 states have internal predecessors, (10288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:29,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6944 states to 6944 states and 10288 transitions. [2025-03-03 16:12:29,677 INFO L78 Accepts]: Start accepts. Automaton has 6944 states and 10288 transitions. Word has length 69 [2025-03-03 16:12:29,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:29,677 INFO L471 AbstractCegarLoop]: Abstraction has 6944 states and 10288 transitions. [2025-03-03 16:12:29,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 6944 states and 10288 transitions. [2025-03-03 16:12:29,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 16:12:29,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:29,679 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:12:29,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:12:29,679 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:29,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:29,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1834425366, now seen corresponding path program 1 times [2025-03-03 16:12:29,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:29,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388743075] [2025-03-03 16:12:29,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:29,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:29,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 16:12:29,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 16:12:29,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:29,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:29,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:29,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:29,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388743075] [2025-03-03 16:12:29,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388743075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:29,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:29,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:12:29,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696737274] [2025-03-03 16:12:29,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:29,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:12:29,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:29,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:12:29,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:29,734 INFO L87 Difference]: Start difference. First operand 6944 states and 10288 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:29,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:29,827 INFO L93 Difference]: Finished difference Result 11815 states and 17398 transitions. [2025-03-03 16:12:29,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:12:29,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-03 16:12:29,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:29,843 INFO L225 Difference]: With dead ends: 11815 [2025-03-03 16:12:29,844 INFO L226 Difference]: Without dead ends: 9188 [2025-03-03 16:12:29,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:29,850 INFO L435 NwaCegarLoop]: 1627 mSDtfsCounter, 1506 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1708 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-03 16:12:29,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1708 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:12:29,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9188 states. [2025-03-03 16:12:29,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9188 to 9186. [2025-03-03 16:12:29,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9186 states, 9184 states have (on average 1.4653745644599303) internal successors, (13458), 9185 states have internal predecessors, (13458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:29,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9186 states to 9186 states and 13458 transitions. [2025-03-03 16:12:29,997 INFO L78 Accepts]: Start accepts. Automaton has 9186 states and 13458 transitions. Word has length 71 [2025-03-03 16:12:29,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:29,997 INFO L471 AbstractCegarLoop]: Abstraction has 9186 states and 13458 transitions. [2025-03-03 16:12:29,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:29,997 INFO L276 IsEmpty]: Start isEmpty. Operand 9186 states and 13458 transitions. [2025-03-03 16:12:29,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:12:29,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:29,999 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:12:29,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:12:29,999 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:30,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:30,000 INFO L85 PathProgramCache]: Analyzing trace with hash -65687301, now seen corresponding path program 1 times [2025-03-03 16:12:30,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:30,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201920360] [2025-03-03 16:12:30,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:30,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:30,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:12:30,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:12:30,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:30,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:30,144 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 16:12:30,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:30,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201920360] [2025-03-03 16:12:30,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201920360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:30,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:30,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:12:30,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558428815] [2025-03-03 16:12:30,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:30,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:12:30,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:30,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:12:30,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:12:30,146 INFO L87 Difference]: Start difference. First operand 9186 states and 13458 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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-03 16:12:30,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:30,636 INFO L93 Difference]: Finished difference Result 51920 states and 74585 transitions. [2025-03-03 16:12:30,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:12:30,637 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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 90 [2025-03-03 16:12:30,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:30,709 INFO L225 Difference]: With dead ends: 51920 [2025-03-03 16:12:30,709 INFO L226 Difference]: Without dead ends: 45038 [2025-03-03 16:12:30,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:12:30,729 INFO L435 NwaCegarLoop]: 1645 mSDtfsCounter, 8052 mSDsluCounter, 2399 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8052 SdHoareTripleChecker+Valid, 4044 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:30,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8052 Valid, 4044 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:12:30,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45038 states. [2025-03-03 16:12:31,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45038 to 16066. [2025-03-03 16:12:31,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16066 states, 16064 states have (on average 1.4453436254980079) internal successors, (23218), 16065 states have internal predecessors, (23218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:31,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16066 states to 16066 states and 23218 transitions. [2025-03-03 16:12:31,200 INFO L78 Accepts]: Start accepts. Automaton has 16066 states and 23218 transitions. Word has length 90 [2025-03-03 16:12:31,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:31,200 INFO L471 AbstractCegarLoop]: Abstraction has 16066 states and 23218 transitions. [2025-03-03 16:12:31,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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-03 16:12:31,201 INFO L276 IsEmpty]: Start isEmpty. Operand 16066 states and 23218 transitions. [2025-03-03 16:12:31,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:12:31,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:31,204 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:12:31,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:12:31,205 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:31,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:31,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1044617797, now seen corresponding path program 1 times [2025-03-03 16:12:31,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:31,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933635802] [2025-03-03 16:12:31,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:31,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:31,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:12:31,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:12:31,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:31,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 16:12:31,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:31,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933635802] [2025-03-03 16:12:31,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933635802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:31,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:31,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:12:31,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684306965] [2025-03-03 16:12:31,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:31,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:12:31,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:31,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:12:31,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:12:31,341 INFO L87 Difference]: Start difference. First operand 16066 states and 23218 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:31,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:31,979 INFO L93 Difference]: Finished difference Result 58800 states and 84345 transitions. [2025-03-03 16:12:31,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:12:31,979 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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-03 16:12:31,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:32,054 INFO L225 Difference]: With dead ends: 58800 [2025-03-03 16:12:32,055 INFO L226 Difference]: Without dead ends: 51918 [2025-03-03 16:12:32,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:12:32,074 INFO L435 NwaCegarLoop]: 1642 mSDtfsCounter, 8073 mSDsluCounter, 2322 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8073 SdHoareTripleChecker+Valid, 3964 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:32,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8073 Valid, 3964 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:12:32,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51918 states. [2025-03-03 16:12:32,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51918 to 26402. [2025-03-03 16:12:32,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26402 states, 26400 states have (on average 1.4309848484848484) internal successors, (37778), 26401 states have internal predecessors, (37778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:32,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26402 states to 26402 states and 37778 transitions. [2025-03-03 16:12:32,917 INFO L78 Accepts]: Start accepts. Automaton has 26402 states and 37778 transitions. Word has length 90 [2025-03-03 16:12:32,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:32,917 INFO L471 AbstractCegarLoop]: Abstraction has 26402 states and 37778 transitions. [2025-03-03 16:12:32,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:32,918 INFO L276 IsEmpty]: Start isEmpty. Operand 26402 states and 37778 transitions. [2025-03-03 16:12:32,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:12:32,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:32,921 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:12:32,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:12:32,921 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:32,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:32,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1492563333, now seen corresponding path program 1 times [2025-03-03 16:12:32,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:32,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155344166] [2025-03-03 16:12:32,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:32,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:32,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:12:32,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:12:32,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:32,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:33,076 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 16:12:33,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:33,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155344166] [2025-03-03 16:12:33,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155344166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:33,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:33,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:12:33,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953612371] [2025-03-03 16:12:33,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:33,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:12:33,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:33,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:12:33,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:12:33,080 INFO L87 Difference]: Start difference. First operand 26402 states and 37778 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:33,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:33,927 INFO L93 Difference]: Finished difference Result 65680 states and 94105 transitions. [2025-03-03 16:12:33,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:12:33,927 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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-03 16:12:33,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:33,995 INFO L225 Difference]: With dead ends: 65680 [2025-03-03 16:12:33,995 INFO L226 Difference]: Without dead ends: 58798 [2025-03-03 16:12:34,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:12:34,016 INFO L435 NwaCegarLoop]: 1639 mSDtfsCounter, 8114 mSDsluCounter, 2277 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8114 SdHoareTripleChecker+Valid, 3916 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:34,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8114 Valid, 3916 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:12:34,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58798 states. [2025-03-03 16:12:34,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58798 to 33282. [2025-03-03 16:12:34,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33282 states, 33280 states have (on average 1.4284254807692307) internal successors, (47538), 33281 states have internal predecessors, (47538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:34,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33282 states to 33282 states and 47538 transitions. [2025-03-03 16:12:34,766 INFO L78 Accepts]: Start accepts. Automaton has 33282 states and 47538 transitions. Word has length 90 [2025-03-03 16:12:34,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:34,766 INFO L471 AbstractCegarLoop]: Abstraction has 33282 states and 47538 transitions. [2025-03-03 16:12:34,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:34,766 INFO L276 IsEmpty]: Start isEmpty. Operand 33282 states and 47538 transitions. [2025-03-03 16:12:34,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:12:34,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:34,769 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:12:34,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:12:34,769 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:34,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:34,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1077387461, now seen corresponding path program 1 times [2025-03-03 16:12:34,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:34,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055020836] [2025-03-03 16:12:34,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:34,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:34,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:12:34,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:12:34,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:34,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:34,881 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 16:12:34,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:34,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055020836] [2025-03-03 16:12:34,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055020836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:34,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:34,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:12:34,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56777067] [2025-03-03 16:12:34,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:34,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:12:34,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:34,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:12:34,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:12:34,882 INFO L87 Difference]: Start difference. First operand 33282 states and 47538 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:35,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:35,748 INFO L93 Difference]: Finished difference Result 72560 states and 103865 transitions. [2025-03-03 16:12:35,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:12:35,749 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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-03 16:12:35,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:35,827 INFO L225 Difference]: With dead ends: 72560 [2025-03-03 16:12:35,827 INFO L226 Difference]: Without dead ends: 65678 [2025-03-03 16:12:35,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:12:35,852 INFO L435 NwaCegarLoop]: 1636 mSDtfsCounter, 8168 mSDsluCounter, 2260 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8168 SdHoareTripleChecker+Valid, 3896 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:35,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8168 Valid, 3896 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:12:35,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65678 states. [2025-03-03 16:12:36,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65678 to 40162. [2025-03-03 16:12:36,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40162 states, 40160 states have (on average 1.4267430278884463) internal successors, (57298), 40161 states have internal predecessors, (57298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:37,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40162 states to 40162 states and 57298 transitions. [2025-03-03 16:12:37,038 INFO L78 Accepts]: Start accepts. Automaton has 40162 states and 57298 transitions. Word has length 90 [2025-03-03 16:12:37,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:37,039 INFO L471 AbstractCegarLoop]: Abstraction has 40162 states and 57298 transitions. [2025-03-03 16:12:37,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:37,039 INFO L276 IsEmpty]: Start isEmpty. Operand 40162 states and 57298 transitions. [2025-03-03 16:12:37,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:12:37,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:37,042 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:12:37,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:12:37,042 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:37,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:37,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1564105733, now seen corresponding path program 1 times [2025-03-03 16:12:37,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:37,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269848595] [2025-03-03 16:12:37,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:37,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:37,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:12:37,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:12:37,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:37,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:37,187 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 16:12:37,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:37,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269848595] [2025-03-03 16:12:37,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269848595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:37,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:37,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:12:37,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867085075] [2025-03-03 16:12:37,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:37,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:12:37,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:37,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:12:37,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:12:37,190 INFO L87 Difference]: Start difference. First operand 40162 states and 57298 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:38,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:38,453 INFO L93 Difference]: Finished difference Result 79440 states and 113625 transitions. [2025-03-03 16:12:38,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:12:38,453 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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-03 16:12:38,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:38,534 INFO L225 Difference]: With dead ends: 79440 [2025-03-03 16:12:38,534 INFO L226 Difference]: Without dead ends: 72558 [2025-03-03 16:12:38,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:12:38,556 INFO L435 NwaCegarLoop]: 1642 mSDtfsCounter, 8072 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8072 SdHoareTripleChecker+Valid, 3988 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:38,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8072 Valid, 3988 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:12:38,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72558 states. [2025-03-03 16:12:39,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72558 to 47042. [2025-03-03 16:12:39,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47042 states, 47040 states have (on average 1.4255527210884353) internal successors, (67058), 47041 states have internal predecessors, (67058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:39,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47042 states to 47042 states and 67058 transitions. [2025-03-03 16:12:39,579 INFO L78 Accepts]: Start accepts. Automaton has 47042 states and 67058 transitions. Word has length 90 [2025-03-03 16:12:39,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:39,579 INFO L471 AbstractCegarLoop]: Abstraction has 47042 states and 67058 transitions. [2025-03-03 16:12:39,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:39,579 INFO L276 IsEmpty]: Start isEmpty. Operand 47042 states and 67058 transitions. [2025-03-03 16:12:39,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:12:39,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:39,583 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:12:39,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:12:39,583 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:39,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:39,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1843277639, now seen corresponding path program 1 times [2025-03-03 16:12:39,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:39,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180695657] [2025-03-03 16:12:39,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:39,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:39,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:12:39,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:12:39,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:39,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:39,645 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:39,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:39,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180695657] [2025-03-03 16:12:39,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180695657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:39,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:39,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:12:39,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291074602] [2025-03-03 16:12:39,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:39,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:12:39,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:39,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:12:39,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:39,646 INFO L87 Difference]: Start difference. First operand 47042 states and 67058 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:40,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:40,163 INFO L93 Difference]: Finished difference Result 78684 states and 112427 transitions. [2025-03-03 16:12:40,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:12:40,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-03 16:12:40,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:40,205 INFO L225 Difference]: With dead ends: 78684 [2025-03-03 16:12:40,205 INFO L226 Difference]: Without dead ends: 33946 [2025-03-03 16:12:40,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:40,239 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 58 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3163 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:40,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3163 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:12:40,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33946 states. [2025-03-03 16:12:40,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33946 to 33944. [2025-03-03 16:12:40,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33944 states, 33942 states have (on average 1.4304401626303695) internal successors, (48552), 33943 states have internal predecessors, (48552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:41,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33944 states to 33944 states and 48552 transitions. [2025-03-03 16:12:41,023 INFO L78 Accepts]: Start accepts. Automaton has 33944 states and 48552 transitions. Word has length 92 [2025-03-03 16:12:41,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:41,023 INFO L471 AbstractCegarLoop]: Abstraction has 33944 states and 48552 transitions. [2025-03-03 16:12:41,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:41,023 INFO L276 IsEmpty]: Start isEmpty. Operand 33944 states and 48552 transitions. [2025-03-03 16:12:41,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:12:41,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:41,025 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:12:41,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:12:41,025 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:41,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:41,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1093763877, now seen corresponding path program 1 times [2025-03-03 16:12:41,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:41,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626540893] [2025-03-03 16:12:41,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:41,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:41,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:12:41,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:12:41,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:41,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:41,125 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:12:41,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:41,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626540893] [2025-03-03 16:12:41,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626540893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:41,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:41,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:12:41,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162898914] [2025-03-03 16:12:41,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:41,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:12:41,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:41,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:12:41,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:12:41,127 INFO L87 Difference]: Start difference. First operand 33944 states and 48552 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-03 16:12:42,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:42,183 INFO L93 Difference]: Finished difference Result 63142 states and 90415 transitions. [2025-03-03 16:12:42,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:12:42,184 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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 92 [2025-03-03 16:12:42,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:42,255 INFO L225 Difference]: With dead ends: 63142 [2025-03-03 16:12:42,255 INFO L226 Difference]: Without dead ends: 58276 [2025-03-03 16:12:42,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:12:42,272 INFO L435 NwaCegarLoop]: 1634 mSDtfsCounter, 8056 mSDsluCounter, 2580 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8056 SdHoareTripleChecker+Valid, 4214 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:42,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8056 Valid, 4214 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:12:42,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58276 states. [2025-03-03 16:12:43,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58276 to 38808. [2025-03-03 16:12:43,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38808 states, 38806 states have (on average 1.4292635159511415) internal successors, (55464), 38807 states have internal predecessors, (55464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:43,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38808 states to 38808 states and 55464 transitions. [2025-03-03 16:12:43,589 INFO L78 Accepts]: Start accepts. Automaton has 38808 states and 55464 transitions. Word has length 92 [2025-03-03 16:12:43,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:43,589 INFO L471 AbstractCegarLoop]: Abstraction has 38808 states and 55464 transitions. [2025-03-03 16:12:43,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-03 16:12:43,589 INFO L276 IsEmpty]: Start isEmpty. Operand 38808 states and 55464 transitions. [2025-03-03 16:12:43,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 16:12:43,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:43,592 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:12:43,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 16:12:43,592 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:43,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:43,592 INFO L85 PathProgramCache]: Analyzing trace with hash 543737427, now seen corresponding path program 1 times [2025-03-03 16:12:43,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:43,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750468176] [2025-03-03 16:12:43,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:43,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:43,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 16:12:43,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 16:12:43,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:43,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:43,679 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:43,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:43,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750468176] [2025-03-03 16:12:43,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750468176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:43,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:43,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:12:43,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865758773] [2025-03-03 16:12:43,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:43,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:12:43,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:43,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:12:43,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:43,681 INFO L87 Difference]: Start difference. First operand 38808 states and 55464 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-03 16:12:44,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:44,198 INFO L93 Difference]: Finished difference Result 57052 states and 81386 transitions. [2025-03-03 16:12:44,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:12:44,199 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-03 16:12:44,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:44,221 INFO L225 Difference]: With dead ends: 57052 [2025-03-03 16:12:44,221 INFO L226 Difference]: Without dead ends: 20570 [2025-03-03 16:12:44,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:44,239 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 53 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3148 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:44,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3148 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:12:44,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20570 states. [2025-03-03 16:12:44,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20570 to 20568. [2025-03-03 16:12:44,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20568 states, 20566 states have (on average 1.4248760089468053) internal successors, (29304), 20567 states have internal predecessors, (29304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:44,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20568 states to 20568 states and 29304 transitions. [2025-03-03 16:12:44,606 INFO L78 Accepts]: Start accepts. Automaton has 20568 states and 29304 transitions. Word has length 93 [2025-03-03 16:12:44,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:44,606 INFO L471 AbstractCegarLoop]: Abstraction has 20568 states and 29304 transitions. [2025-03-03 16:12:44,606 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-03 16:12:44,606 INFO L276 IsEmpty]: Start isEmpty. Operand 20568 states and 29304 transitions. [2025-03-03 16:12:44,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 16:12:44,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:44,608 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:12:44,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 16:12:44,608 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:44,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:44,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1280111130, now seen corresponding path program 1 times [2025-03-03 16:12:44,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:44,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194987380] [2025-03-03 16:12:44,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:44,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:44,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 16:12:44,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 16:12:44,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:44,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:44,665 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:44,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:44,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194987380] [2025-03-03 16:12:44,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194987380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:44,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:44,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:12:44,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134827970] [2025-03-03 16:12:44,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:44,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:12:44,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:44,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:12:44,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:44,666 INFO L87 Difference]: Start difference. First operand 20568 states and 29304 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:44,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:44,823 INFO L93 Difference]: Finished difference Result 29692 states and 42146 transitions. [2025-03-03 16:12:44,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:12:44,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-03-03 16:12:44,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:44,839 INFO L225 Difference]: With dead ends: 29692 [2025-03-03 16:12:44,839 INFO L226 Difference]: Without dead ends: 11450 [2025-03-03 16:12:44,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:44,852 INFO L435 NwaCegarLoop]: 1599 mSDtfsCounter, 50 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3133 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:44,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3133 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:12:44,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11450 states. [2025-03-03 16:12:45,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11450 to 11448. [2025-03-03 16:12:45,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11448 states, 11446 states have (on average 1.427922418312074) internal successors, (16344), 11447 states have internal predecessors, (16344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:45,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11448 states to 11448 states and 16344 transitions. [2025-03-03 16:12:45,043 INFO L78 Accepts]: Start accepts. Automaton has 11448 states and 16344 transitions. Word has length 95 [2025-03-03 16:12:45,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:45,044 INFO L471 AbstractCegarLoop]: Abstraction has 11448 states and 16344 transitions. [2025-03-03 16:12:45,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:45,044 INFO L276 IsEmpty]: Start isEmpty. Operand 11448 states and 16344 transitions. [2025-03-03 16:12:45,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 16:12:45,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:45,045 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:12:45,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 16:12:45,045 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:45,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:45,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2035285761, now seen corresponding path program 1 times [2025-03-03 16:12:45,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:45,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096897608] [2025-03-03 16:12:45,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:45,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:45,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 16:12:45,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 16:12:45,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:45,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:45,103 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:45,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:45,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096897608] [2025-03-03 16:12:45,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096897608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:45,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:45,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:12:45,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041235266] [2025-03-03 16:12:45,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:45,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:12:45,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:45,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:12:45,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:45,105 INFO L87 Difference]: Start difference. First operand 11448 states and 16344 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:45,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:45,193 INFO L93 Difference]: Finished difference Result 16012 states and 22706 transitions. [2025-03-03 16:12:45,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:12:45,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-03 16:12:45,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:45,202 INFO L225 Difference]: With dead ends: 16012 [2025-03-03 16:12:45,202 INFO L226 Difference]: Without dead ends: 6890 [2025-03-03 16:12:45,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:45,209 INFO L435 NwaCegarLoop]: 1592 mSDtfsCounter, 47 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3118 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:45,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:12:45,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6890 states. [2025-03-03 16:12:45,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6890 to 6888. [2025-03-03 16:12:45,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6888 states, 6886 states have (on average 1.441185013069997) internal successors, (9924), 6887 states have internal predecessors, (9924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:45,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6888 states to 6888 states and 9924 transitions. [2025-03-03 16:12:45,319 INFO L78 Accepts]: Start accepts. Automaton has 6888 states and 9924 transitions. Word has length 97 [2025-03-03 16:12:45,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:45,319 INFO L471 AbstractCegarLoop]: Abstraction has 6888 states and 9924 transitions. [2025-03-03 16:12:45,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:45,320 INFO L276 IsEmpty]: Start isEmpty. Operand 6888 states and 9924 transitions. [2025-03-03 16:12:45,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 16:12:45,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:45,321 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:12:45,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 16:12:45,321 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:45,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:45,321 INFO L85 PathProgramCache]: Analyzing trace with hash 238968072, now seen corresponding path program 1 times [2025-03-03 16:12:45,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:45,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179308865] [2025-03-03 16:12:45,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:45,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:45,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 16:12:45,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 16:12:45,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:45,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:45,379 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:45,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:45,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179308865] [2025-03-03 16:12:45,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179308865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:45,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:45,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:12:45,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828190920] [2025-03-03 16:12:45,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:45,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:12:45,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:45,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:12:45,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:45,381 INFO L87 Difference]: Start difference. First operand 6888 states and 9924 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:45,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:45,482 INFO L93 Difference]: Finished difference Result 9172 states and 13076 transitions. [2025-03-03 16:12:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:12:45,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-03 16:12:45,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:45,488 INFO L225 Difference]: With dead ends: 9172 [2025-03-03 16:12:45,489 INFO L226 Difference]: Without dead ends: 4610 [2025-03-03 16:12:45,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:45,492 INFO L435 NwaCegarLoop]: 1585 mSDtfsCounter, 44 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 3103 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:45,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 3103 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:12:45,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4610 states. [2025-03-03 16:12:45,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4610 to 4608. [2025-03-03 16:12:45,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4608 states, 4606 states have (on average 1.4641771602257925) internal successors, (6744), 4607 states have internal predecessors, (6744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:45,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4608 states to 4608 states and 6744 transitions. [2025-03-03 16:12:45,556 INFO L78 Accepts]: Start accepts. Automaton has 4608 states and 6744 transitions. Word has length 99 [2025-03-03 16:12:45,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:45,556 INFO L471 AbstractCegarLoop]: Abstraction has 4608 states and 6744 transitions. [2025-03-03 16:12:45,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:45,556 INFO L276 IsEmpty]: Start isEmpty. Operand 4608 states and 6744 transitions. [2025-03-03 16:12:45,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 16:12:45,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:45,557 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:12:45,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 16:12:45,557 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:45,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:45,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1556710353, now seen corresponding path program 1 times [2025-03-03 16:12:45,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:45,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525482680] [2025-03-03 16:12:45,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:45,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:45,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 16:12:45,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 16:12:45,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:45,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:45,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:45,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525482680] [2025-03-03 16:12:45,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525482680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:45,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:45,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:12:45,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086830187] [2025-03-03 16:12:45,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:45,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:12:45,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:45,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:12:45,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:45,611 INFO L87 Difference]: Start difference. First operand 4608 states and 6744 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:45,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:45,644 INFO L93 Difference]: Finished difference Result 5752 states and 8306 transitions. [2025-03-03 16:12:45,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:12:45,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-03 16:12:45,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:45,649 INFO L225 Difference]: With dead ends: 5752 [2025-03-03 16:12:45,649 INFO L226 Difference]: Without dead ends: 3470 [2025-03-03 16:12:45,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:45,651 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 41 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3088 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:45,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3088 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:12:45,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3470 states. [2025-03-03 16:12:45,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3470 to 3468. [2025-03-03 16:12:45,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3468 states, 3466 states have (on average 1.4913444893248702) internal successors, (5169), 3467 states have internal predecessors, (5169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3468 states to 3468 states and 5169 transitions. [2025-03-03 16:12:45,694 INFO L78 Accepts]: Start accepts. Automaton has 3468 states and 5169 transitions. Word has length 101 [2025-03-03 16:12:45,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:45,694 INFO L471 AbstractCegarLoop]: Abstraction has 3468 states and 5169 transitions. [2025-03-03 16:12:45,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:45,695 INFO L276 IsEmpty]: Start isEmpty. Operand 3468 states and 5169 transitions. [2025-03-03 16:12:45,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 16:12:45,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:45,695 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:12:45,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 16:12:45,696 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:45,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:45,696 INFO L85 PathProgramCache]: Analyzing trace with hash -928461706, now seen corresponding path program 1 times [2025-03-03 16:12:45,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:45,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55147137] [2025-03-03 16:12:45,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:45,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:45,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 16:12:45,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 16:12:45,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:45,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:46,250 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:46,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:46,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55147137] [2025-03-03 16:12:46,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55147137] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:12:46,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385451504] [2025-03-03 16:12:46,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:46,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:12:46,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:12:46,253 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:12:46,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 16:12:46,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 16:12:46,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 16:12:46,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:46,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:46,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 16:12:46,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:12:46,709 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:46,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:12:46,989 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:46,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385451504] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:12:46,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:12:46,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 22 [2025-03-03 16:12:46,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158553133] [2025-03-03 16:12:46,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:12:46,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 16:12:46,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:46,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 16:12:46,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-03-03 16:12:46,992 INFO L87 Difference]: Start difference. First operand 3468 states and 5169 transitions. Second operand has 22 states, 22 states have (on average 13.454545454545455) internal successors, (296), 22 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:50,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:50,249 INFO L93 Difference]: Finished difference Result 14194 states and 19551 transitions. [2025-03-03 16:12:50,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-03-03 16:12:50,249 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 13.454545454545455) internal successors, (296), 22 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-03-03 16:12:50,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:50,264 INFO L225 Difference]: With dead ends: 14194 [2025-03-03 16:12:50,264 INFO L226 Difference]: Without dead ends: 12954 [2025-03-03 16:12:50,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2851 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1313, Invalid=7243, Unknown=0, NotChecked=0, Total=8556 [2025-03-03 16:12:50,310 INFO L435 NwaCegarLoop]: 1552 mSDtfsCounter, 12758 mSDsluCounter, 9844 mSDsCounter, 0 mSdLazyCounter, 2169 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12758 SdHoareTripleChecker+Valid, 11396 SdHoareTripleChecker+Invalid, 2284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 2169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:50,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12758 Valid, 11396 Invalid, 2284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 2169 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 16:12:50,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12954 states. [2025-03-03 16:12:50,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12954 to 12224. [2025-03-03 16:12:50,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12224 states, 12222 states have (on average 1.3697430862379316) internal successors, (16741), 12223 states have internal predecessors, (16741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:50,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12224 states to 12224 states and 16741 transitions. [2025-03-03 16:12:50,604 INFO L78 Accepts]: Start accepts. Automaton has 12224 states and 16741 transitions. Word has length 103 [2025-03-03 16:12:50,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:50,604 INFO L471 AbstractCegarLoop]: Abstraction has 12224 states and 16741 transitions. [2025-03-03 16:12:50,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 13.454545454545455) internal successors, (296), 22 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:50,605 INFO L276 IsEmpty]: Start isEmpty. Operand 12224 states and 16741 transitions. [2025-03-03 16:12:50,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 16:12:50,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:50,606 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:12:50,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 16:12:50,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-03 16:12:50,806 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:50,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:50,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1152799269, now seen corresponding path program 1 times [2025-03-03 16:12:50,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:50,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42469519] [2025-03-03 16:12:50,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:50,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:50,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 16:12:50,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 16:12:50,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:50,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:51,087 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:51,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:51,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42469519] [2025-03-03 16:12:51,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42469519] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:12:51,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713644856] [2025-03-03 16:12:51,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:51,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:12:51,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:12:51,089 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:12:51,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 16:12:51,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 16:12:51,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 16:12:51,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:51,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:51,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:12:51,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:12:51,701 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:51,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:12:52,375 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:52,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713644856] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:12:52,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:12:52,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-03 16:12:52,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382944131] [2025-03-03 16:12:52,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:12:52,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 16:12:52,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:52,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 16:12:52,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-03-03 16:12:52,376 INFO L87 Difference]: Start difference. First operand 12224 states and 16741 transitions. Second operand has 25 states, 25 states have (on average 11.2) internal successors, (280), 24 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:54,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:54,224 INFO L93 Difference]: Finished difference Result 54272 states and 72631 transitions. [2025-03-03 16:12:54,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-03 16:12:54,224 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 11.2) internal successors, (280), 24 states have internal predecessors, (280), 0 states have call successors, (0), 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 104 [2025-03-03 16:12:54,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:54,265 INFO L225 Difference]: With dead ends: 54272 [2025-03-03 16:12:54,266 INFO L226 Difference]: Without dead ends: 44438 [2025-03-03 16:12:54,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=632, Invalid=2448, Unknown=0, NotChecked=0, Total=3080 [2025-03-03 16:12:54,277 INFO L435 NwaCegarLoop]: 1533 mSDtfsCounter, 19492 mSDsluCounter, 6890 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19492 SdHoareTripleChecker+Valid, 8423 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:54,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19492 Valid, 8423 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:12:54,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44438 states. [2025-03-03 16:12:55,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44438 to 43846. [2025-03-03 16:12:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43846 states, 43844 states have (on average 1.3059483623756956) internal successors, (57258), 43845 states have internal predecessors, (57258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:55,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43846 states to 43846 states and 57258 transitions. [2025-03-03 16:12:55,580 INFO L78 Accepts]: Start accepts. Automaton has 43846 states and 57258 transitions. Word has length 104 [2025-03-03 16:12:55,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:55,580 INFO L471 AbstractCegarLoop]: Abstraction has 43846 states and 57258 transitions. [2025-03-03 16:12:55,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 11.2) internal successors, (280), 24 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:55,580 INFO L276 IsEmpty]: Start isEmpty. Operand 43846 states and 57258 transitions. [2025-03-03 16:12:55,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 16:12:55,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:55,583 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:12:55,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 16:12:55,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-03 16:12:55,787 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:55,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:55,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1654367365, now seen corresponding path program 1 times [2025-03-03 16:12:55,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:55,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323708] [2025-03-03 16:12:55,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:55,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:55,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 16:12:55,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 16:12:55,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:55,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:56,219 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:56,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:56,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323708] [2025-03-03 16:12:56,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323708] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:12:56,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103544410] [2025-03-03 16:12:56,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:56,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:12:56,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:12:56,222 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:12:56,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 16:12:56,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 16:12:56,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 16:12:56,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:56,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:56,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 16:12:56,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:12:56,738 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:56,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:12:57,268 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:57,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103544410] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:12:57,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:12:57,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2025-03-03 16:12:57,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486435557] [2025-03-03 16:12:57,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:12:57,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 16:12:57,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:57,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 16:12:57,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2025-03-03 16:12:57,270 INFO L87 Difference]: Start difference. First operand 43846 states and 57258 transitions. Second operand has 28 states, 28 states have (on average 9.892857142857142) internal successors, (277), 27 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:02,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:02,066 INFO L93 Difference]: Finished difference Result 212202 states and 274921 transitions. [2025-03-03 16:13:02,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-03 16:13:02,066 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.892857142857142) internal successors, (277), 27 states have internal predecessors, (277), 0 states have call successors, (0), 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 105 [2025-03-03 16:13:02,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:02,264 INFO L225 Difference]: With dead ends: 212202 [2025-03-03 16:13:02,264 INFO L226 Difference]: Without dead ends: 172074 [2025-03-03 16:13:02,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=714, Invalid=2708, Unknown=0, NotChecked=0, Total=3422 [2025-03-03 16:13:02,297 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 12951 mSDsluCounter, 8425 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12951 SdHoareTripleChecker+Valid, 9974 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:13:02,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12951 Valid, 9974 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1332 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:13:02,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172074 states. [2025-03-03 16:13:07,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172074 to 170590. [2025-03-03 16:13:07,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170590 states, 170588 states have (on average 1.27482003423453) internal successors, (217469), 170589 states have internal predecessors, (217469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:07,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170590 states to 170590 states and 217469 transitions. [2025-03-03 16:13:07,969 INFO L78 Accepts]: Start accepts. Automaton has 170590 states and 217469 transitions. Word has length 105 [2025-03-03 16:13:07,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:07,969 INFO L471 AbstractCegarLoop]: Abstraction has 170590 states and 217469 transitions. [2025-03-03 16:13:07,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.892857142857142) internal successors, (277), 27 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:07,970 INFO L276 IsEmpty]: Start isEmpty. Operand 170590 states and 217469 transitions. [2025-03-03 16:13:07,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 16:13:07,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:07,974 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:13:07,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 16:13:08,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:13:08,175 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:08,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:08,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1726057952, now seen corresponding path program 1 times [2025-03-03 16:13:08,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:08,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170558946] [2025-03-03 16:13:08,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:08,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:08,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 16:13:08,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 16:13:08,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:08,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:08,365 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:13:08,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:08,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170558946] [2025-03-03 16:13:08,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170558946] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:13:08,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354634501] [2025-03-03 16:13:08,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:08,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:13:08,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:13:08,367 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:13:08,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 16:13:08,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 16:13:08,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 16:13:08,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:08,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:08,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:13:08,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:13:08,841 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:13:08,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:13:09,687 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:13:09,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354634501] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:13:09,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:13:09,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-03-03 16:13:09,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117742636] [2025-03-03 16:13:09,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:13:09,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 16:13:09,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:09,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 16:13:09,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-03-03 16:13:09,689 INFO L87 Difference]: Start difference. First operand 170590 states and 217469 transitions. Second operand has 26 states, 26 states have (on average 11.538461538461538) internal successors, (300), 25 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:15,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:15,422 INFO L93 Difference]: Finished difference Result 377392 states and 481156 transitions. [2025-03-03 16:13:15,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 16:13:15,422 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 11.538461538461538) internal successors, (300), 25 states have internal predecessors, (300), 0 states have call successors, (0), 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 106 [2025-03-03 16:13:15,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:15,706 INFO L225 Difference]: With dead ends: 377392 [2025-03-03 16:13:15,706 INFO L226 Difference]: Without dead ends: 211446 [2025-03-03 16:13:15,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=499, Invalid=1853, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 16:13:15,768 INFO L435 NwaCegarLoop]: 1537 mSDtfsCounter, 15820 mSDsluCounter, 6753 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15820 SdHoareTripleChecker+Valid, 8290 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:13:15,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15820 Valid, 8290 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:13:15,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211446 states. [2025-03-03 16:13:19,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211446 to 107590. [2025-03-03 16:13:19,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107590 states, 107588 states have (on average 1.2652991039892925) internal successors, (136131), 107589 states have internal predecessors, (136131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:19,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107590 states to 107590 states and 136131 transitions. [2025-03-03 16:13:19,831 INFO L78 Accepts]: Start accepts. Automaton has 107590 states and 136131 transitions. Word has length 106 [2025-03-03 16:13:19,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:19,831 INFO L471 AbstractCegarLoop]: Abstraction has 107590 states and 136131 transitions. [2025-03-03 16:13:19,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 11.538461538461538) internal successors, (300), 25 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:19,831 INFO L276 IsEmpty]: Start isEmpty. Operand 107590 states and 136131 transitions. [2025-03-03 16:13:19,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 16:13:19,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:19,834 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:13:19,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 16:13:20,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-03 16:13:20,035 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:20,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:20,035 INFO L85 PathProgramCache]: Analyzing trace with hash 2065851855, now seen corresponding path program 1 times [2025-03-03 16:13:20,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:20,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263826167] [2025-03-03 16:13:20,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:20,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:20,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 16:13:20,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 16:13:20,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:20,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:20,785 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:13:20,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:20,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263826167] [2025-03-03 16:13:20,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263826167] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:13:20,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026387682] [2025-03-03 16:13:20,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:20,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:13:20,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:13:20,788 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:13:20,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 16:13:20,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 16:13:20,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 16:13:20,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:20,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:20,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:13:20,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:13:21,243 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:13:21,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:13:21,911 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:13:21,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026387682] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:13:21,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:13:21,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-03-03 16:13:21,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330558485] [2025-03-03 16:13:21,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:13:21,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 16:13:21,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:21,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 16:13:21,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2025-03-03 16:13:21,913 INFO L87 Difference]: Start difference. First operand 107590 states and 136131 transitions. Second operand has 28 states, 28 states have (on average 9.714285714285714) internal successors, (272), 27 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)