./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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.5.ufo.UNBOUNDED.pals+Problem12_label01.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 c3556d84b743029397591123c4f713fb54c922b0817fe8965ed5070f16a3f39a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:21:14,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:21:14,577 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:21:14,581 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:21:14,581 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:21:14,593 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:21:14,594 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:21:14,594 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:21:14,594 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:21:14,594 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:21:14,594 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:21:14,595 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:21:14,595 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:21:14,595 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:21:14,595 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:21:14,595 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:21:14,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:21:14,595 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:21:14,595 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:21:14,595 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:21:14,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:21:14,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:21:14,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:21:14,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:21:14,596 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:21:14,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:21:14,596 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:21:14,596 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:21:14,596 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:21:14,596 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:21:14,596 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:21:14,596 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:21:14,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:21:14,596 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:21:14,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:21:14,596 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:21:14,596 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:21:14,596 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:21:14,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:21:14,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:21:14,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:21:14,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:21:14,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:21:14,597 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 -> c3556d84b743029397591123c4f713fb54c922b0817fe8965ed5070f16a3f39a [2025-03-08 07:21:14,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:21:14,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:21:14,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:21:14,807 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:21:14,807 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:21:14,808 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-03-08 07:21:15,906 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d556f6761/650a92ca4b3540d9828d9e442657df36/FLAGd86a9335f [2025-03-08 07:21:16,351 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:21:16,352 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-03-08 07:21:16,378 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d556f6761/650a92ca4b3540d9828d9e442657df36/FLAGd86a9335f [2025-03-08 07:21:16,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d556f6761/650a92ca4b3540d9828d9e442657df36 [2025-03-08 07:21:16,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:21:16,477 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:21:16,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:21:16,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:21:16,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:21:16,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:21:16" (1/1) ... [2025-03-08 07:21:16,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@154be36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:21:16, skipping insertion in model container [2025-03-08 07:21:16,481 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:21:16" (1/1) ... [2025-03-08 07:21:16,557 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:21:16,844 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.5.ufo.UNBOUNDED.pals+Problem12_label01.c[11668,11681] [2025-03-08 07:21:16,887 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.5.ufo.UNBOUNDED.pals+Problem12_label01.c[17223,17236] [2025-03-08 07:21:17,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:21:17,287 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:21:17,309 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.5.ufo.UNBOUNDED.pals+Problem12_label01.c[11668,11681] [2025-03-08 07:21:17,314 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.5.ufo.UNBOUNDED.pals+Problem12_label01.c[17223,17236] [2025-03-08 07:21:17,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:21:17,556 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:21:17,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:21:17 WrapperNode [2025-03-08 07:21:17,557 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:21:17,558 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:21:17,558 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:21:17,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:21:17,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:21:17" (1/1) ... [2025-03-08 07:21:17,604 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:21:17" (1/1) ... [2025-03-08 07:21:17,846 INFO L138 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5091 [2025-03-08 07:21:17,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:21:17,847 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:21:17,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:21:17,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:21:17,855 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:21:17" (1/1) ... [2025-03-08 07:21:17,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:21:17" (1/1) ... [2025-03-08 07:21:17,884 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:21:17" (1/1) ... [2025-03-08 07:21:17,981 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-08 07:21:17,981 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:21:17" (1/1) ... [2025-03-08 07:21:17,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:21:17" (1/1) ... [2025-03-08 07:21:18,119 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:21:17" (1/1) ... [2025-03-08 07:21:18,131 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:21:17" (1/1) ... [2025-03-08 07:21:18,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:21:17" (1/1) ... [2025-03-08 07:21:18,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:21:17" (1/1) ... [2025-03-08 07:21:18,182 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:21:18,183 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:21:18,183 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:21:18,183 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:21:18,184 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:21:17" (1/1) ... [2025-03-08 07:21:18,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:21:18,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:21:18,208 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-08 07:21:18,210 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-08 07:21:18,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:21:18,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:21:18,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:21:18,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:21:18,306 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:21:18,307 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:21:21,541 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2129: havoc calculate_output_#t~ret37#1; [2025-03-08 07:21:21,541 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3608: havoc calculate_output2_#t~ret38#1; [2025-03-08 07:21:21,541 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5098: havoc calculate_output3_#t~ret39#1; [2025-03-08 07:21:21,682 INFO L? ?]: Removed 744 outVars from TransFormulas that were not future-live. [2025-03-08 07:21:21,682 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:21:21,713 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:21:21,716 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:21:21,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:21:21 BoogieIcfgContainer [2025-03-08 07:21:21,717 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:21:21,719 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:21:21,719 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:21:21,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:21:21,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:21:16" (1/3) ... [2025-03-08 07:21:21,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b13c3df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:21:21, skipping insertion in model container [2025-03-08 07:21:21,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:21:17" (2/3) ... [2025-03-08 07:21:21,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b13c3df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:21:21, skipping insertion in model container [2025-03-08 07:21:21,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:21:21" (3/3) ... [2025-03-08 07:21:21,725 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-03-08 07:21:21,739 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:21:21,742 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.c that has 1 procedures, 900 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-08 07:21:21,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:21:21,820 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;@7e8bd609, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:21:21,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:21:21,826 INFO L276 IsEmpty]: Start isEmpty. Operand has 900 states, 897 states have (on average 1.9030100334448161) internal successors, (1707), 899 states have internal predecessors, (1707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:21,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 07:21:21,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:21:21,831 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] [2025-03-08 07:21:21,832 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:21:21,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:21:21,836 INFO L85 PathProgramCache]: Analyzing trace with hash -29917392, now seen corresponding path program 1 times [2025-03-08 07:21:21,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:21:21,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611124176] [2025-03-08 07:21:21,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:21,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:21:21,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 07:21:21,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 07:21:21,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:21,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:22,038 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-08 07:21:22,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:21:22,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611124176] [2025-03-08 07:21:22,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611124176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:21:22,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:21:22,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 07:21:22,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228125480] [2025-03-08 07:21:22,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:21:22,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 07:21:22,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:21:22,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 07:21:22,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 07:21:22,058 INFO L87 Difference]: Start difference. First operand has 900 states, 897 states have (on average 1.9030100334448161) internal successors, (1707), 899 states have internal predecessors, (1707), 0 states have call successors, (0), 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 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:22,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:21:22,114 INFO L93 Difference]: Finished difference Result 1762 states and 3343 transitions. [2025-03-08 07:21:22,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 07:21:22,116 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-03-08 07:21:22,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:21:22,128 INFO L225 Difference]: With dead ends: 1762 [2025-03-08 07:21:22,128 INFO L226 Difference]: Without dead ends: 835 [2025-03-08 07:21:22,132 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-08 07:21:22,134 INFO L435 NwaCegarLoop]: 1641 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, 1641 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-08 07:21:22,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1641 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:21:22,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-03-08 07:21:22,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 835. [2025-03-08 07:21:22,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 833 states have (on average 1.893157262905162) internal successors, (1577), 834 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:22,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1577 transitions. [2025-03-08 07:21:22,209 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1577 transitions. Word has length 24 [2025-03-08 07:21:22,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:21:22,210 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1577 transitions. [2025-03-08 07:21:22,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:22,211 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1577 transitions. [2025-03-08 07:21:22,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 07:21:22,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:21:22,212 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] [2025-03-08 07:21:22,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:21:22,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:21:22,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:21:22,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1026989745, now seen corresponding path program 1 times [2025-03-08 07:21:22,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:21:22,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371529872] [2025-03-08 07:21:22,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:22,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:21:22,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 07:21:22,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 07:21:22,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:22,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:22,469 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-08 07:21:22,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:21:22,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371529872] [2025-03-08 07:21:22,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371529872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:21:22,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:21:22,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:21:22,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055174551] [2025-03-08 07:21:22,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:21:22,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:21:22,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:21:22,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:21:22,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:21:22,471 INFO L87 Difference]: Start difference. First operand 835 states and 1577 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:22,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:21:22,569 INFO L93 Difference]: Finished difference Result 883 states and 1651 transitions. [2025-03-08 07:21:22,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:21:22,570 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-03-08 07:21:22,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:21:22,573 INFO L225 Difference]: With dead ends: 883 [2025-03-08 07:21:22,573 INFO L226 Difference]: Without dead ends: 835 [2025-03-08 07:21:22,573 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-08 07:21:22,574 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 0 mSDsluCounter, 4689 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6264 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:21:22,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6264 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:21:22,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-03-08 07:21:22,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 835. [2025-03-08 07:21:22,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 833 states have (on average 1.8559423769507803) internal successors, (1546), 834 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:22,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1546 transitions. [2025-03-08 07:21:22,591 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1546 transitions. Word has length 24 [2025-03-08 07:21:22,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:21:22,592 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1546 transitions. [2025-03-08 07:21:22,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:22,592 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1546 transitions. [2025-03-08 07:21:22,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 07:21:22,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:21:22,593 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] [2025-03-08 07:21:22,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:21:22,593 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:21:22,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:21:22,594 INFO L85 PathProgramCache]: Analyzing trace with hash -807431780, now seen corresponding path program 1 times [2025-03-08 07:21:22,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:21:22,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170845305] [2025-03-08 07:21:22,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:22,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:21:22,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 07:21:22,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 07:21:22,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:22,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:22,773 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-08 07:21:22,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:21:22,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170845305] [2025-03-08 07:21:22,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170845305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:21:22,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:21:22,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:21:22,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649953514] [2025-03-08 07:21:22,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:21:22,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:21:22,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:21:22,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:21:22,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:21:22,774 INFO L87 Difference]: Start difference. First operand 835 states and 1546 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:27,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:21:27,429 INFO L93 Difference]: Finished difference Result 3090 states and 5855 transitions. [2025-03-08 07:21:27,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:21:27,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-03-08 07:21:27,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:21:27,438 INFO L225 Difference]: With dead ends: 3090 [2025-03-08 07:21:27,438 INFO L226 Difference]: Without dead ends: 2337 [2025-03-08 07:21:27,439 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-08 07:21:27,442 INFO L435 NwaCegarLoop]: 782 mSDtfsCounter, 2431 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2431 SdHoareTripleChecker+Valid, 800 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.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:21:27,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2431 Valid, 800 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-08 07:21:27,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2025-03-08 07:21:27,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2337. [2025-03-08 07:21:27,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2337 states, 2335 states have (on average 1.5674518201284797) internal successors, (3660), 2336 states have internal predecessors, (3660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:27,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 3660 transitions. [2025-03-08 07:21:27,482 INFO L78 Accepts]: Start accepts. Automaton has 2337 states and 3660 transitions. Word has length 48 [2025-03-08 07:21:27,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:21:27,482 INFO L471 AbstractCegarLoop]: Abstraction has 2337 states and 3660 transitions. [2025-03-08 07:21:27,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:27,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 3660 transitions. [2025-03-08 07:21:27,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 07:21:27,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:21:27,483 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] [2025-03-08 07:21:27,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:21:27,483 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:21:27,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:21:27,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1149039, now seen corresponding path program 1 times [2025-03-08 07:21:27,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:21:27,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88987185] [2025-03-08 07:21:27,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:27,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:21:27,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 07:21:27,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 07:21:27,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:27,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:27,633 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-08 07:21:27,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:21:27,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88987185] [2025-03-08 07:21:27,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88987185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:21:27,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:21:27,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:21:27,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315470359] [2025-03-08 07:21:27,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:21:27,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:21:27,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:21:27,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:21:27,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:21:27,635 INFO L87 Difference]: Start difference. First operand 2337 states and 3660 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:27,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:21:27,792 INFO L93 Difference]: Finished difference Result 2777 states and 4360 transitions. [2025-03-08 07:21:27,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 07:21:27,793 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-03-08 07:21:27,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:21:27,801 INFO L225 Difference]: With dead ends: 2777 [2025-03-08 07:21:27,801 INFO L226 Difference]: Without dead ends: 2733 [2025-03-08 07:21:27,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-08 07:21:27,803 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 7979 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7979 SdHoareTripleChecker+Valid, 2696 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:21:27,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7979 Valid, 2696 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:21:27,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2025-03-08 07:21:27,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 2379. [2025-03-08 07:21:27,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2379 states, 2377 states have (on average 1.5679427850231384) internal successors, (3727), 2378 states have internal predecessors, (3727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:27,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 3727 transitions. [2025-03-08 07:21:27,845 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 3727 transitions. Word has length 54 [2025-03-08 07:21:27,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:21:27,846 INFO L471 AbstractCegarLoop]: Abstraction has 2379 states and 3727 transitions. [2025-03-08 07:21:27,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:27,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3727 transitions. [2025-03-08 07:21:27,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 07:21:27,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:21:27,847 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] [2025-03-08 07:21:27,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:21:27,847 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:21:27,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:21:27,848 INFO L85 PathProgramCache]: Analyzing trace with hash 16126764, now seen corresponding path program 1 times [2025-03-08 07:21:27,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:21:27,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316501311] [2025-03-08 07:21:27,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:27,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:21:27,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 07:21:27,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 07:21:27,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:27,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:27,911 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-08 07:21:27,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:21:27,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316501311] [2025-03-08 07:21:27,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316501311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:21:27,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:21:27,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:21:27,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879332884] [2025-03-08 07:21:27,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:21:27,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:21:27,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:21:27,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:21:27,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:21:27,913 INFO L87 Difference]: Start difference. First operand 2379 states and 3727 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:27,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:21:27,941 INFO L93 Difference]: Finished difference Result 2540 states and 3982 transitions. [2025-03-08 07:21:27,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:21:27,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-08 07:21:27,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:21:27,948 INFO L225 Difference]: With dead ends: 2540 [2025-03-08 07:21:27,948 INFO L226 Difference]: Without dead ends: 2454 [2025-03-08 07:21:27,949 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-08 07:21:27,950 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 1484 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1605 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-08 07:21:27,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1605 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:21:27,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2454 states. [2025-03-08 07:21:27,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2454 to 2450. [2025-03-08 07:21:27,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2450 states, 2448 states have (on average 1.5674019607843137) internal successors, (3837), 2449 states have internal predecessors, (3837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:27,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 3837 transitions. [2025-03-08 07:21:27,984 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 3837 transitions. Word has length 56 [2025-03-08 07:21:27,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:21:27,984 INFO L471 AbstractCegarLoop]: Abstraction has 2450 states and 3837 transitions. [2025-03-08 07:21:27,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:27,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 3837 transitions. [2025-03-08 07:21:27,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 07:21:27,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:21:27,985 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] [2025-03-08 07:21:27,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:21:27,986 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:21:27,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:21:27,986 INFO L85 PathProgramCache]: Analyzing trace with hash 48449999, now seen corresponding path program 1 times [2025-03-08 07:21:27,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:21:27,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518344551] [2025-03-08 07:21:27,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:27,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:21:27,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 07:21:28,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 07:21:28,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:28,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:28,232 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-08 07:21:28,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:21:28,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518344551] [2025-03-08 07:21:28,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518344551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:21:28,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:21:28,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:21:28,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574786950] [2025-03-08 07:21:28,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:21:28,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:21:28,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:21:28,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:21:28,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:21:28,235 INFO L87 Difference]: Start difference. First operand 2450 states and 3837 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:28,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:21:28,363 INFO L93 Difference]: Finished difference Result 2609 states and 4085 transitions. [2025-03-08 07:21:28,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 07:21:28,364 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-08 07:21:28,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:21:28,370 INFO L225 Difference]: With dead ends: 2609 [2025-03-08 07:21:28,370 INFO L226 Difference]: Without dead ends: 2452 [2025-03-08 07:21:28,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:21:28,372 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 3000 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3000 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:21:28,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3000 Valid, 1811 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:21:28,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2025-03-08 07:21:28,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 2450. [2025-03-08 07:21:28,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2450 states, 2448 states have (on average 1.5665849673202614) internal successors, (3835), 2449 states have internal predecessors, (3835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:28,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 3835 transitions. [2025-03-08 07:21:28,430 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 3835 transitions. Word has length 56 [2025-03-08 07:21:28,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:21:28,431 INFO L471 AbstractCegarLoop]: Abstraction has 2450 states and 3835 transitions. [2025-03-08 07:21:28,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:28,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 3835 transitions. [2025-03-08 07:21:28,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 07:21:28,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:21:28,432 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] [2025-03-08 07:21:28,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:21:28,432 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:21:28,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:21:28,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1532487703, now seen corresponding path program 1 times [2025-03-08 07:21:28,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:21:28,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710058072] [2025-03-08 07:21:28,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:28,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:21:28,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 07:21:28,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 07:21:28,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:28,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:28,615 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-08 07:21:28,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:21:28,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710058072] [2025-03-08 07:21:28,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710058072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:21:28,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:21:28,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:21:28,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116910352] [2025-03-08 07:21:28,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:21:28,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:21:28,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:21:28,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:21:28,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:21:28,617 INFO L87 Difference]: Start difference. First operand 2450 states and 3835 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:28,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:21:28,665 INFO L93 Difference]: Finished difference Result 2458 states and 3844 transitions. [2025-03-08 07:21:28,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 07:21:28,666 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-08 07:21:28,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:21:28,672 INFO L225 Difference]: With dead ends: 2458 [2025-03-08 07:21:28,673 INFO L226 Difference]: Without dead ends: 2456 [2025-03-08 07:21:28,673 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-08 07:21:28,674 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 0 mSDsluCounter, 9227 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10767 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-08 07:21:28,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10767 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:21:28,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2456 states. [2025-03-08 07:21:28,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2456 to 2456. [2025-03-08 07:21:28,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2456 states, 2454 states have (on average 1.56479217603912) internal successors, (3840), 2455 states have internal predecessors, (3840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:28,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2456 states to 2456 states and 3840 transitions. [2025-03-08 07:21:28,711 INFO L78 Accepts]: Start accepts. Automaton has 2456 states and 3840 transitions. Word has length 57 [2025-03-08 07:21:28,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:21:28,712 INFO L471 AbstractCegarLoop]: Abstraction has 2456 states and 3840 transitions. [2025-03-08 07:21:28,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:28,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2456 states and 3840 transitions. [2025-03-08 07:21:28,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 07:21:28,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:21:28,713 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] [2025-03-08 07:21:28,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:21:28,714 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:21:28,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:21:28,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1331006163, now seen corresponding path program 1 times [2025-03-08 07:21:28,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:21:28,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825009883] [2025-03-08 07:21:28,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:28,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:21:28,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 07:21:28,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 07:21:28,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:28,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:28,758 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-08 07:21:28,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:21:28,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825009883] [2025-03-08 07:21:28,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825009883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:21:28,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:21:28,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:21:28,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985380107] [2025-03-08 07:21:28,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:21:28,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:21:28,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:21:28,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:21:28,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:21:28,760 INFO L87 Difference]: Start difference. First operand 2456 states and 3840 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:28,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:21:28,780 INFO L93 Difference]: Finished difference Result 2766 states and 4312 transitions. [2025-03-08 07:21:28,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:21:28,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-08 07:21:28,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:21:28,787 INFO L225 Difference]: With dead ends: 2766 [2025-03-08 07:21:28,787 INFO L226 Difference]: Without dead ends: 2603 [2025-03-08 07:21:28,788 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-08 07:21:28,788 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 1497 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 1668 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-08 07:21:28,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1497 Valid, 1668 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:21:28,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2025-03-08 07:21:28,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 2601. [2025-03-08 07:21:28,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2601 states, 2599 states have (on average 1.5609849942285494) internal successors, (4057), 2600 states have internal predecessors, (4057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:28,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2601 states to 2601 states and 4057 transitions. [2025-03-08 07:21:28,826 INFO L78 Accepts]: Start accepts. Automaton has 2601 states and 4057 transitions. Word has length 58 [2025-03-08 07:21:28,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:21:28,826 INFO L471 AbstractCegarLoop]: Abstraction has 2601 states and 4057 transitions. [2025-03-08 07:21:28,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:28,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2601 states and 4057 transitions. [2025-03-08 07:21:28,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 07:21:28,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:21:28,827 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] [2025-03-08 07:21:28,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:21:28,827 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:21:28,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:21:28,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1778951699, now seen corresponding path program 1 times [2025-03-08 07:21:28,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:21:28,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930111916] [2025-03-08 07:21:28,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:28,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:21:28,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 07:21:28,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 07:21:28,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:28,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:28,879 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-08 07:21:28,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:21:28,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930111916] [2025-03-08 07:21:28,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930111916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:21:28,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:21:28,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:21:28,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011941812] [2025-03-08 07:21:28,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:21:28,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:21:28,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:21:28,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:21:28,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:21:28,881 INFO L87 Difference]: Start difference. First operand 2601 states and 4057 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:28,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:21:28,903 INFO L93 Difference]: Finished difference Result 3185 states and 4935 transitions. [2025-03-08 07:21:28,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:21:28,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-08 07:21:28,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:21:28,910 INFO L225 Difference]: With dead ends: 3185 [2025-03-08 07:21:28,910 INFO L226 Difference]: Without dead ends: 2877 [2025-03-08 07:21:28,911 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-08 07:21:28,913 INFO L435 NwaCegarLoop]: 1591 mSDtfsCounter, 1495 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 1670 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-08 07:21:28,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 1670 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:21:28,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2025-03-08 07:21:28,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 2875. [2025-03-08 07:21:28,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2875 states, 2873 states have (on average 1.5520361990950227) internal successors, (4459), 2874 states have internal predecessors, (4459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:28,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2875 states and 4459 transitions. [2025-03-08 07:21:28,954 INFO L78 Accepts]: Start accepts. Automaton has 2875 states and 4459 transitions. Word has length 58 [2025-03-08 07:21:28,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:21:28,954 INFO L471 AbstractCegarLoop]: Abstraction has 2875 states and 4459 transitions. [2025-03-08 07:21:28,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:28,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 4459 transitions. [2025-03-08 07:21:28,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 07:21:28,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:21:28,955 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] [2025-03-08 07:21:28,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:21:28,955 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:21:28,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:21:28,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1363775827, now seen corresponding path program 1 times [2025-03-08 07:21:28,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:21:28,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444272097] [2025-03-08 07:21:28,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:28,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:21:28,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 07:21:28,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 07:21:28,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:28,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:28,994 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-08 07:21:28,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:21:28,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444272097] [2025-03-08 07:21:28,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444272097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:21:28,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:21:28,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:21:28,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012656271] [2025-03-08 07:21:28,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:21:28,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:21:28,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:21:28,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:21:28,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:21:28,996 INFO L87 Difference]: Start difference. First operand 2875 states and 4459 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:29,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:21:29,023 INFO L93 Difference]: Finished difference Result 3975 states and 6085 transitions. [2025-03-08 07:21:29,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:21:29,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-08 07:21:29,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:21:29,031 INFO L225 Difference]: With dead ends: 3975 [2025-03-08 07:21:29,031 INFO L226 Difference]: Without dead ends: 3393 [2025-03-08 07:21:29,032 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-08 07:21:29,033 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 1493 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 1672 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-08 07:21:29,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 1672 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:21:29,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3393 states. [2025-03-08 07:21:29,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3393 to 3391. [2025-03-08 07:21:29,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3391 states, 3389 states have (on average 1.534080849808203) internal successors, (5199), 3390 states have internal predecessors, (5199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:29,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3391 states to 3391 states and 5199 transitions. [2025-03-08 07:21:29,083 INFO L78 Accepts]: Start accepts. Automaton has 3391 states and 5199 transitions. Word has length 58 [2025-03-08 07:21:29,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:21:29,084 INFO L471 AbstractCegarLoop]: Abstraction has 3391 states and 5199 transitions. [2025-03-08 07:21:29,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:29,084 INFO L276 IsEmpty]: Start isEmpty. Operand 3391 states and 5199 transitions. [2025-03-08 07:21:29,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 07:21:29,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:21:29,085 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] [2025-03-08 07:21:29,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:21:29,085 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:21:29,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:21:29,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1850494099, now seen corresponding path program 1 times [2025-03-08 07:21:29,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:21:29,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2741292] [2025-03-08 07:21:29,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:29,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:21:29,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 07:21:29,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 07:21:29,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:29,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:29,123 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-08 07:21:29,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:21:29,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2741292] [2025-03-08 07:21:29,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2741292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:21:29,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:21:29,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:21:29,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727943098] [2025-03-08 07:21:29,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:21:29,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:21:29,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:21:29,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:21:29,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:21:29,125 INFO L87 Difference]: Start difference. First operand 3391 states and 5199 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:29,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:21:29,166 INFO L93 Difference]: Finished difference Result 5459 states and 8193 transitions. [2025-03-08 07:21:29,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:21:29,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-08 07:21:29,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:21:29,187 INFO L225 Difference]: With dead ends: 5459 [2025-03-08 07:21:29,187 INFO L226 Difference]: Without dead ends: 4361 [2025-03-08 07:21:29,192 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-08 07:21:29,192 INFO L435 NwaCegarLoop]: 1587 mSDtfsCounter, 1491 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 1674 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-08 07:21:29,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 1674 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:21:29,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4361 states. [2025-03-08 07:21:29,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4361 to 4359. [2025-03-08 07:21:29,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4359 states, 4357 states have (on average 1.5035574936883176) internal successors, (6551), 4358 states have internal predecessors, (6551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4359 states to 4359 states and 6551 transitions. [2025-03-08 07:21:29,278 INFO L78 Accepts]: Start accepts. Automaton has 4359 states and 6551 transitions. Word has length 58 [2025-03-08 07:21:29,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:21:29,278 INFO L471 AbstractCegarLoop]: Abstraction has 4359 states and 6551 transitions. [2025-03-08 07:21:29,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:29,279 INFO L276 IsEmpty]: Start isEmpty. Operand 4359 states and 6551 transitions. [2025-03-08 07:21:29,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 07:21:29,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:21:29,281 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] [2025-03-08 07:21:29,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:21:29,281 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:21:29,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:21:29,281 INFO L85 PathProgramCache]: Analyzing trace with hash 291030893, now seen corresponding path program 1 times [2025-03-08 07:21:29,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:21:29,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407907904] [2025-03-08 07:21:29,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:29,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:21:29,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 07:21:29,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 07:21:29,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:29,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:29,320 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-08 07:21:29,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:21:29,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407907904] [2025-03-08 07:21:29,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407907904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:21:29,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:21:29,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:21:29,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910519062] [2025-03-08 07:21:29,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:21:29,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:21:29,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:21:29,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:21:29,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:21:29,323 INFO L87 Difference]: Start difference. First operand 4359 states and 6551 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:29,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:21:29,404 INFO L93 Difference]: Finished difference Result 6542 states and 9725 transitions. [2025-03-08 07:21:29,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:21:29,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-08 07:21:29,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:21:29,415 INFO L225 Difference]: With dead ends: 6542 [2025-03-08 07:21:29,416 INFO L226 Difference]: Without dead ends: 5355 [2025-03-08 07:21:29,418 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-08 07:21:29,418 INFO L435 NwaCegarLoop]: 1598 mSDtfsCounter, 1496 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1669 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-08 07:21:29,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1669 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:21:29,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5355 states. [2025-03-08 07:21:29,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5355 to 5353. [2025-03-08 07:21:29,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5353 states, 5351 states have (on average 1.4847692020183143) internal successors, (7945), 5352 states have internal predecessors, (7945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:29,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5353 states to 5353 states and 7945 transitions. [2025-03-08 07:21:29,501 INFO L78 Accepts]: Start accepts. Automaton has 5353 states and 7945 transitions. Word has length 60 [2025-03-08 07:21:29,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:21:29,501 INFO L471 AbstractCegarLoop]: Abstraction has 5353 states and 7945 transitions. [2025-03-08 07:21:29,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:29,502 INFO L276 IsEmpty]: Start isEmpty. Operand 5353 states and 7945 transitions. [2025-03-08 07:21:29,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 07:21:29,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:21:29,505 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] [2025-03-08 07:21:29,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:21:29,506 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:21:29,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:21:29,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1155468229, now seen corresponding path program 1 times [2025-03-08 07:21:29,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:21:29,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732768783] [2025-03-08 07:21:29,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:29,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:21:29,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 07:21:29,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 07:21:29,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:29,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:29,628 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 07:21:29,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:21:29,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732768783] [2025-03-08 07:21:29,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732768783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:21:29,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:21:29,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:21:29,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62039856] [2025-03-08 07:21:29,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:21:29,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:21:29,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:21:29,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:21:29,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:21:29,630 INFO L87 Difference]: Start difference. First operand 5353 states and 7945 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:29,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:21:29,877 INFO L93 Difference]: Finished difference Result 21301 states and 30607 transitions. [2025-03-08 07:21:29,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 07:21:29,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 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 77 [2025-03-08 07:21:29,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:21:29,907 INFO L225 Difference]: With dead ends: 21301 [2025-03-08 07:21:29,907 INFO L226 Difference]: Without dead ends: 18243 [2025-03-08 07:21:29,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 07:21:29,915 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 6332 mSDsluCounter, 2023 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6332 SdHoareTripleChecker+Valid, 3636 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:21:29,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6332 Valid, 3636 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:21:29,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18243 states. [2025-03-08 07:21:30,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18243 to 8409. [2025-03-08 07:21:30,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8409 states, 8407 states have (on average 1.4570001189484953) internal successors, (12249), 8408 states have internal predecessors, (12249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:30,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8409 states to 8409 states and 12249 transitions. [2025-03-08 07:21:30,161 INFO L78 Accepts]: Start accepts. Automaton has 8409 states and 12249 transitions. Word has length 77 [2025-03-08 07:21:30,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:21:30,162 INFO L471 AbstractCegarLoop]: Abstraction has 8409 states and 12249 transitions. [2025-03-08 07:21:30,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:30,162 INFO L276 IsEmpty]: Start isEmpty. Operand 8409 states and 12249 transitions. [2025-03-08 07:21:30,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 07:21:30,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:21:30,164 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] [2025-03-08 07:21:30,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:21:30,164 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:21:30,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:21:30,164 INFO L85 PathProgramCache]: Analyzing trace with hash 707522693, now seen corresponding path program 1 times [2025-03-08 07:21:30,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:21:30,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405416970] [2025-03-08 07:21:30,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:30,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:21:30,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 07:21:30,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 07:21:30,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:30,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:30,276 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 07:21:30,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:21:30,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405416970] [2025-03-08 07:21:30,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405416970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:21:30,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:21:30,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:21:30,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704822700] [2025-03-08 07:21:30,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:21:30,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:21:30,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:21:30,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:21:30,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:21:30,278 INFO L87 Difference]: Start difference. First operand 8409 states and 12249 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:30,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:21:30,562 INFO L93 Difference]: Finished difference Result 24357 states and 34911 transitions. [2025-03-08 07:21:30,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 07:21:30,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 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 77 [2025-03-08 07:21:30,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:21:30,596 INFO L225 Difference]: With dead ends: 24357 [2025-03-08 07:21:30,596 INFO L226 Difference]: Without dead ends: 21299 [2025-03-08 07:21:30,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 07:21:30,606 INFO L435 NwaCegarLoop]: 1610 mSDtfsCounter, 6357 mSDsluCounter, 1957 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6357 SdHoareTripleChecker+Valid, 3567 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:21:30,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6357 Valid, 3567 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:21:30,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21299 states. [2025-03-08 07:21:30,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21299 to 13001. [2025-03-08 07:21:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13001 states, 12999 states have (on average 1.4358796830525424) internal successors, (18665), 13000 states have internal predecessors, (18665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:30,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13001 states to 13001 states and 18665 transitions. [2025-03-08 07:21:30,991 INFO L78 Accepts]: Start accepts. Automaton has 13001 states and 18665 transitions. Word has length 77 [2025-03-08 07:21:30,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:21:30,991 INFO L471 AbstractCegarLoop]: Abstraction has 13001 states and 18665 transitions. [2025-03-08 07:21:30,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:30,992 INFO L276 IsEmpty]: Start isEmpty. Operand 13001 states and 18665 transitions. [2025-03-08 07:21:30,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 07:21:30,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:21:30,994 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] [2025-03-08 07:21:30,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 07:21:30,994 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:21:30,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:21:30,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1122698565, now seen corresponding path program 1 times [2025-03-08 07:21:30,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:21:30,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698508721] [2025-03-08 07:21:30,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:30,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:21:31,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 07:21:31,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 07:21:31,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:31,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:31,133 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 07:21:31,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:21:31,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698508721] [2025-03-08 07:21:31,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698508721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:21:31,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:21:31,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:21:31,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415070970] [2025-03-08 07:21:31,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:21:31,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:21:31,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:21:31,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:21:31,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:21:31,134 INFO L87 Difference]: Start difference. First operand 13001 states and 18665 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:31,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:21:31,487 INFO L93 Difference]: Finished difference Result 27413 states and 39215 transitions. [2025-03-08 07:21:31,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 07:21:31,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 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 77 [2025-03-08 07:21:31,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:21:31,527 INFO L225 Difference]: With dead ends: 27413 [2025-03-08 07:21:31,527 INFO L226 Difference]: Without dead ends: 24355 [2025-03-08 07:21:31,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 07:21:31,538 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 6398 mSDsluCounter, 1952 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6398 SdHoareTripleChecker+Valid, 3559 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:21:31,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6398 Valid, 3559 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:21:31,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24355 states. [2025-03-08 07:21:31,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24355 to 16057. [2025-03-08 07:21:31,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16057 states, 16055 states have (on average 1.43064465898474) internal successors, (22969), 16056 states have internal predecessors, (22969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:31,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16057 states to 16057 states and 22969 transitions. [2025-03-08 07:21:31,898 INFO L78 Accepts]: Start accepts. Automaton has 16057 states and 22969 transitions. Word has length 77 [2025-03-08 07:21:31,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:21:31,898 INFO L471 AbstractCegarLoop]: Abstraction has 16057 states and 22969 transitions. [2025-03-08 07:21:31,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:31,898 INFO L276 IsEmpty]: Start isEmpty. Operand 16057 states and 22969 transitions. [2025-03-08 07:21:31,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 07:21:31,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:21:31,900 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] [2025-03-08 07:21:31,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:21:31,900 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:21:31,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:21:31,900 INFO L85 PathProgramCache]: Analyzing trace with hash 635980293, now seen corresponding path program 1 times [2025-03-08 07:21:31,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:21:31,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851767622] [2025-03-08 07:21:31,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:31,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:21:31,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 07:21:31,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 07:21:31,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:31,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:32,015 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 07:21:32,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:21:32,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851767622] [2025-03-08 07:21:32,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851767622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:21:32,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:21:32,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:21:32,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904089065] [2025-03-08 07:21:32,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:21:32,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:21:32,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:21:32,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:21:32,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:21:32,018 INFO L87 Difference]: Start difference. First operand 16057 states and 22969 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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-08 07:21:32,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:21:32,445 INFO L93 Difference]: Finished difference Result 30469 states and 43519 transitions. [2025-03-08 07:21:32,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 07:21:32,446 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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 77 [2025-03-08 07:21:32,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:21:32,488 INFO L225 Difference]: With dead ends: 30469 [2025-03-08 07:21:32,489 INFO L226 Difference]: Without dead ends: 27411 [2025-03-08 07:21:32,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 07:21:32,496 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 6347 mSDsluCounter, 2008 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6347 SdHoareTripleChecker+Valid, 3621 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:21:32,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6347 Valid, 3621 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:21:32,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27411 states. [2025-03-08 07:21:32,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27411 to 19113. [2025-03-08 07:21:32,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19113 states, 19111 states have (on average 1.4270838783946418) internal successors, (27273), 19112 states have internal predecessors, (27273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:32,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19113 states to 19113 states and 27273 transitions. [2025-03-08 07:21:32,848 INFO L78 Accepts]: Start accepts. Automaton has 19113 states and 27273 transitions. Word has length 77 [2025-03-08 07:21:32,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:21:32,848 INFO L471 AbstractCegarLoop]: Abstraction has 19113 states and 27273 transitions. [2025-03-08 07:21:32,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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-08 07:21:32,848 INFO L276 IsEmpty]: Start isEmpty. Operand 19113 states and 27273 transitions. [2025-03-08 07:21:32,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 07:21:32,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:21:32,850 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] [2025-03-08 07:21:32,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:21:32,850 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:21:32,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:21:32,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1791105029, now seen corresponding path program 1 times [2025-03-08 07:21:32,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:21:32,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532664805] [2025-03-08 07:21:32,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:32,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:21:32,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 07:21:32,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 07:21:32,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:32,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:32,959 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 07:21:32,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:21:32,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532664805] [2025-03-08 07:21:32,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532664805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:21:32,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:21:32,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:21:32,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199055881] [2025-03-08 07:21:32,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:21:32,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:21:32,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:21:32,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:21:32,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:21:32,960 INFO L87 Difference]: Start difference. First operand 19113 states and 27273 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:33,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:21:33,420 INFO L93 Difference]: Finished difference Result 31765 states and 45391 transitions. [2025-03-08 07:21:33,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 07:21:33,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 79 [2025-03-08 07:21:33,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:21:33,454 INFO L225 Difference]: With dead ends: 31765 [2025-03-08 07:21:33,455 INFO L226 Difference]: Without dead ends: 29587 [2025-03-08 07:21:33,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 07:21:33,464 INFO L435 NwaCegarLoop]: 1614 mSDtfsCounter, 6326 mSDsluCounter, 2120 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6326 SdHoareTripleChecker+Valid, 3734 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:21:33,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6326 Valid, 3734 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:21:33,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29587 states. [2025-03-08 07:21:33,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29587 to 21289. [2025-03-08 07:21:33,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21289 states, 21287 states have (on average 1.427021186639733) internal successors, (30377), 21288 states have internal predecessors, (30377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21289 states to 21289 states and 30377 transitions. [2025-03-08 07:21:33,974 INFO L78 Accepts]: Start accepts. Automaton has 21289 states and 30377 transitions. Word has length 79 [2025-03-08 07:21:33,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:21:33,974 INFO L471 AbstractCegarLoop]: Abstraction has 21289 states and 30377 transitions. [2025-03-08 07:21:33,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:33,974 INFO L276 IsEmpty]: Start isEmpty. Operand 21289 states and 30377 transitions. [2025-03-08 07:21:33,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 07:21:33,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:21:33,977 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] [2025-03-08 07:21:33,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 07:21:33,978 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:21:33,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:21:33,978 INFO L85 PathProgramCache]: Analyzing trace with hash -838885117, now seen corresponding path program 1 times [2025-03-08 07:21:33,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:21:33,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890807255] [2025-03-08 07:21:33,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:33,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:21:33,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 07:21:33,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 07:21:33,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:33,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:34,056 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:21:34,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:21:34,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890807255] [2025-03-08 07:21:34,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890807255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:21:34,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:21:34,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:21:34,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050615979] [2025-03-08 07:21:34,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:21:34,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:21:34,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:21:34,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:21:34,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:21:34,058 INFO L87 Difference]: Start difference. First operand 21289 states and 30377 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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-08 07:21:34,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:21:34,380 INFO L93 Difference]: Finished difference Result 35457 states and 50576 transitions. [2025-03-08 07:21:34,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:21:34,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 79 [2025-03-08 07:21:34,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:21:34,400 INFO L225 Difference]: With dead ends: 35457 [2025-03-08 07:21:34,400 INFO L226 Difference]: Without dead ends: 16463 [2025-03-08 07:21:34,416 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-08 07:21:34,417 INFO L435 NwaCegarLoop]: 1586 mSDtfsCounter, 50 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3117 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-08 07:21:34,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3117 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:21:34,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16463 states. [2025-03-08 07:21:34,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16463 to 16461. [2025-03-08 07:21:34,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16461 states, 16459 states have (on average 1.432711586366122) internal successors, (23581), 16460 states have internal predecessors, (23581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:34,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16461 states to 16461 states and 23581 transitions. [2025-03-08 07:21:34,832 INFO L78 Accepts]: Start accepts. Automaton has 16461 states and 23581 transitions. Word has length 79 [2025-03-08 07:21:34,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:21:34,832 INFO L471 AbstractCegarLoop]: Abstraction has 16461 states and 23581 transitions. [2025-03-08 07:21:34,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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-08 07:21:34,832 INFO L276 IsEmpty]: Start isEmpty. Operand 16461 states and 23581 transitions. [2025-03-08 07:21:34,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 07:21:34,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:21:34,834 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] [2025-03-08 07:21:34,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:21:34,835 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:21:34,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:21:34,835 INFO L85 PathProgramCache]: Analyzing trace with hash 97319945, now seen corresponding path program 1 times [2025-03-08 07:21:34,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:21:34,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077379335] [2025-03-08 07:21:34,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:34,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:21:34,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 07:21:34,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 07:21:34,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:34,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:34,909 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:21:34,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:21:34,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077379335] [2025-03-08 07:21:34,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077379335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:21:34,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:21:34,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:21:34,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777756267] [2025-03-08 07:21:34,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:21:34,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:21:34,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:21:34,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:21:34,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:21:34,910 INFO L87 Difference]: Start difference. First operand 16461 states and 23581 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:35,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:21:35,083 INFO L93 Difference]: Finished difference Result 23537 states and 33567 transitions. [2025-03-08 07:21:35,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:21:35,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-03-08 07:21:35,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:21:35,094 INFO L225 Difference]: With dead ends: 23537 [2025-03-08 07:21:35,094 INFO L226 Difference]: Without dead ends: 9391 [2025-03-08 07:21:35,106 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-08 07:21:35,106 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 45 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3102 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-08 07:21:35,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3102 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:21:35,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9391 states. [2025-03-08 07:21:35,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9391 to 9389. [2025-03-08 07:21:35,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9389 states, 9387 states have (on average 1.4374134441248536) internal successors, (13493), 9388 states have internal predecessors, (13493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:35,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9389 states to 9389 states and 13493 transitions. [2025-03-08 07:21:35,261 INFO L78 Accepts]: Start accepts. Automaton has 9389 states and 13493 transitions. Word has length 80 [2025-03-08 07:21:35,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:21:35,262 INFO L471 AbstractCegarLoop]: Abstraction has 9389 states and 13493 transitions. [2025-03-08 07:21:35,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:35,262 INFO L276 IsEmpty]: Start isEmpty. Operand 9389 states and 13493 transitions. [2025-03-08 07:21:35,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 07:21:35,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:21:35,263 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] [2025-03-08 07:21:35,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 07:21:35,263 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:21:35,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:21:35,264 INFO L85 PathProgramCache]: Analyzing trace with hash -755676880, now seen corresponding path program 1 times [2025-03-08 07:21:35,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:21:35,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287011756] [2025-03-08 07:21:35,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:35,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:21:35,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 07:21:35,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 07:21:35,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:35,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:35,322 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:21:35,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:21:35,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287011756] [2025-03-08 07:21:35,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287011756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:21:35,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:21:35,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:21:35,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578620927] [2025-03-08 07:21:35,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:21:35,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:21:35,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:21:35,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:21:35,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:21:35,323 INFO L87 Difference]: Start difference. First operand 9389 states and 13493 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:35,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:21:35,407 INFO L93 Difference]: Finished difference Result 12929 states and 18435 transitions. [2025-03-08 07:21:35,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:21:35,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-03-08 07:21:35,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:21:35,414 INFO L225 Difference]: With dead ends: 12929 [2025-03-08 07:21:35,414 INFO L226 Difference]: Without dead ends: 5855 [2025-03-08 07:21:35,420 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-08 07:21:35,420 INFO L435 NwaCegarLoop]: 1572 mSDtfsCounter, 42 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3087 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-08 07:21:35,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3087 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:21:35,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5855 states. [2025-03-08 07:21:35,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5855 to 5853. [2025-03-08 07:21:35,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5853 states, 5851 states have (on average 1.4529140317894378) internal successors, (8501), 5852 states have internal predecessors, (8501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:35,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5853 states to 5853 states and 8501 transitions. [2025-03-08 07:21:35,494 INFO L78 Accepts]: Start accepts. Automaton has 5853 states and 8501 transitions. Word has length 82 [2025-03-08 07:21:35,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:21:35,494 INFO L471 AbstractCegarLoop]: Abstraction has 5853 states and 8501 transitions. [2025-03-08 07:21:35,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:35,494 INFO L276 IsEmpty]: Start isEmpty. Operand 5853 states and 8501 transitions. [2025-03-08 07:21:35,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 07:21:35,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:21:35,495 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] [2025-03-08 07:21:35,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 07:21:35,495 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:21:35,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:21:35,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1816537225, now seen corresponding path program 1 times [2025-03-08 07:21:35,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:21:35,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454793429] [2025-03-08 07:21:35,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:35,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:21:35,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 07:21:35,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 07:21:35,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:35,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:35,554 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:21:35,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:21:35,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454793429] [2025-03-08 07:21:35,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454793429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:21:35,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:21:35,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:21:35,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197837894] [2025-03-08 07:21:35,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:21:35,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:21:35,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:21:35,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:21:35,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:21:35,556 INFO L87 Difference]: Start difference. First operand 5853 states and 8501 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:35,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:21:35,595 INFO L93 Difference]: Finished difference Result 7625 states and 10947 transitions. [2025-03-08 07:21:35,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:21:35,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-03-08 07:21:35,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:21:35,600 INFO L225 Difference]: With dead ends: 7625 [2025-03-08 07:21:35,600 INFO L226 Difference]: Without dead ends: 4087 [2025-03-08 07:21:35,604 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-08 07:21:35,605 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 39 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3072 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-08 07:21:35,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3072 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:21:35,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4087 states. [2025-03-08 07:21:35,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4087 to 4085. [2025-03-08 07:21:35,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4085 states, 4083 states have (on average 1.4771001714425667) internal successors, (6031), 4084 states have internal predecessors, (6031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:35,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4085 states to 4085 states and 6031 transitions. [2025-03-08 07:21:35,654 INFO L78 Accepts]: Start accepts. Automaton has 4085 states and 6031 transitions. Word has length 84 [2025-03-08 07:21:35,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:21:35,655 INFO L471 AbstractCegarLoop]: Abstraction has 4085 states and 6031 transitions. [2025-03-08 07:21:35,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:35,655 INFO L276 IsEmpty]: Start isEmpty. Operand 4085 states and 6031 transitions. [2025-03-08 07:21:35,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:21:35,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:21:35,656 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] [2025-03-08 07:21:35,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 07:21:35,656 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:21:35,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:21:35,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1212344610, now seen corresponding path program 1 times [2025-03-08 07:21:35,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:21:35,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436848630] [2025-03-08 07:21:35,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:35,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:21:35,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:21:35,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:21:35,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:35,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:35,717 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:21:35,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:21:35,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436848630] [2025-03-08 07:21:35,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436848630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:21:35,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:21:35,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:21:35,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980504731] [2025-03-08 07:21:35,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:21:35,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:21:35,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:21:35,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:21:35,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:21:35,719 INFO L87 Difference]: Start difference. First operand 4085 states and 6031 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:35,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:21:35,754 INFO L93 Difference]: Finished difference Result 4973 states and 7242 transitions. [2025-03-08 07:21:35,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:21:35,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-08 07:21:35,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:21:35,758 INFO L225 Difference]: With dead ends: 4973 [2025-03-08 07:21:35,758 INFO L226 Difference]: Without dead ends: 3203 [2025-03-08 07:21:35,760 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-08 07:21:35,761 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 36 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 3057 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-08 07:21:35,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 3057 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:21:35,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3203 states. [2025-03-08 07:21:35,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3203 to 3201. [2025-03-08 07:21:35,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3201 states, 3199 states have (on average 1.5032822757111597) internal successors, (4809), 3200 states have internal predecessors, (4809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:35,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 4809 transitions. [2025-03-08 07:21:35,798 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 4809 transitions. Word has length 86 [2025-03-08 07:21:35,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:21:35,799 INFO L471 AbstractCegarLoop]: Abstraction has 3201 states and 4809 transitions. [2025-03-08 07:21:35,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:35,799 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 4809 transitions. [2025-03-08 07:21:35,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 07:21:35,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:21:35,800 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] [2025-03-08 07:21:35,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 07:21:35,801 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:21:35,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:21:35,801 INFO L85 PathProgramCache]: Analyzing trace with hash -705464475, now seen corresponding path program 1 times [2025-03-08 07:21:35,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:21:35,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198541397] [2025-03-08 07:21:35,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:35,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:21:35,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 07:21:35,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 07:21:35,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:35,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:36,360 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-08 07:21:36,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:21:36,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198541397] [2025-03-08 07:21:36,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198541397] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:21:36,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013900142] [2025-03-08 07:21:36,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:36,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:21:36,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:21:36,363 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-08 07:21:36,364 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-08 07:21:36,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 07:21:36,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 07:21:36,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:36,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:36,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 07:21:36,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:21:36,743 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:21:36,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:21:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:21:37,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013900142] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:21:37,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:21:37,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 22 [2025-03-08 07:21:37,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139375003] [2025-03-08 07:21:37,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:21:37,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 07:21:37,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:21:37,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 07:21:37,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-03-08 07:21:37,006 INFO L87 Difference]: Start difference. First operand 3201 states and 4809 transitions. Second operand has 22 states, 22 states have (on average 11.409090909090908) internal successors, (251), 22 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:40,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:21:40,281 INFO L93 Difference]: Finished difference Result 11153 states and 15390 transitions. [2025-03-08 07:21:40,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-03-08 07:21:40,281 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 11.409090909090908) internal successors, (251), 22 states have internal predecessors, (251), 0 states have call successors, (0), 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 88 [2025-03-08 07:21:40,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:21:40,292 INFO L225 Difference]: With dead ends: 11153 [2025-03-08 07:21:40,292 INFO L226 Difference]: Without dead ends: 10181 [2025-03-08 07:21:40,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2849 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1313, Invalid=7243, Unknown=0, NotChecked=0, Total=8556 [2025-03-08 07:21:40,297 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 16487 mSDsluCounter, 9556 mSDsCounter, 0 mSdLazyCounter, 1879 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16487 SdHoareTripleChecker+Valid, 11095 SdHoareTripleChecker+Invalid, 1978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:21:40,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16487 Valid, 11095 Invalid, 1978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 07:21:40,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10181 states. [2025-03-08 07:21:40,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10181 to 9571. [2025-03-08 07:21:40,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9571 states, 9569 states have (on average 1.371721182986728) internal successors, (13126), 9570 states have internal predecessors, (13126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9571 states to 9571 states and 13126 transitions. [2025-03-08 07:21:40,472 INFO L78 Accepts]: Start accepts. Automaton has 9571 states and 13126 transitions. Word has length 88 [2025-03-08 07:21:40,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:21:40,472 INFO L471 AbstractCegarLoop]: Abstraction has 9571 states and 13126 transitions. [2025-03-08 07:21:40,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 11.409090909090908) internal successors, (251), 22 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:40,472 INFO L276 IsEmpty]: Start isEmpty. Operand 9571 states and 13126 transitions. [2025-03-08 07:21:40,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 07:21:40,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:21:40,473 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 07:21:40,480 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-08 07:21:40,674 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,SelfDestructingSolverStorable22 [2025-03-08 07:21:40,674 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:21:40,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:21:40,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1536780076, now seen corresponding path program 1 times [2025-03-08 07:21:40,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:21:40,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699330779] [2025-03-08 07:21:40,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:40,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:21:40,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 07:21:40,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 07:21:40,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:40,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:40,910 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:21:40,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:21:40,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699330779] [2025-03-08 07:21:40,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699330779] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:21:40,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143772749] [2025-03-08 07:21:40,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:40,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:21:40,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:21:40,913 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-08 07:21:40,915 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-08 07:21:40,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 07:21:41,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 07:21:41,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:41,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:41,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 07:21:41,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:21:41,438 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:21:41,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:21:42,230 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:21:42,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143772749] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:21:42,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:21:42,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2025-03-08 07:21:42,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553734709] [2025-03-08 07:21:42,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:21:42,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 07:21:42,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:21:42,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 07:21:42,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2025-03-08 07:21:42,231 INFO L87 Difference]: Start difference. First operand 9571 states and 13126 transitions. Second operand has 29 states, 29 states have (on average 7.551724137931035) internal successors, (219), 29 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:43,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:21:43,043 INFO L93 Difference]: Finished difference Result 24405 states and 32651 transitions. [2025-03-08 07:21:43,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 07:21:43,043 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.551724137931035) internal successors, (219), 29 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-08 07:21:43,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:21:43,060 INFO L225 Difference]: With dead ends: 24405 [2025-03-08 07:21:43,060 INFO L226 Difference]: Without dead ends: 17223 [2025-03-08 07:21:43,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=437, Invalid=1455, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 07:21:43,069 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 15004 mSDsluCounter, 6517 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15004 SdHoareTripleChecker+Valid, 8040 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:21:43,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15004 Valid, 8040 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:21:43,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17223 states. [2025-03-08 07:21:43,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17223 to 17059. [2025-03-08 07:21:43,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17059 states, 17057 states have (on average 1.331711320865334) internal successors, (22715), 17058 states have internal predecessors, (22715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:43,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17059 states to 17059 states and 22715 transitions. [2025-03-08 07:21:43,423 INFO L78 Accepts]: Start accepts. Automaton has 17059 states and 22715 transitions. Word has length 89 [2025-03-08 07:21:43,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:21:43,423 INFO L471 AbstractCegarLoop]: Abstraction has 17059 states and 22715 transitions. [2025-03-08 07:21:43,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.551724137931035) internal successors, (219), 29 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:43,423 INFO L276 IsEmpty]: Start isEmpty. Operand 17059 states and 22715 transitions. [2025-03-08 07:21:43,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 07:21:43,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:21:43,424 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 07:21:43,431 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-08 07:21:43,625 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,SelfDestructingSolverStorable23 [2025-03-08 07:21:43,625 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:21:43,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:21:43,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1731525900, now seen corresponding path program 1 times [2025-03-08 07:21:43,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:21:43,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842637366] [2025-03-08 07:21:43,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:43,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:21:43,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 07:21:43,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 07:21:43,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:43,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:43,847 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:21:43,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:21:43,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842637366] [2025-03-08 07:21:43,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842637366] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:21:43,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585933571] [2025-03-08 07:21:43,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:43,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:21:43,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:21:43,850 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-08 07:21:43,852 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-08 07:21:43,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 07:21:44,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 07:21:44,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:44,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:44,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 07:21:44,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:21:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:21:44,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:21:45,108 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:21:45,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585933571] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:21:45,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:21:45,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-03-08 07:21:45,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544892957] [2025-03-08 07:21:45,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:21:45,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 07:21:45,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:21:45,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 07:21:45,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-03-08 07:21:45,109 INFO L87 Difference]: Start difference. First operand 17059 states and 22715 transitions. Second operand has 26 states, 26 states have (on average 9.423076923076923) internal successors, (245), 25 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:46,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:21:46,636 INFO L93 Difference]: Finished difference Result 48303 states and 63323 transitions. [2025-03-08 07:21:46,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 07:21:46,636 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.423076923076923) internal successors, (245), 25 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-08 07:21:46,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:21:46,664 INFO L225 Difference]: With dead ends: 48303 [2025-03-08 07:21:46,665 INFO L226 Difference]: Without dead ends: 33703 [2025-03-08 07:21:46,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=656, Invalid=2536, Unknown=0, NotChecked=0, Total=3192 [2025-03-08 07:21:46,672 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 18407 mSDsluCounter, 8509 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18407 SdHoareTripleChecker+Valid, 10074 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:21:46,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18407 Valid, 10074 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:21:46,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33703 states. [2025-03-08 07:21:47,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33703 to 29683. [2025-03-08 07:21:47,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29683 states, 29681 states have (on average 1.2928135844479633) internal successors, (38372), 29682 states have internal predecessors, (38372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:47,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29683 states to 29683 states and 38372 transitions. [2025-03-08 07:21:47,543 INFO L78 Accepts]: Start accepts. Automaton has 29683 states and 38372 transitions. Word has length 89 [2025-03-08 07:21:47,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:21:47,543 INFO L471 AbstractCegarLoop]: Abstraction has 29683 states and 38372 transitions. [2025-03-08 07:21:47,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.423076923076923) internal successors, (245), 25 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:47,544 INFO L276 IsEmpty]: Start isEmpty. Operand 29683 states and 38372 transitions. [2025-03-08 07:21:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 07:21:47,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:21:47,545 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 07:21:47,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 07:21:47,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:21:47,746 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:21:47,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:21:47,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1758561150, now seen corresponding path program 1 times [2025-03-08 07:21:47,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:21:47,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909659522] [2025-03-08 07:21:47,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:47,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:21:47,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 07:21:47,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 07:21:47,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:47,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:47,979 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:21:47,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:21:47,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909659522] [2025-03-08 07:21:47,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909659522] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:21:47,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660260585] [2025-03-08 07:21:47,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:47,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:21:47,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:21:47,982 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-08 07:21:47,988 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-08 07:21:48,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 07:21:48,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 07:21:48,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:48,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:48,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 07:21:48,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:21:48,381 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:21:48,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:21:48,997 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:21:48,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660260585] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:21:48,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:21:48,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-03-08 07:21:48,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375659296] [2025-03-08 07:21:48,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:21:48,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 07:21:48,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:21:48,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 07:21:48,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2025-03-08 07:21:48,999 INFO L87 Difference]: Start difference. First operand 29683 states and 38372 transitions. Second operand has 22 states, 22 states have (on average 8.636363636363637) internal successors, (190), 21 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:50,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:21:50,507 INFO L93 Difference]: Finished difference Result 83069 states and 106121 transitions. [2025-03-08 07:21:50,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 07:21:50,507 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.636363636363637) internal successors, (190), 21 states have internal predecessors, (190), 0 states have call successors, (0), 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-08 07:21:50,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:21:50,567 INFO L225 Difference]: With dead ends: 83069 [2025-03-08 07:21:50,567 INFO L226 Difference]: Without dead ends: 56663 [2025-03-08 07:21:50,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=687, Unknown=0, NotChecked=0, Total=930 [2025-03-08 07:21:50,584 INFO L435 NwaCegarLoop]: 1513 mSDtfsCounter, 10652 mSDsluCounter, 4877 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10652 SdHoareTripleChecker+Valid, 6390 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:21:50,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10652 Valid, 6390 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:21:50,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56663 states. [2025-03-08 07:21:52,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56663 to 56659. [2025-03-08 07:21:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56659 states, 56657 states have (on average 1.2754469880156027) internal successors, (72263), 56658 states have internal predecessors, (72263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:52,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56659 states to 56659 states and 72263 transitions. [2025-03-08 07:21:52,478 INFO L78 Accepts]: Start accepts. Automaton has 56659 states and 72263 transitions. Word has length 90 [2025-03-08 07:21:52,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:21:52,478 INFO L471 AbstractCegarLoop]: Abstraction has 56659 states and 72263 transitions. [2025-03-08 07:21:52,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.636363636363637) internal successors, (190), 21 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:21:52,478 INFO L276 IsEmpty]: Start isEmpty. Operand 56659 states and 72263 transitions. [2025-03-08 07:21:52,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 07:21:52,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:21:52,481 INFO L218 NwaCegarLoop]: trace histogram [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-08 07:21:52,487 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-08 07:21:52,681 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,SelfDestructingSolverStorable25 [2025-03-08 07:21:52,681 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:21:52,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:21:52,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1872225329, now seen corresponding path program 1 times [2025-03-08 07:21:52,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:21:52,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729811865] [2025-03-08 07:21:52,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:52,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:21:52,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 07:21:52,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 07:21:52,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:52,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:21:53,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:21:53,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729811865] [2025-03-08 07:21:53,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729811865] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:21:53,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734859327] [2025-03-08 07:21:53,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:21:53,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:21:53,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:21:53,040 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-08 07:21:53,042 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-08 07:21:53,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 07:21:53,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 07:21:53,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:21:53,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:21:53,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 07:21:53,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:21:53,664 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:21:53,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:21:54,454 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:21:54,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734859327] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:21:54,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:21:54,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 30 [2025-03-08 07:21:54,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692887298] [2025-03-08 07:21:54,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:21:54,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 07:21:54,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:21:54,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 07:21:54,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2025-03-08 07:21:54,456 INFO L87 Difference]: Start difference. First operand 56659 states and 72263 transitions. Second operand has 30 states, 30 states have (on average 8.433333333333334) internal successors, (253), 30 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:22:00,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:22:00,033 INFO L93 Difference]: Finished difference Result 174335 states and 222201 transitions. [2025-03-08 07:22:00,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-08 07:22:00,034 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 8.433333333333334) internal successors, (253), 30 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-03-08 07:22:00,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:22:00,173 INFO L225 Difference]: With dead ends: 174335 [2025-03-08 07:22:00,173 INFO L226 Difference]: Without dead ends: 122773 [2025-03-08 07:22:00,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=816, Invalid=3606, Unknown=0, NotChecked=0, Total=4422 [2025-03-08 07:22:00,211 INFO L435 NwaCegarLoop]: 1512 mSDtfsCounter, 13975 mSDsluCounter, 12512 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13975 SdHoareTripleChecker+Valid, 14024 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:22:00,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13975 Valid, 14024 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:22:00,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122773 states. [2025-03-08 07:22:02,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122773 to 78355. [2025-03-08 07:22:02,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78355 states, 78353 states have (on average 1.2604877924265823) internal successors, (98763), 78354 states have internal predecessors, (98763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:22:02,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78355 states to 78355 states and 98763 transitions. [2025-03-08 07:22:02,865 INFO L78 Accepts]: Start accepts. Automaton has 78355 states and 98763 transitions. Word has length 91 [2025-03-08 07:22:02,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:22:02,866 INFO L471 AbstractCegarLoop]: Abstraction has 78355 states and 98763 transitions. [2025-03-08 07:22:02,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.433333333333334) internal successors, (253), 30 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:22:02,866 INFO L276 IsEmpty]: Start isEmpty. Operand 78355 states and 98763 transitions. [2025-03-08 07:22:02,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 07:22:02,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:22:02,867 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 07:22:02,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 07:22:03,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-08 07:22:03,068 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:22:03,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:22:03,068 INFO L85 PathProgramCache]: Analyzing trace with hash -201120643, now seen corresponding path program 1 times [2025-03-08 07:22:03,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:22:03,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18766809] [2025-03-08 07:22:03,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:22:03,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:22:03,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 07:22:03,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 07:22:03,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:22:03,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:22:05,067 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:22:05,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:22:05,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18766809] [2025-03-08 07:22:05,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18766809] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:22:05,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691711677] [2025-03-08 07:22:05,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:22:05,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:22:05,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:22:05,070 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:22:05,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 07:22:05,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 07:22:05,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 07:22:05,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:22:05,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:22:05,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 07:22:05,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:22:09,272 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:22:09,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:22:11,086 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:22:11,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691711677] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:22:11,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:22:11,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 20, 17] total 64 [2025-03-08 07:22:11,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80904177] [2025-03-08 07:22:11,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:22:11,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-03-08 07:22:11,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:22:11,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-03-08 07:22:11,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=3740, Unknown=0, NotChecked=0, Total=4032 [2025-03-08 07:22:11,088 INFO L87 Difference]: Start difference. First operand 78355 states and 98763 transitions. Second operand has 64 states, 64 states have (on average 3.890625) internal successors, (249), 64 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)