./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.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 5cef1fa067bbb4b41514033d4724b62c75373060841bf986b96d67600e77c9e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:17:03,630 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:17:03,690 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:17:03,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:17:03,697 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:17:03,710 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:17:03,711 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:17:03,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:17:03,712 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:17:03,712 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:17:03,712 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:17:03,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:17:03,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:17:03,713 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:17:03,713 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:17:03,713 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:17:03,713 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:17:03,713 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:17:03,713 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:17:03,714 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:17:03,714 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:17:03,714 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:17:03,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:17:03,714 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:17:03,714 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:17:03,715 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:17:03,715 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:17:03,715 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:17:03,715 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:17:03,715 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:17:03,715 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:17:03,715 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:17:03,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:17:03,715 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:17:03,715 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:17:03,716 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:17:03,716 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:17:03,716 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:17:03,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:17:03,716 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:17:03,716 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:17:03,717 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:17:03,717 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:17:03,717 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 -> 5cef1fa067bbb4b41514033d4724b62c75373060841bf986b96d67600e77c9e6 [2025-03-03 16:17:03,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:17:03,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:17:03,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:17:03,930 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:17:03,930 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:17:03,931 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label01.c [2025-03-03 16:17:05,107 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a19696dc/5780fb91390841658a84e085cbce1dd4/FLAG6924fe3ff [2025-03-03 16:17:05,596 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:17:05,597 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label01.c [2025-03-03 16:17:05,631 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a19696dc/5780fb91390841658a84e085cbce1dd4/FLAG6924fe3ff [2025-03-03 16:17:05,647 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a19696dc/5780fb91390841658a84e085cbce1dd4 [2025-03-03 16:17:05,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:17:05,651 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:17:05,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:17:05,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:17:05,655 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:17:05,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:17:05" (1/1) ... [2025-03-03 16:17:05,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a6cbbcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:17:05, skipping insertion in model container [2025-03-03 16:17:05,656 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:17:05" (1/1) ... [2025-03-03 16:17:05,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:17:06,097 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label01.c[26897,26910] [2025-03-03 16:17:06,152 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label01.c[32452,32465] [2025-03-03 16:17:06,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:17:06,537 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:17:06,578 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label01.c[26897,26910] [2025-03-03 16:17:06,587 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label01.c[32452,32465] [2025-03-03 16:17:06,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:17:06,840 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:17:06,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:17:06 WrapperNode [2025-03-03 16:17:06,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:17:06,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:17:06,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:17:06,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:17:06,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:17:06" (1/1) ... [2025-03-03 16:17:06,890 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:17:06" (1/1) ... [2025-03-03 16:17:07,187 INFO L138 Inliner]: procedures = 39, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5288 [2025-03-03 16:17:07,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:17:07,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:17:07,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:17:07,190 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:17:07,198 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:17:06" (1/1) ... [2025-03-03 16:17:07,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:17:06" (1/1) ... [2025-03-03 16:17:07,249 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:17:06" (1/1) ... [2025-03-03 16:17:07,449 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:17:07,449 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:17:06" (1/1) ... [2025-03-03 16:17:07,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:17:06" (1/1) ... [2025-03-03 16:17:07,535 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:17:06" (1/1) ... [2025-03-03 16:17:07,566 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:17:06" (1/1) ... [2025-03-03 16:17:07,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:17:06" (1/1) ... [2025-03-03 16:17:07,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:17:06" (1/1) ... [2025-03-03 16:17:07,683 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:17:07,685 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:17:07,685 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:17:07,685 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:17:07,687 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:17:06" (1/1) ... [2025-03-03 16:17:07,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:17:07,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:17:07,713 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:17:07,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:17:07,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:17:07,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:17:07,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:17:07,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:17:07,862 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:17:07,863 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:17:11,417 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2375: havoc calculate_output_#t~ret50#1; [2025-03-03 16:17:11,417 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3854: havoc calculate_output2_#t~ret51#1; [2025-03-03 16:17:11,418 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5344: havoc calculate_output3_#t~ret52#1; [2025-03-03 16:17:11,589 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2025-03-03 16:17:11,589 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:17:11,619 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:17:11,620 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:17:11,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:17:11 BoogieIcfgContainer [2025-03-03 16:17:11,622 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:17:11,624 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:17:11,624 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:17:11,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:17:11,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:17:05" (1/3) ... [2025-03-03 16:17:11,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e40cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:17:11, skipping insertion in model container [2025-03-03 16:17:11,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:17:06" (2/3) ... [2025-03-03 16:17:11,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e40cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:17:11, skipping insertion in model container [2025-03-03 16:17:11,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:17:11" (3/3) ... [2025-03-03 16:17:11,629 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label01.c [2025-03-03 16:17:11,639 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:17:11,641 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label01.c that has 1 procedures, 946 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-03 16:17:11,709 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:17:11,720 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;@3a6bd560, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:17:11,720 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:17:11,727 INFO L276 IsEmpty]: Start isEmpty. Operand has 946 states, 943 states have (on average 1.9024390243902438) internal successors, (1794), 945 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:11,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 16:17:11,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:11,735 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] [2025-03-03 16:17:11,735 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:11,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:11,739 INFO L85 PathProgramCache]: Analyzing trace with hash -175212786, now seen corresponding path program 1 times [2025-03-03 16:17:11,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:11,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155870375] [2025-03-03 16:17:11,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:11,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:11,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-03 16:17:11,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 16:17:11,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:11,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:17:12,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:12,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155870375] [2025-03-03 16:17:12,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155870375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:12,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:12,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:17:12,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726069958] [2025-03-03 16:17:12,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:12,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 16:17:12,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:12,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 16:17:12,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 16:17:12,030 INFO L87 Difference]: Start difference. First operand has 946 states, 943 states have (on average 1.9024390243902438) internal successors, (1794), 945 states have internal predecessors, (1794), 0 states have call successors, (0), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:12,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:12,090 INFO L93 Difference]: Finished difference Result 1825 states and 3458 transitions. [2025-03-03 16:17:12,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 16:17:12,092 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-03-03 16:17:12,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:12,102 INFO L225 Difference]: With dead ends: 1825 [2025-03-03 16:17:12,102 INFO L226 Difference]: Without dead ends: 881 [2025-03-03 16:17:12,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 16:17:12,107 INFO L435 NwaCegarLoop]: 1730 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, 1730 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:12,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1730 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:17:12,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-03-03 16:17:12,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2025-03-03 16:17:12,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 879 states have (on average 1.8930602957906713) internal successors, (1664), 880 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:12,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1664 transitions. [2025-03-03 16:17:12,181 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1664 transitions. Word has length 30 [2025-03-03 16:17:12,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:12,181 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1664 transitions. [2025-03-03 16:17:12,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:12,182 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1664 transitions. [2025-03-03 16:17:12,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 16:17:12,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:12,183 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] [2025-03-03 16:17:12,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:17:12,184 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:12,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:12,184 INFO L85 PathProgramCache]: Analyzing trace with hash -242219539, now seen corresponding path program 1 times [2025-03-03 16:17:12,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:12,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321870060] [2025-03-03 16:17:12,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:12,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:12,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-03 16:17:12,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 16:17:12,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:12,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:12,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:17:12,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:12,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321870060] [2025-03-03 16:17:12,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321870060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:12,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:12,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:17:12,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113168993] [2025-03-03 16:17:12,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:12,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:17:12,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:12,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:17:12,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:17:12,457 INFO L87 Difference]: Start difference. First operand 881 states and 1664 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:12,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:12,584 INFO L93 Difference]: Finished difference Result 945 states and 1765 transitions. [2025-03-03 16:17:12,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:17:12,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-03-03 16:17:12,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:12,589 INFO L225 Difference]: With dead ends: 945 [2025-03-03 16:17:12,589 INFO L226 Difference]: Without dead ends: 881 [2025-03-03 16:17:12,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:17:12,590 INFO L435 NwaCegarLoop]: 1662 mSDtfsCounter, 0 mSDsluCounter, 4920 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6582 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:12,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6582 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:17:12,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-03-03 16:17:12,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2025-03-03 16:17:12,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 879 states have (on average 1.8236632536973834) internal successors, (1603), 880 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:12,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1603 transitions. [2025-03-03 16:17:12,615 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1603 transitions. Word has length 30 [2025-03-03 16:17:12,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:12,615 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1603 transitions. [2025-03-03 16:17:12,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:12,616 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1603 transitions. [2025-03-03 16:17:12,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 16:17:12,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:12,617 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-03 16:17:12,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:17:12,618 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:12,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:12,621 INFO L85 PathProgramCache]: Analyzing trace with hash -830709860, now seen corresponding path program 1 times [2025-03-03 16:17:12,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:12,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999722597] [2025-03-03 16:17:12,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:12,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:12,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 16:17:12,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 16:17:12,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:12,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:12,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:17:12,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:12,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999722597] [2025-03-03 16:17:12,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999722597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:12,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:12,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:17:12,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210735883] [2025-03-03 16:17:12,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:12,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:17:12,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:12,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:17:12,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:17:12,873 INFO L87 Difference]: Start difference. First operand 881 states and 1603 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-03 16:17:17,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:17,653 INFO L93 Difference]: Finished difference Result 3136 states and 5912 transitions. [2025-03-03 16:17:17,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:17:17,654 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-03 16:17:17,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:17,663 INFO L225 Difference]: With dead ends: 3136 [2025-03-03 16:17:17,663 INFO L226 Difference]: Without dead ends: 2383 [2025-03-03 16:17:17,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:17:17,666 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 2545 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2545 SdHoareTripleChecker+Valid, 857 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.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:17,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2545 Valid, 857 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-03 16:17:17,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2025-03-03 16:17:17,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2383. [2025-03-03 16:17:17,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2383 states, 2381 states have (on average 1.5611087778244435) internal successors, (3717), 2382 states have internal predecessors, (3717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:17,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 3717 transitions. [2025-03-03 16:17:17,717 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 3717 transitions. Word has length 48 [2025-03-03 16:17:17,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:17,717 INFO L471 AbstractCegarLoop]: Abstraction has 2383 states and 3717 transitions. [2025-03-03 16:17:17,717 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-03 16:17:17,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 3717 transitions. [2025-03-03 16:17:17,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:17:17,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:17,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:17:17,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:17:17,722 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:17,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:17,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1925042417, now seen corresponding path program 1 times [2025-03-03 16:17:17,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:17,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168696437] [2025-03-03 16:17:17,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:17,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:17,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:17:17,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:17:17,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:17,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:17,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:17:17,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:17,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168696437] [2025-03-03 16:17:17,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168696437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:17,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:17,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 16:17:17,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090651593] [2025-03-03 16:17:17,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:17,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:17:17,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:17,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:17:17,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:17:17,989 INFO L87 Difference]: Start difference. First operand 2383 states and 3717 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:18,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:18,369 INFO L93 Difference]: Finished difference Result 3343 states and 5269 transitions. [2025-03-03 16:17:18,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 16:17:18,369 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-03 16:17:18,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:18,380 INFO L225 Difference]: With dead ends: 3343 [2025-03-03 16:17:18,380 INFO L226 Difference]: Without dead ends: 3283 [2025-03-03 16:17:18,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2025-03-03 16:17:18,384 INFO L435 NwaCegarLoop]: 1599 mSDtfsCounter, 13289 mSDsluCounter, 5496 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13289 SdHoareTripleChecker+Valid, 7095 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:18,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13289 Valid, 7095 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:17:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3283 states. [2025-03-03 16:17:18,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3283 to 2441. [2025-03-03 16:17:18,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2441 states, 2439 states have (on average 1.5625256252562525) internal successors, (3811), 2440 states have internal predecessors, (3811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:18,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 3811 transitions. [2025-03-03 16:17:18,430 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 3811 transitions. Word has length 90 [2025-03-03 16:17:18,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:18,430 INFO L471 AbstractCegarLoop]: Abstraction has 2441 states and 3811 transitions. [2025-03-03 16:17:18,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:18,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 3811 transitions. [2025-03-03 16:17:18,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:17:18,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:17:18,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:17:18,433 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:18,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:18,433 INFO L85 PathProgramCache]: Analyzing trace with hash -44788596, now seen corresponding path program 1 times [2025-03-03 16:17:18,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:18,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738894138] [2025-03-03 16:17:18,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:18,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:18,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:17:18,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:17:18,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:18,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:18,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:17:18,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:18,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738894138] [2025-03-03 16:17:18,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738894138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:18,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:18,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:17:18,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533017585] [2025-03-03 16:17:18,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:18,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:17:18,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:18,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:17:18,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:18,620 INFO L87 Difference]: Start difference. First operand 2441 states and 3811 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:18,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:18,648 INFO L93 Difference]: Finished difference Result 2666 states and 4174 transitions. [2025-03-03 16:17:18,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:17:18,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-03 16:17:18,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:18,656 INFO L225 Difference]: With dead ends: 2666 [2025-03-03 16:17:18,658 INFO L226 Difference]: Without dead ends: 2548 [2025-03-03 16:17:18,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:18,664 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 1506 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:18,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1693 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:17:18,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2025-03-03 16:17:18,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2546. [2025-03-03 16:17:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 2544 states have (on average 1.564072327044025) internal successors, (3979), 2545 states have internal predecessors, (3979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:18,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3979 transitions. [2025-03-03 16:17:18,733 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 3979 transitions. Word has length 92 [2025-03-03 16:17:18,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:18,734 INFO L471 AbstractCegarLoop]: Abstraction has 2546 states and 3979 transitions. [2025-03-03 16:17:18,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:18,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 3979 transitions. [2025-03-03 16:17:18,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:17:18,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:18,735 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:17:18,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:17:18,735 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:18,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:18,736 INFO L85 PathProgramCache]: Analyzing trace with hash -12465361, now seen corresponding path program 1 times [2025-03-03 16:17:18,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:18,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720401564] [2025-03-03 16:17:18,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:18,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:18,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:17:18,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:17:18,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:18,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:19,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:17:19,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:19,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720401564] [2025-03-03 16:17:19,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720401564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:19,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:19,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 16:17:19,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027823075] [2025-03-03 16:17:19,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:19,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:17:19,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:19,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:17:19,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:17:19,177 INFO L87 Difference]: Start difference. First operand 2546 states and 3979 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:19,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:19,525 INFO L93 Difference]: Finished difference Result 2771 states and 4339 transitions. [2025-03-03 16:17:19,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:17:19,525 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-03 16:17:19,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:19,533 INFO L225 Difference]: With dead ends: 2771 [2025-03-03 16:17:19,533 INFO L226 Difference]: Without dead ends: 2548 [2025-03-03 16:17:19,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-03-03 16:17:19,535 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 3096 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3096 SdHoareTripleChecker+Valid, 2263 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:19,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3096 Valid, 2263 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:17:19,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2025-03-03 16:17:19,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2546. [2025-03-03 16:17:19,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 2544 states have (on average 1.5632861635220126) internal successors, (3977), 2545 states have internal predecessors, (3977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3977 transitions. [2025-03-03 16:17:19,571 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 3977 transitions. Word has length 92 [2025-03-03 16:17:19,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:19,571 INFO L471 AbstractCegarLoop]: Abstraction has 2546 states and 3977 transitions. [2025-03-03 16:17:19,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:19,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 3977 transitions. [2025-03-03 16:17:19,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 16:17:19,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:19,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:17:19,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:17:19,573 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:19,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:19,573 INFO L85 PathProgramCache]: Analyzing trace with hash -355888457, now seen corresponding path program 1 times [2025-03-03 16:17:19,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:19,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931159272] [2025-03-03 16:17:19,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:19,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:19,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 16:17:19,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 16:17:19,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:19,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:19,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:17:19,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:19,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931159272] [2025-03-03 16:17:19,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931159272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:19,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:19,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:17:19,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936284914] [2025-03-03 16:17:19,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:19,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:17:19,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:19,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:17:19,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:17:19,875 INFO L87 Difference]: Start difference. First operand 2546 states and 3977 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:19,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:19,924 INFO L93 Difference]: Finished difference Result 2554 states and 3986 transitions. [2025-03-03 16:17:19,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:17:19,924 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-03 16:17:19,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:19,932 INFO L225 Difference]: With dead ends: 2554 [2025-03-03 16:17:19,932 INFO L226 Difference]: Without dead ends: 2552 [2025-03-03 16:17:19,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:17:19,934 INFO L435 NwaCegarLoop]: 1597 mSDtfsCounter, 0 mSDsluCounter, 9569 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11166 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:19,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11166 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:17:19,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2025-03-03 16:17:19,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2552. [2025-03-03 16:17:19,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2550 states have (on average 1.5615686274509804) internal successors, (3982), 2551 states have internal predecessors, (3982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:19,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3982 transitions. [2025-03-03 16:17:19,968 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3982 transitions. Word has length 93 [2025-03-03 16:17:19,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:19,969 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 3982 transitions. [2025-03-03 16:17:19,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:19,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3982 transitions. [2025-03-03 16:17:19,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 16:17:19,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:19,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:17:19,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:17:19,972 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:19,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:19,973 INFO L85 PathProgramCache]: Analyzing trace with hash -574592115, now seen corresponding path program 1 times [2025-03-03 16:17:19,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:19,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456598128] [2025-03-03 16:17:19,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:19,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:19,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 16:17:19,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 16:17:19,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:19,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:20,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:17:20,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:20,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456598128] [2025-03-03 16:17:20,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456598128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:20,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:20,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:17:20,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467235620] [2025-03-03 16:17:20,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:20,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:17:20,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:20,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:17:20,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:20,073 INFO L87 Difference]: Start difference. First operand 2552 states and 3982 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:20,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:20,098 INFO L93 Difference]: Finished difference Result 2794 states and 4363 transitions. [2025-03-03 16:17:20,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:17:20,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-03-03 16:17:20,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:20,106 INFO L225 Difference]: With dead ends: 2794 [2025-03-03 16:17:20,107 INFO L226 Difference]: Without dead ends: 2670 [2025-03-03 16:17:20,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:20,108 INFO L435 NwaCegarLoop]: 1685 mSDtfsCounter, 1526 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:20,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 1783 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:17:20,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2025-03-03 16:17:20,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2668. [2025-03-03 16:17:20,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2668 states, 2666 states have (on average 1.5615153788447111) internal successors, (4163), 2667 states have internal predecessors, (4163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:20,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 4163 transitions. [2025-03-03 16:17:20,142 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 4163 transitions. Word has length 94 [2025-03-03 16:17:20,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:20,143 INFO L471 AbstractCegarLoop]: Abstraction has 2668 states and 4163 transitions. [2025-03-03 16:17:20,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:20,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 4163 transitions. [2025-03-03 16:17:20,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 16:17:20,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:20,144 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:17:20,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:17:20,144 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:20,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:20,145 INFO L85 PathProgramCache]: Analyzing trace with hash -583233459, now seen corresponding path program 1 times [2025-03-03 16:17:20,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:20,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280749857] [2025-03-03 16:17:20,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:20,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:20,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 16:17:20,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 16:17:20,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:20,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:20,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:17:20,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:20,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280749857] [2025-03-03 16:17:20,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280749857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:20,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:20,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:17:20,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124096389] [2025-03-03 16:17:20,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:20,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:17:20,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:20,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:17:20,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:20,205 INFO L87 Difference]: Start difference. First operand 2668 states and 4163 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:20,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:20,231 INFO L93 Difference]: Finished difference Result 3330 states and 5203 transitions. [2025-03-03 16:17:20,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:17:20,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-03-03 16:17:20,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:20,239 INFO L225 Difference]: With dead ends: 3330 [2025-03-03 16:17:20,239 INFO L226 Difference]: Without dead ends: 2987 [2025-03-03 16:17:20,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:20,241 INFO L435 NwaCegarLoop]: 1687 mSDtfsCounter, 1524 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:20,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 1789 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:17:20,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2025-03-03 16:17:20,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 2985. [2025-03-03 16:17:20,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2985 states, 2983 states have (on average 1.5605095541401275) internal successors, (4655), 2984 states have internal predecessors, (4655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:20,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2985 states to 2985 states and 4655 transitions. [2025-03-03 16:17:20,279 INFO L78 Accepts]: Start accepts. Automaton has 2985 states and 4655 transitions. Word has length 94 [2025-03-03 16:17:20,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:20,279 INFO L471 AbstractCegarLoop]: Abstraction has 2985 states and 4655 transitions. [2025-03-03 16:17:20,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:20,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2985 states and 4655 transitions. [2025-03-03 16:17:20,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 16:17:20,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:20,280 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:17:20,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:17:20,280 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:20,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:20,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1392174349, now seen corresponding path program 1 times [2025-03-03 16:17:20,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:20,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261192888] [2025-03-03 16:17:20,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:20,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:20,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 16:17:20,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 16:17:20,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:20,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:20,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:17:20,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:20,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261192888] [2025-03-03 16:17:20,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261192888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:20,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:20,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:17:20,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914058033] [2025-03-03 16:17:20,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:20,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:17:20,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:20,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:17:20,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:20,351 INFO L87 Difference]: Start difference. First operand 2985 states and 4655 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:20,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:20,386 INFO L93 Difference]: Finished difference Result 4257 states and 6637 transitions. [2025-03-03 16:17:20,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:17:20,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-03-03 16:17:20,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:20,396 INFO L225 Difference]: With dead ends: 4257 [2025-03-03 16:17:20,396 INFO L226 Difference]: Without dead ends: 3597 [2025-03-03 16:17:20,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:20,398 INFO L435 NwaCegarLoop]: 1685 mSDtfsCounter, 1522 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:20,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 1791 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:17:20,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3597 states. [2025-03-03 16:17:20,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3597 to 3595. [2025-03-03 16:17:20,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3595 states, 3593 states have (on average 1.5560812691344281) internal successors, (5591), 3594 states have internal predecessors, (5591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:20,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 3595 states and 5591 transitions. [2025-03-03 16:17:20,451 INFO L78 Accepts]: Start accepts. Automaton has 3595 states and 5591 transitions. Word has length 94 [2025-03-03 16:17:20,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:20,451 INFO L471 AbstractCegarLoop]: Abstraction has 3595 states and 5591 transitions. [2025-03-03 16:17:20,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:20,452 INFO L276 IsEmpty]: Start isEmpty. Operand 3595 states and 5591 transitions. [2025-03-03 16:17:20,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 16:17:20,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:20,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:17:20,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:17:20,453 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:20,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:20,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1237805517, now seen corresponding path program 1 times [2025-03-03 16:17:20,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:20,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662511596] [2025-03-03 16:17:20,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:20,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:20,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 16:17:20,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 16:17:20,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:20,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:20,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:17:20,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:20,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662511596] [2025-03-03 16:17:20,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662511596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:20,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:20,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:17:20,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173253643] [2025-03-03 16:17:20,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:20,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:17:20,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:20,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:17:20,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:20,596 INFO L87 Difference]: Start difference. First operand 3595 states and 5591 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:20,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:20,678 INFO L93 Difference]: Finished difference Result 6039 states and 9361 transitions. [2025-03-03 16:17:20,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:17:20,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-03-03 16:17:20,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:20,704 INFO L225 Difference]: With dead ends: 6039 [2025-03-03 16:17:20,704 INFO L226 Difference]: Without dead ends: 4769 [2025-03-03 16:17:20,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:20,714 INFO L435 NwaCegarLoop]: 1683 mSDtfsCounter, 1520 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:20,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 1793 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:17:20,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states. [2025-03-03 16:17:20,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 4767. [2025-03-03 16:17:20,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4767 states, 4765 states have (on average 1.5460650577124868) internal successors, (7367), 4766 states have internal predecessors, (7367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:20,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4767 states to 4767 states and 7367 transitions. [2025-03-03 16:17:20,861 INFO L78 Accepts]: Start accepts. Automaton has 4767 states and 7367 transitions. Word has length 94 [2025-03-03 16:17:20,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:20,861 INFO L471 AbstractCegarLoop]: Abstraction has 4767 states and 7367 transitions. [2025-03-03 16:17:20,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:20,862 INFO L276 IsEmpty]: Start isEmpty. Operand 4767 states and 7367 transitions. [2025-03-03 16:17:20,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 16:17:20,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:20,863 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:17:20,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:17:20,863 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:20,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:20,863 INFO L85 PathProgramCache]: Analyzing trace with hash 258875021, now seen corresponding path program 1 times [2025-03-03 16:17:20,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:20,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748674617] [2025-03-03 16:17:20,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:20,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:20,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 16:17:20,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 16:17:20,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:20,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:20,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:17:20,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:20,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748674617] [2025-03-03 16:17:20,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748674617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:20,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:20,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:17:20,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22516130] [2025-03-03 16:17:20,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:20,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:17:20,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:20,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:17:20,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:20,931 INFO L87 Difference]: Start difference. First operand 4767 states and 7367 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:20,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:20,999 INFO L93 Difference]: Finished difference Result 9459 states and 14521 transitions. [2025-03-03 16:17:20,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:17:20,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-03-03 16:17:20,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:21,012 INFO L225 Difference]: With dead ends: 9459 [2025-03-03 16:17:21,012 INFO L226 Difference]: Without dead ends: 7017 [2025-03-03 16:17:21,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:21,018 INFO L435 NwaCegarLoop]: 1681 mSDtfsCounter, 1518 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 1795 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:21,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 1795 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:17:21,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7017 states. [2025-03-03 16:17:21,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7017 to 7015. [2025-03-03 16:17:21,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7015 states, 7013 states have (on average 1.5295879081705404) internal successors, (10727), 7014 states have internal predecessors, (10727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:21,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7015 states to 7015 states and 10727 transitions. [2025-03-03 16:17:21,166 INFO L78 Accepts]: Start accepts. Automaton has 7015 states and 10727 transitions. Word has length 94 [2025-03-03 16:17:21,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:21,167 INFO L471 AbstractCegarLoop]: Abstraction has 7015 states and 10727 transitions. [2025-03-03 16:17:21,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:21,167 INFO L276 IsEmpty]: Start isEmpty. Operand 7015 states and 10727 transitions. [2025-03-03 16:17:21,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 16:17:21,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:21,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:17:21,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:17:21,168 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:21,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:21,168 INFO L85 PathProgramCache]: Analyzing trace with hash -189070515, now seen corresponding path program 1 times [2025-03-03 16:17:21,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:21,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458509904] [2025-03-03 16:17:21,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:21,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:21,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 16:17:21,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 16:17:21,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:21,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:21,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:17:21,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:21,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458509904] [2025-03-03 16:17:21,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458509904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:21,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:21,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:17:21,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039268040] [2025-03-03 16:17:21,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:21,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:17:21,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:21,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:17:21,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:21,232 INFO L87 Difference]: Start difference. First operand 7015 states and 10727 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:21,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:21,328 INFO L93 Difference]: Finished difference Result 16011 states and 24265 transitions. [2025-03-03 16:17:21,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:17:21,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-03-03 16:17:21,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:21,347 INFO L225 Difference]: With dead ends: 16011 [2025-03-03 16:17:21,348 INFO L226 Difference]: Without dead ends: 11321 [2025-03-03 16:17:21,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:21,357 INFO L435 NwaCegarLoop]: 1679 mSDtfsCounter, 1516 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:21,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1797 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:17:21,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11321 states. [2025-03-03 16:17:21,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11321 to 11319. [2025-03-03 16:17:21,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11319 states, 11317 states have (on average 1.507731731024123) internal successors, (17063), 11318 states have internal predecessors, (17063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:21,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11319 states to 11319 states and 17063 transitions. [2025-03-03 16:17:21,604 INFO L78 Accepts]: Start accepts. Automaton has 11319 states and 17063 transitions. Word has length 94 [2025-03-03 16:17:21,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:21,604 INFO L471 AbstractCegarLoop]: Abstraction has 11319 states and 17063 transitions. [2025-03-03 16:17:21,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:21,604 INFO L276 IsEmpty]: Start isEmpty. Operand 11319 states and 17063 transitions. [2025-03-03 16:17:21,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 16:17:21,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:21,605 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:17:21,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:17:21,606 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:21,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:21,606 INFO L85 PathProgramCache]: Analyzing trace with hash 226105357, now seen corresponding path program 1 times [2025-03-03 16:17:21,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:21,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659382307] [2025-03-03 16:17:21,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:21,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:21,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 16:17:21,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 16:17:21,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:21,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:21,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:17:21,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:21,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659382307] [2025-03-03 16:17:21,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659382307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:21,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:21,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:17:21,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088437239] [2025-03-03 16:17:21,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:21,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:17:21,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:21,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:17:21,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:21,669 INFO L87 Difference]: Start difference. First operand 11319 states and 17063 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:21,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:21,927 INFO L93 Difference]: Finished difference Result 28539 states and 42601 transitions. [2025-03-03 16:17:21,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:17:21,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-03-03 16:17:21,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:22,000 INFO L225 Difference]: With dead ends: 28539 [2025-03-03 16:17:22,000 INFO L226 Difference]: Without dead ends: 19545 [2025-03-03 16:17:22,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:22,025 INFO L435 NwaCegarLoop]: 1677 mSDtfsCounter, 1514 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:22,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1799 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:17:22,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19545 states. [2025-03-03 16:17:22,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19545 to 19543. [2025-03-03 16:17:22,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19543 states, 19541 states have (on average 1.4823704006959726) internal successors, (28967), 19542 states have internal predecessors, (28967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:22,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19543 states to 19543 states and 28967 transitions. [2025-03-03 16:17:22,563 INFO L78 Accepts]: Start accepts. Automaton has 19543 states and 28967 transitions. Word has length 94 [2025-03-03 16:17:22,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:22,563 INFO L471 AbstractCegarLoop]: Abstraction has 19543 states and 28967 transitions. [2025-03-03 16:17:22,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:22,563 INFO L276 IsEmpty]: Start isEmpty. Operand 19543 states and 28967 transitions. [2025-03-03 16:17:22,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 16:17:22,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:22,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:17:22,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:17:22,565 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:22,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:22,566 INFO L85 PathProgramCache]: Analyzing trace with hash -260612915, now seen corresponding path program 1 times [2025-03-03 16:17:22,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:22,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910742308] [2025-03-03 16:17:22,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:22,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:22,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 16:17:22,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 16:17:22,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:22,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:22,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:17:22,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:22,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910742308] [2025-03-03 16:17:22,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910742308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:22,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:22,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:17:22,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849278704] [2025-03-03 16:17:22,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:22,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:17:22,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:22,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:17:22,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:22,641 INFO L87 Difference]: Start difference. First operand 19543 states and 28967 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:23,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:23,351 INFO L93 Difference]: Finished difference Result 52443 states and 76969 transitions. [2025-03-03 16:17:23,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:17:23,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-03-03 16:17:23,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:23,426 INFO L225 Difference]: With dead ends: 52443 [2025-03-03 16:17:23,427 INFO L226 Difference]: Without dead ends: 35225 [2025-03-03 16:17:23,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:23,460 INFO L435 NwaCegarLoop]: 1675 mSDtfsCounter, 1512 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:23,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1801 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:17:23,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35225 states. [2025-03-03 16:17:24,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35225 to 35223. [2025-03-03 16:17:24,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35223 states, 35221 states have (on average 1.4547854972885494) internal successors, (51239), 35222 states have internal predecessors, (51239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:24,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35223 states to 35223 states and 51239 transitions. [2025-03-03 16:17:24,205 INFO L78 Accepts]: Start accepts. Automaton has 35223 states and 51239 transitions. Word has length 94 [2025-03-03 16:17:24,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:24,206 INFO L471 AbstractCegarLoop]: Abstraction has 35223 states and 51239 transitions. [2025-03-03 16:17:24,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:24,206 INFO L276 IsEmpty]: Start isEmpty. Operand 35223 states and 51239 transitions. [2025-03-03 16:17:24,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 16:17:24,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:24,214 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:17:24,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:17:24,215 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:24,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:24,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1654830979, now seen corresponding path program 1 times [2025-03-03 16:17:24,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:24,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408150857] [2025-03-03 16:17:24,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:24,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:24,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 16:17:24,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 16:17:24,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:24,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:24,519 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:17:24,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:24,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408150857] [2025-03-03 16:17:24,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408150857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:24,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:24,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 16:17:24,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648302208] [2025-03-03 16:17:24,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:24,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:17:24,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:24,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:17:24,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:17:24,522 INFO L87 Difference]: Start difference. First operand 35223 states and 51239 transitions. Second operand has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:28,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:28,169 INFO L93 Difference]: Finished difference Result 295209 states and 427312 transitions. [2025-03-03 16:17:28,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:17:28,169 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 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 119 [2025-03-03 16:17:28,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:28,641 INFO L225 Difference]: With dead ends: 295209 [2025-03-03 16:17:28,641 INFO L226 Difference]: Without dead ends: 272167 [2025-03-03 16:17:28,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-03 16:17:28,702 INFO L435 NwaCegarLoop]: 1703 mSDtfsCounter, 11627 mSDsluCounter, 3924 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11627 SdHoareTripleChecker+Valid, 5627 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:28,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11627 Valid, 5627 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:17:28,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272167 states. [2025-03-03 16:17:31,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272167 to 63255. [2025-03-03 16:17:31,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63255 states, 63253 states have (on average 1.4454808467582565) internal successors, (91431), 63254 states have internal predecessors, (91431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:31,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63255 states to 63255 states and 91431 transitions. [2025-03-03 16:17:32,005 INFO L78 Accepts]: Start accepts. Automaton has 63255 states and 91431 transitions. Word has length 119 [2025-03-03 16:17:32,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:32,008 INFO L471 AbstractCegarLoop]: Abstraction has 63255 states and 91431 transitions. [2025-03-03 16:17:32,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:32,009 INFO L276 IsEmpty]: Start isEmpty. Operand 63255 states and 91431 transitions. [2025-03-03 16:17:32,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 16:17:32,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:32,022 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:17:32,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:17:32,023 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:32,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:32,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1646189635, now seen corresponding path program 1 times [2025-03-03 16:17:32,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:32,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026778220] [2025-03-03 16:17:32,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:32,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:32,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 16:17:32,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 16:17:32,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:32,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 16:17:32,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:32,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026778220] [2025-03-03 16:17:32,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026778220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:32,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:32,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 16:17:32,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643107325] [2025-03-03 16:17:32,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:32,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:17:32,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:32,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:17:32,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:17:32,250 INFO L87 Difference]: Start difference. First operand 63255 states and 91431 transitions. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:37,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:37,433 INFO L93 Difference]: Finished difference Result 328105 states and 474672 transitions. [2025-03-03 16:17:37,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:17:37,433 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 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 119 [2025-03-03 16:17:37,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:37,931 INFO L225 Difference]: With dead ends: 328105 [2025-03-03 16:17:37,932 INFO L226 Difference]: Without dead ends: 295207 [2025-03-03 16:17:38,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-03 16:17:38,001 INFO L435 NwaCegarLoop]: 1702 mSDtfsCounter, 11629 mSDsluCounter, 3870 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11629 SdHoareTripleChecker+Valid, 5572 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:38,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11629 Valid, 5572 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:17:38,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295207 states. [2025-03-03 16:17:41,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295207 to 107671. [2025-03-03 16:17:41,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107671 states, 107669 states have (on average 1.4400338073168693) internal successors, (155047), 107670 states have internal predecessors, (155047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:42,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107671 states to 107671 states and 155047 transitions. [2025-03-03 16:17:42,056 INFO L78 Accepts]: Start accepts. Automaton has 107671 states and 155047 transitions. Word has length 119 [2025-03-03 16:17:42,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:42,056 INFO L471 AbstractCegarLoop]: Abstraction has 107671 states and 155047 transitions. [2025-03-03 16:17:42,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:42,056 INFO L276 IsEmpty]: Start isEmpty. Operand 107671 states and 155047 transitions. [2025-03-03 16:17:42,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 16:17:42,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:42,066 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:17:42,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:17:42,067 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:42,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:42,067 INFO L85 PathProgramCache]: Analyzing trace with hash -673369853, now seen corresponding path program 1 times [2025-03-03 16:17:42,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:42,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899213792] [2025-03-03 16:17:42,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:42,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:42,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 16:17:42,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 16:17:42,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:42,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 16:17:42,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:42,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899213792] [2025-03-03 16:17:42,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899213792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:42,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:42,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 16:17:42,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957683908] [2025-03-03 16:17:42,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:42,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:17:42,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:42,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:17:42,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:17:42,441 INFO L87 Difference]: Start difference. First operand 107671 states and 155047 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:49,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:49,333 INFO L93 Difference]: Finished difference Result 361001 states and 521904 transitions. [2025-03-03 16:17:49,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:17:49,333 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 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 119 [2025-03-03 16:17:49,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:49,851 INFO L225 Difference]: With dead ends: 361001 [2025-03-03 16:17:49,851 INFO L226 Difference]: Without dead ends: 328103 [2025-03-03 16:17:49,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-03 16:17:49,925 INFO L435 NwaCegarLoop]: 1700 mSDtfsCounter, 11653 mSDsluCounter, 3754 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11653 SdHoareTripleChecker+Valid, 5454 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:49,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11653 Valid, 5454 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:17:50,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328103 states.