./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.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/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.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 87c0d05d6e0355591807918f29d7510d5603d16064875313848d28b6b97f865e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:08:07,519 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:08:07,579 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:08:07,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:08:07,586 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:08:07,600 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:08:07,600 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:08:07,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:08:07,604 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:08:07,604 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:08:07,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:08:07,604 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:08:07,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:08:07,605 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:08:07,605 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:08:07,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:08:07,605 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:08:07,605 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:08:07,605 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:08:07,605 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:08:07,606 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:08:07,606 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:08:07,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:08:07,606 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:08:07,606 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:08:07,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:08:07,606 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:08:07,606 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:08:07,606 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:08:07,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:08:07,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:08:07,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:08:07,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:08:07,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:08:07,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:08:07,607 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:08:07,607 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:08:07,607 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:08:07,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:08:07,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:08:07,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:08:07,608 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:08:07,608 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:08:07,608 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 -> 87c0d05d6e0355591807918f29d7510d5603d16064875313848d28b6b97f865e [2025-03-03 15:08:07,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:08:07,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:08:07,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:08:07,839 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:08:07,840 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:08:07,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2025-03-03 15:08:09,043 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcf7571ac/5ec312f7c64d41459907ebbd014f5e3a/FLAG0358ecbe4 [2025-03-03 15:08:09,281 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:08:09,284 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2025-03-03 15:08:09,293 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcf7571ac/5ec312f7c64d41459907ebbd014f5e3a/FLAG0358ecbe4 [2025-03-03 15:08:09,311 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcf7571ac/5ec312f7c64d41459907ebbd014f5e3a [2025-03-03 15:08:09,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:08:09,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:08:09,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:08:09,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:08:09,321 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:08:09,322 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:08:09" (1/1) ... [2025-03-03 15:08:09,323 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ccb9fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:09, skipping insertion in model container [2025-03-03 15:08:09,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:08:09" (1/1) ... [2025-03-03 15:08:09,350 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:08:09,505 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/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[5337,5350] [2025-03-03 15:08:09,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:08:09,559 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:08:09,593 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/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[5337,5350] [2025-03-03 15:08:09,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:08:09,630 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:08:09,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:09 WrapperNode [2025-03-03 15:08:09,631 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:08:09,632 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:08:09,632 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:08:09,632 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:08:09,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:09" (1/1) ... [2025-03-03 15:08:09,645 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:09" (1/1) ... [2025-03-03 15:08:09,671 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 470 [2025-03-03 15:08:09,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:08:09,671 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:08:09,672 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:08:09,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:08:09,682 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:09" (1/1) ... [2025-03-03 15:08:09,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:09" (1/1) ... [2025-03-03 15:08:09,684 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:09" (1/1) ... [2025-03-03 15:08:09,707 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 15:08:09,709 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:09" (1/1) ... [2025-03-03 15:08:09,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:09" (1/1) ... [2025-03-03 15:08:09,719 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:09" (1/1) ... [2025-03-03 15:08:09,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:09" (1/1) ... [2025-03-03 15:08:09,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:09" (1/1) ... [2025-03-03 15:08:09,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:09" (1/1) ... [2025-03-03 15:08:09,727 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:08:09,728 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:08:09,729 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:08:09,729 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:08:09,730 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:09" (1/1) ... [2025-03-03 15:08:09,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:08:09,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:08:09,755 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 15:08:09,757 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 15:08:09,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:08:09,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:08:09,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:08:09,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:08:09,853 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:08:09,855 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:08:10,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L349: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-03 15:08:10,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node4__m4~0#1; [2025-03-03 15:08:10,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L435: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-03 15:08:10,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L321: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-03 15:08:10,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L521: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-03 15:08:10,239 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L407: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:08:10,239 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L607: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-03 15:08:10,239 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L493: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:08:10,240 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L163: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:08:10,240 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L182: havoc main_~node2__m2~0#1; [2025-03-03 15:08:10,240 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L579: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:08:10,240 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-03 15:08:10,240 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L200: havoc main_~node3__m3~0#1; [2025-03-03 15:08:10,264 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2025-03-03 15:08:10,264 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:08:10,272 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:08:10,272 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:08:10,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:08:10 BoogieIcfgContainer [2025-03-03 15:08:10,272 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:08:10,274 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:08:10,274 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:08:10,280 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:08:10,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:08:09" (1/3) ... [2025-03-03 15:08:10,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f6b6deb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:08:10, skipping insertion in model container [2025-03-03 15:08:10,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:09" (2/3) ... [2025-03-03 15:08:10,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f6b6deb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:08:10, skipping insertion in model container [2025-03-03 15:08:10,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:08:10" (3/3) ... [2025-03-03 15:08:10,283 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2025-03-03 15:08:10,294 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:08:10,296 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c that has 1 procedures, 110 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:08:10,337 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:08:10,344 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;@19973403, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:08:10,345 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:08:10,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 108 states have (on average 1.6944444444444444) internal successors, (183), 109 states have internal predecessors, (183), 0 states have call successors, (0), 0 states 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 15:08:10,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 15:08:10,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:10,353 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 15:08:10,354 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:10,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:10,357 INFO L85 PathProgramCache]: Analyzing trace with hash -616511005, now seen corresponding path program 1 times [2025-03-03 15:08:10,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:10,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915172066] [2025-03-03 15:08:10,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:10,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:10,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 15:08:10,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 15:08:10,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:10,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:10,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 15:08:10,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:10,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915172066] [2025-03-03 15:08:10,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915172066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:10,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:10,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:10,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061673470] [2025-03-03 15:08:10,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:10,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:10,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:10,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:10,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:10,687 INFO L87 Difference]: Start difference. First operand has 110 states, 108 states have (on average 1.6944444444444444) internal successors, (183), 109 states have internal predecessors, (183), 0 states have call successors, (0), 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 3 states, 3 states have (on average 16.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 15:08:10,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:10,739 INFO L93 Difference]: Finished difference Result 260 states and 419 transitions. [2025-03-03 15:08:10,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:10,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.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 15:08:10,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:10,747 INFO L225 Difference]: With dead ends: 260 [2025-03-03 15:08:10,747 INFO L226 Difference]: Without dead ends: 171 [2025-03-03 15:08:10,749 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 15:08:10,750 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 137 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:10,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 401 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:10,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-03 15:08:10,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2025-03-03 15:08:10,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.505952380952381) internal successors, (253), 168 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:10,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 253 transitions. [2025-03-03 15:08:10,777 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 253 transitions. Word has length 48 [2025-03-03 15:08:10,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:10,778 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 253 transitions. [2025-03-03 15:08:10,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.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 15:08:10,778 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 253 transitions. [2025-03-03 15:08:10,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 15:08:10,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:10,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:10,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:08:10,779 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:10,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:10,780 INFO L85 PathProgramCache]: Analyzing trace with hash -647596985, now seen corresponding path program 1 times [2025-03-03 15:08:10,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:10,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85990181] [2025-03-03 15:08:10,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:10,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:10,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 15:08:10,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 15:08:10,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:10,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:10,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 15:08:10,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:10,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85990181] [2025-03-03 15:08:10,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85990181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:10,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:10,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:10,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035693272] [2025-03-03 15:08:10,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:10,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:10,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:10,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:10,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:10,876 INFO L87 Difference]: Start difference. First operand 169 states and 253 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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 15:08:10,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:10,906 INFO L93 Difference]: Finished difference Result 421 states and 653 transitions. [2025-03-03 15:08:10,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:10,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-03-03 15:08:10,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:10,907 INFO L225 Difference]: With dead ends: 421 [2025-03-03 15:08:10,907 INFO L226 Difference]: Without dead ends: 279 [2025-03-03 15:08:10,908 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 15:08:10,908 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 110 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:10,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 348 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:10,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-03 15:08:10,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2025-03-03 15:08:10,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.536231884057971) internal successors, (424), 276 states have internal predecessors, (424), 0 states have call successors, (0), 0 states 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 15:08:10,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 424 transitions. [2025-03-03 15:08:10,923 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 424 transitions. Word has length 49 [2025-03-03 15:08:10,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:10,923 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 424 transitions. [2025-03-03 15:08:10,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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 15:08:10,924 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 424 transitions. [2025-03-03 15:08:10,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 15:08:10,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:10,924 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] [2025-03-03 15:08:10,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:08:10,925 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:10,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:10,925 INFO L85 PathProgramCache]: Analyzing trace with hash 521412157, now seen corresponding path program 1 times [2025-03-03 15:08:10,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:10,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227887612] [2025-03-03 15:08:10,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:10,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:10,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 15:08:10,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 15:08:10,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:10,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:10,991 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 15:08:10,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:10,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227887612] [2025-03-03 15:08:10,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227887612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:10,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:10,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:10,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615781518] [2025-03-03 15:08:10,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:10,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:10,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:10,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:10,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:10,993 INFO L87 Difference]: Start difference. First operand 277 states and 424 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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 15:08:11,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:11,016 INFO L93 Difference]: Finished difference Result 713 states and 1114 transitions. [2025-03-03 15:08:11,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:11,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-03-03 15:08:11,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:11,021 INFO L225 Difference]: With dead ends: 713 [2025-03-03 15:08:11,021 INFO L226 Difference]: Without dead ends: 463 [2025-03-03 15:08:11,022 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 15:08:11,025 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 105 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:11,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 333 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:11,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-03-03 15:08:11,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 461. [2025-03-03 15:08:11,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 1.5478260869565217) internal successors, (712), 460 states have internal predecessors, (712), 0 states have call successors, (0), 0 states 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 15:08:11,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 712 transitions. [2025-03-03 15:08:11,048 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 712 transitions. Word has length 50 [2025-03-03 15:08:11,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:11,048 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 712 transitions. [2025-03-03 15:08:11,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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 15:08:11,048 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 712 transitions. [2025-03-03 15:08:11,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 15:08:11,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:11,051 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] [2025-03-03 15:08:11,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:08:11,051 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:11,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:11,052 INFO L85 PathProgramCache]: Analyzing trace with hash 702265313, now seen corresponding path program 1 times [2025-03-03 15:08:11,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:11,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165491208] [2025-03-03 15:08:11,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:11,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:11,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 15:08:11,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 15:08:11,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:11,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:11,130 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 15:08:11,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:11,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165491208] [2025-03-03 15:08:11,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165491208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:11,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:11,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:11,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848794510] [2025-03-03 15:08:11,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:11,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:11,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:11,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:11,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:11,131 INFO L87 Difference]: Start difference. First operand 461 states and 712 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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 15:08:11,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:11,154 INFO L93 Difference]: Finished difference Result 1201 states and 1874 transitions. [2025-03-03 15:08:11,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:11,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-03-03 15:08:11,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:11,160 INFO L225 Difference]: With dead ends: 1201 [2025-03-03 15:08:11,161 INFO L226 Difference]: Without dead ends: 767 [2025-03-03 15:08:11,162 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 15:08:11,162 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 100 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:11,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 318 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:11,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2025-03-03 15:08:11,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 765. [2025-03-03 15:08:11,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 764 states have (on average 1.544502617801047) internal successors, (1180), 764 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states 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 15:08:11,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1180 transitions. [2025-03-03 15:08:11,190 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1180 transitions. Word has length 51 [2025-03-03 15:08:11,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:11,190 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1180 transitions. [2025-03-03 15:08:11,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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 15:08:11,191 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1180 transitions. [2025-03-03 15:08:11,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 15:08:11,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:11,192 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] [2025-03-03 15:08:11,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:08:11,192 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:11,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:11,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1594895209, now seen corresponding path program 1 times [2025-03-03 15:08:11,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:11,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461681750] [2025-03-03 15:08:11,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:11,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:11,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 15:08:11,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 15:08:11,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:11,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:11,316 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 15:08:11,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:11,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461681750] [2025-03-03 15:08:11,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461681750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:11,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:11,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:11,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012707282] [2025-03-03 15:08:11,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:11,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:11,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:11,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:11,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:11,319 INFO L87 Difference]: Start difference. First operand 765 states and 1180 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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 15:08:11,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:11,445 INFO L93 Difference]: Finished difference Result 4455 states and 6945 transitions. [2025-03-03 15:08:11,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:11,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-03-03 15:08:11,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:11,462 INFO L225 Difference]: With dead ends: 4455 [2025-03-03 15:08:11,462 INFO L226 Difference]: Without dead ends: 3717 [2025-03-03 15:08:11,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:11,466 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 904 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:11,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 1334 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:11,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3717 states. [2025-03-03 15:08:11,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3717 to 1501. [2025-03-03 15:08:11,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1500 states have (on average 1.5333333333333334) internal successors, (2300), 1500 states have internal predecessors, (2300), 0 states have call successors, (0), 0 states 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 15:08:11,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 2300 transitions. [2025-03-03 15:08:11,525 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 2300 transitions. Word has length 52 [2025-03-03 15:08:11,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:11,526 INFO L471 AbstractCegarLoop]: Abstraction has 1501 states and 2300 transitions. [2025-03-03 15:08:11,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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 15:08:11,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 2300 transitions. [2025-03-03 15:08:11,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 15:08:11,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:11,530 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] [2025-03-03 15:08:11,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:08:11,530 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:11,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:11,531 INFO L85 PathProgramCache]: Analyzing trace with hash 2098811441, now seen corresponding path program 1 times [2025-03-03 15:08:11,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:11,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244025891] [2025-03-03 15:08:11,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:11,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:11,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 15:08:11,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 15:08:11,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:11,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:11,724 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 15:08:11,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:11,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244025891] [2025-03-03 15:08:11,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244025891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:11,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:11,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:11,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118973119] [2025-03-03 15:08:11,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:11,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:11,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:11,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:11,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:11,727 INFO L87 Difference]: Start difference. First operand 1501 states and 2300 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 15:08:11,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:11,814 INFO L93 Difference]: Finished difference Result 6501 states and 9920 transitions. [2025-03-03 15:08:11,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:11,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-03-03 15:08:11,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:11,828 INFO L225 Difference]: With dead ends: 6501 [2025-03-03 15:08:11,828 INFO L226 Difference]: Without dead ends: 5027 [2025-03-03 15:08:11,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:11,833 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 638 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:11,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 478 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:11,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5027 states. [2025-03-03 15:08:11,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5027 to 5021. [2025-03-03 15:08:11,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5021 states, 5020 states have (on average 1.5163346613545816) internal successors, (7612), 5020 states have internal predecessors, (7612), 0 states have call successors, (0), 0 states 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 15:08:11,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5021 states to 5021 states and 7612 transitions. [2025-03-03 15:08:11,946 INFO L78 Accepts]: Start accepts. Automaton has 5021 states and 7612 transitions. Word has length 53 [2025-03-03 15:08:11,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:11,946 INFO L471 AbstractCegarLoop]: Abstraction has 5021 states and 7612 transitions. [2025-03-03 15:08:11,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 15:08:11,946 INFO L276 IsEmpty]: Start isEmpty. Operand 5021 states and 7612 transitions. [2025-03-03 15:08:11,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 15:08:11,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:11,948 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] [2025-03-03 15:08:11,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:08:11,949 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:11,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:11,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1673310925, now seen corresponding path program 1 times [2025-03-03 15:08:11,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:11,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026302902] [2025-03-03 15:08:11,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:11,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:11,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 15:08:11,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 15:08:11,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:11,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:12,222 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 15:08:12,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:12,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026302902] [2025-03-03 15:08:12,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026302902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:12,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:12,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:08:12,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585346860] [2025-03-03 15:08:12,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:12,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:08:12,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:12,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:08:12,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:08:12,224 INFO L87 Difference]: Start difference. First operand 5021 states and 7612 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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 15:08:12,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:12,261 INFO L93 Difference]: Finished difference Result 5279 states and 7997 transitions. [2025-03-03 15:08:12,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:08:12,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-03-03 15:08:12,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:12,276 INFO L225 Difference]: With dead ends: 5279 [2025-03-03 15:08:12,276 INFO L226 Difference]: Without dead ends: 5277 [2025-03-03 15:08:12,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 15:08:12,279 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:12,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 593 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:12,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5277 states. [2025-03-03 15:08:12,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5277 to 5277. [2025-03-03 15:08:12,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5277 states, 5276 states have (on average 1.491281273692191) internal successors, (7868), 5276 states have internal predecessors, (7868), 0 states have call successors, (0), 0 states 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 15:08:12,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5277 states to 5277 states and 7868 transitions. [2025-03-03 15:08:12,361 INFO L78 Accepts]: Start accepts. Automaton has 5277 states and 7868 transitions. Word has length 55 [2025-03-03 15:08:12,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:12,362 INFO L471 AbstractCegarLoop]: Abstraction has 5277 states and 7868 transitions. [2025-03-03 15:08:12,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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 15:08:12,362 INFO L276 IsEmpty]: Start isEmpty. Operand 5277 states and 7868 transitions. [2025-03-03 15:08:12,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 15:08:12,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:12,363 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:12,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:08:12,363 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:12,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:12,363 INFO L85 PathProgramCache]: Analyzing trace with hash -328262507, now seen corresponding path program 1 times [2025-03-03 15:08:12,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:12,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991041892] [2025-03-03 15:08:12,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:12,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:12,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 15:08:12,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 15:08:12,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:12,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:12,432 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 15:08:12,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:12,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991041892] [2025-03-03 15:08:12,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991041892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:12,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:12,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:12,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994728475] [2025-03-03 15:08:12,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:12,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:12,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:12,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:12,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:12,434 INFO L87 Difference]: Start difference. First operand 5277 states and 7868 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:12,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:12,503 INFO L93 Difference]: Finished difference Result 12891 states and 19236 transitions. [2025-03-03 15:08:12,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:12,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-03 15:08:12,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:12,524 INFO L225 Difference]: With dead ends: 12891 [2025-03-03 15:08:12,525 INFO L226 Difference]: Without dead ends: 7641 [2025-03-03 15:08:12,533 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 15:08:12,534 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 90 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:12,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 309 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:12,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7641 states. [2025-03-03 15:08:12,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7641 to 7639. [2025-03-03 15:08:12,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7639 states, 7638 states have (on average 1.484420005236973) internal successors, (11338), 7638 states have internal predecessors, (11338), 0 states have call successors, (0), 0 states 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 15:08:12,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7639 states to 7639 states and 11338 transitions. [2025-03-03 15:08:12,676 INFO L78 Accepts]: Start accepts. Automaton has 7639 states and 11338 transitions. Word has length 56 [2025-03-03 15:08:12,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:12,676 INFO L471 AbstractCegarLoop]: Abstraction has 7639 states and 11338 transitions. [2025-03-03 15:08:12,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 7639 states and 11338 transitions. [2025-03-03 15:08:12,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:08:12,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:12,681 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:12,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:08:12,681 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:12,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:12,681 INFO L85 PathProgramCache]: Analyzing trace with hash 860101305, now seen corresponding path program 1 times [2025-03-03 15:08:12,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:12,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257434148] [2025-03-03 15:08:12,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:12,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:12,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:08:12,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:08:12,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:12,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:12,996 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:12,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:12,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257434148] [2025-03-03 15:08:12,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257434148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:08:12,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903567418] [2025-03-03 15:08:12,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:12,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:08:12,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:08:12,999 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:08:13,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:08:13,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:08:13,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:08:13,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:13,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:13,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 15:08:13,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:08:13,658 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:13,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:08:14,226 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:14,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903567418] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:08:14,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:08:14,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 21 [2025-03-03 15:08:14,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446643190] [2025-03-03 15:08:14,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:08:14,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 15:08:14,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:14,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 15:08:14,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:08:14,228 INFO L87 Difference]: Start difference. First operand 7639 states and 11338 transitions. Second operand has 21 states, 21 states have (on average 10.571428571428571) internal successors, (222), 21 states have internal predecessors, (222), 0 states have call successors, (0), 0 states 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 15:08:20,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:20,316 INFO L93 Difference]: Finished difference Result 41570 states and 61158 transitions. [2025-03-03 15:08:20,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2025-03-03 15:08:20,317 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.571428571428571) internal successors, (222), 21 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 15:08:20,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:20,376 INFO L225 Difference]: With dead ends: 41570 [2025-03-03 15:08:20,376 INFO L226 Difference]: Without dead ends: 33960 [2025-03-03 15:08:20,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6888 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3260, Invalid=15372, Unknown=0, NotChecked=0, Total=18632 [2025-03-03 15:08:20,390 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 6599 mSDsluCounter, 2134 mSDsCounter, 0 mSdLazyCounter, 2513 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6599 SdHoareTripleChecker+Valid, 2271 SdHoareTripleChecker+Invalid, 2635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:20,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6599 Valid, 2271 Invalid, 2635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2513 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 15:08:20,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33960 states. [2025-03-03 15:08:20,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33960 to 25409. [2025-03-03 15:08:20,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25409 states, 25408 states have (on average 1.463397355163728) internal successors, (37182), 25408 states have internal predecessors, (37182), 0 states have call successors, (0), 0 states 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 15:08:20,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25409 states to 25409 states and 37182 transitions. [2025-03-03 15:08:20,803 INFO L78 Accepts]: Start accepts. Automaton has 25409 states and 37182 transitions. Word has length 77 [2025-03-03 15:08:20,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:20,803 INFO L471 AbstractCegarLoop]: Abstraction has 25409 states and 37182 transitions. [2025-03-03 15:08:20,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.571428571428571) internal successors, (222), 21 states have internal predecessors, (222), 0 states have call successors, (0), 0 states 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 15:08:20,807 INFO L276 IsEmpty]: Start isEmpty. Operand 25409 states and 37182 transitions. [2025-03-03 15:08:20,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 15:08:20,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:20,811 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:20,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 15:08:21,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:08:21,015 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:21,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:21,016 INFO L85 PathProgramCache]: Analyzing trace with hash -92011166, now seen corresponding path program 1 times [2025-03-03 15:08:21,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:21,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362555858] [2025-03-03 15:08:21,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:21,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:21,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:08:21,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:08:21,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:21,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:21,072 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:21,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:21,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362555858] [2025-03-03 15:08:21,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362555858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:21,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:21,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:21,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042901121] [2025-03-03 15:08:21,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:21,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:21,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:21,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:21,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:21,075 INFO L87 Difference]: Start difference. First operand 25409 states and 37182 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:21,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:21,246 INFO L93 Difference]: Finished difference Result 63241 states and 92354 transitions. [2025-03-03 15:08:21,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:21,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-03 15:08:21,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:21,318 INFO L225 Difference]: With dead ends: 63241 [2025-03-03 15:08:21,318 INFO L226 Difference]: Without dead ends: 42685 [2025-03-03 15:08:21,346 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 15:08:21,346 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 87 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:21,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 294 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:21,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42685 states. [2025-03-03 15:08:21,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42685 to 42683. [2025-03-03 15:08:21,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42683 states, 42682 states have (on average 1.445691392155944) internal successors, (61705), 42682 states have internal predecessors, (61705), 0 states have call successors, (0), 0 states 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 15:08:21,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42683 states to 42683 states and 61705 transitions. [2025-03-03 15:08:21,885 INFO L78 Accepts]: Start accepts. Automaton has 42683 states and 61705 transitions. Word has length 78 [2025-03-03 15:08:21,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:21,885 INFO L471 AbstractCegarLoop]: Abstraction has 42683 states and 61705 transitions. [2025-03-03 15:08:21,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:21,885 INFO L276 IsEmpty]: Start isEmpty. Operand 42683 states and 61705 transitions. [2025-03-03 15:08:21,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 15:08:21,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:21,889 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:21,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:08:21,890 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:21,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:21,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1144133248, now seen corresponding path program 1 times [2025-03-03 15:08:21,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:21,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734618459] [2025-03-03 15:08:21,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:21,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:21,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:08:21,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:08:21,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:21,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:22,043 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:22,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:22,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734618459] [2025-03-03 15:08:22,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734618459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:22,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:22,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:22,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706154839] [2025-03-03 15:08:22,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:22,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:22,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:22,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:22,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:22,045 INFO L87 Difference]: Start difference. First operand 42683 states and 61705 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:22,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:22,326 INFO L93 Difference]: Finished difference Result 107723 states and 155097 transitions. [2025-03-03 15:08:22,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:22,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-03 15:08:22,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:22,489 INFO L225 Difference]: With dead ends: 107723 [2025-03-03 15:08:22,490 INFO L226 Difference]: Without dead ends: 70062 [2025-03-03 15:08:22,516 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 15:08:22,516 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 88 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:22,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 313 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:22,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70062 states. [2025-03-03 15:08:23,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70062 to 68380. [2025-03-03 15:08:23,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68380 states, 68379 states have (on average 1.4263004723672472) internal successors, (97529), 68379 states have internal predecessors, (97529), 0 states have call successors, (0), 0 states 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 15:08:23,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68380 states to 68380 states and 97529 transitions. [2025-03-03 15:08:23,651 INFO L78 Accepts]: Start accepts. Automaton has 68380 states and 97529 transitions. Word has length 78 [2025-03-03 15:08:23,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:23,652 INFO L471 AbstractCegarLoop]: Abstraction has 68380 states and 97529 transitions. [2025-03-03 15:08:23,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:23,652 INFO L276 IsEmpty]: Start isEmpty. Operand 68380 states and 97529 transitions. [2025-03-03 15:08:23,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 15:08:23,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:23,657 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:23,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:08:23,657 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:23,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:23,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1478845542, now seen corresponding path program 1 times [2025-03-03 15:08:23,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:23,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701156423] [2025-03-03 15:08:23,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:23,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:23,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:08:23,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:08:23,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:23,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:23,774 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 15:08:23,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:23,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701156423] [2025-03-03 15:08:23,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701156423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:23,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:23,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:23,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405994118] [2025-03-03 15:08:23,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:23,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:23,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:23,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:23,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:23,776 INFO L87 Difference]: Start difference. First operand 68380 states and 97529 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 15:08:24,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:24,125 INFO L93 Difference]: Finished difference Result 167703 states and 240884 transitions. [2025-03-03 15:08:24,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:24,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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 78 [2025-03-03 15:08:24,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:24,325 INFO L225 Difference]: With dead ends: 167703 [2025-03-03 15:08:24,326 INFO L226 Difference]: Without dead ends: 141605 [2025-03-03 15:08:24,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:24,563 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 767 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:24,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 926 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:24,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141605 states. [2025-03-03 15:08:25,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141605 to 93985. [2025-03-03 15:08:25,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93985 states, 93984 states have (on average 1.4221037623425263) internal successors, (133655), 93984 states have internal predecessors, (133655), 0 states have call successors, (0), 0 states 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 15:08:25,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93985 states to 93985 states and 133655 transitions. [2025-03-03 15:08:25,827 INFO L78 Accepts]: Start accepts. Automaton has 93985 states and 133655 transitions. Word has length 78 [2025-03-03 15:08:25,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:25,827 INFO L471 AbstractCegarLoop]: Abstraction has 93985 states and 133655 transitions. [2025-03-03 15:08:25,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 15:08:25,827 INFO L276 IsEmpty]: Start isEmpty. Operand 93985 states and 133655 transitions. [2025-03-03 15:08:25,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 15:08:25,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:25,833 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:25,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:08:25,833 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:25,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:25,833 INFO L85 PathProgramCache]: Analyzing trace with hash -2080871756, now seen corresponding path program 1 times [2025-03-03 15:08:25,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:25,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467836210] [2025-03-03 15:08:25,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:25,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:25,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:08:25,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:08:25,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:25,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:25,883 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:25,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:25,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467836210] [2025-03-03 15:08:25,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467836210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:25,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:25,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:25,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341941901] [2025-03-03 15:08:25,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:25,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:25,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:25,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:25,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:25,884 INFO L87 Difference]: Start difference. First operand 93985 states and 133655 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:26,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:26,311 INFO L93 Difference]: Finished difference Result 162306 states and 230171 transitions. [2025-03-03 15:08:26,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:26,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-03 15:08:26,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:26,455 INFO L225 Difference]: With dead ends: 162306 [2025-03-03 15:08:26,456 INFO L226 Difference]: Without dead ends: 97062 [2025-03-03 15:08:26,520 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 15:08:26,521 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 92 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:26,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 360 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:26,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97062 states. [2025-03-03 15:08:27,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97062 to 85380. [2025-03-03 15:08:27,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85380 states, 85379 states have (on average 1.4072312863818972) internal successors, (120148), 85379 states have internal predecessors, (120148), 0 states have call successors, (0), 0 states 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 15:08:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85380 states to 85380 states and 120148 transitions. [2025-03-03 15:08:27,751 INFO L78 Accepts]: Start accepts. Automaton has 85380 states and 120148 transitions. Word has length 78 [2025-03-03 15:08:27,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:27,752 INFO L471 AbstractCegarLoop]: Abstraction has 85380 states and 120148 transitions. [2025-03-03 15:08:27,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 85380 states and 120148 transitions. [2025-03-03 15:08:27,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 15:08:27,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:27,756 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:27,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:08:27,756 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:27,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:27,757 INFO L85 PathProgramCache]: Analyzing trace with hash -491594500, now seen corresponding path program 1 times [2025-03-03 15:08:27,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:27,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361169260] [2025-03-03 15:08:27,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:27,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:27,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:08:27,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:08:27,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:27,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:27,844 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 15:08:27,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:27,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361169260] [2025-03-03 15:08:27,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361169260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:27,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:27,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:27,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037717583] [2025-03-03 15:08:27,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:27,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:27,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:27,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:27,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:27,846 INFO L87 Difference]: Start difference. First operand 85380 states and 120148 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states 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 15:08:28,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:28,662 INFO L93 Difference]: Finished difference Result 181695 states and 258292 transitions. [2025-03-03 15:08:28,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:28,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 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 78 [2025-03-03 15:08:28,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:28,862 INFO L225 Difference]: With dead ends: 181695 [2025-03-03 15:08:28,862 INFO L226 Difference]: Without dead ends: 153818 [2025-03-03 15:08:28,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:28,893 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 770 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:28,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 1042 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:08:28,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153818 states. [2025-03-03 15:08:30,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153818 to 112661. [2025-03-03 15:08:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112661 states, 112660 states have (on average 1.405432274099059) internal successors, (158336), 112660 states have internal predecessors, (158336), 0 states have call successors, (0), 0 states 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 15:08:30,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112661 states to 112661 states and 158336 transitions. [2025-03-03 15:08:30,364 INFO L78 Accepts]: Start accepts. Automaton has 112661 states and 158336 transitions. Word has length 78 [2025-03-03 15:08:30,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:30,364 INFO L471 AbstractCegarLoop]: Abstraction has 112661 states and 158336 transitions. [2025-03-03 15:08:30,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states 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 15:08:30,364 INFO L276 IsEmpty]: Start isEmpty. Operand 112661 states and 158336 transitions. [2025-03-03 15:08:30,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 15:08:30,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:30,369 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:30,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:08:30,369 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:30,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:30,369 INFO L85 PathProgramCache]: Analyzing trace with hash 330605030, now seen corresponding path program 1 times [2025-03-03 15:08:30,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:30,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238184671] [2025-03-03 15:08:30,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:30,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:30,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:08:30,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:08:30,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:30,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:30,457 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 15:08:30,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:30,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238184671] [2025-03-03 15:08:30,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238184671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:30,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:30,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:30,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209468369] [2025-03-03 15:08:30,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:30,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:30,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:30,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:30,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:30,459 INFO L87 Difference]: Start difference. First operand 112661 states and 158336 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 15:08:31,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:31,129 INFO L93 Difference]: Finished difference Result 211243 states and 299700 transitions. [2025-03-03 15:08:31,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:31,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 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 78 [2025-03-03 15:08:31,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:31,352 INFO L225 Difference]: With dead ends: 211243 [2025-03-03 15:08:31,352 INFO L226 Difference]: Without dead ends: 181130 [2025-03-03 15:08:31,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:31,402 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 771 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:31,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 932 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:31,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181130 states. [2025-03-03 15:08:32,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181130 to 134172. [2025-03-03 15:08:33,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134172 states, 134171 states have (on average 1.404834129580908) internal successors, (188488), 134171 states have internal predecessors, (188488), 0 states have call successors, (0), 0 states 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 15:08:33,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134172 states to 134172 states and 188488 transitions. [2025-03-03 15:08:33,255 INFO L78 Accepts]: Start accepts. Automaton has 134172 states and 188488 transitions. Word has length 78 [2025-03-03 15:08:33,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:33,255 INFO L471 AbstractCegarLoop]: Abstraction has 134172 states and 188488 transitions. [2025-03-03 15:08:33,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 15:08:33,255 INFO L276 IsEmpty]: Start isEmpty. Operand 134172 states and 188488 transitions. [2025-03-03 15:08:33,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:08:33,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:33,260 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:33,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:08:33,260 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:33,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:33,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1935367065, now seen corresponding path program 1 times [2025-03-03 15:08:33,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:33,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574192276] [2025-03-03 15:08:33,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:33,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:33,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:08:33,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:08:33,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:33,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:33,292 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 15:08:33,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:33,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574192276] [2025-03-03 15:08:33,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574192276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:33,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:33,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:33,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580665800] [2025-03-03 15:08:33,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:33,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:33,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:33,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:33,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:33,294 INFO L87 Difference]: Start difference. First operand 134172 states and 188488 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 15:08:34,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:34,038 INFO L93 Difference]: Finished difference Result 264663 states and 372248 transitions. [2025-03-03 15:08:34,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:34,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-03 15:08:34,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:34,201 INFO L225 Difference]: With dead ends: 264663 [2025-03-03 15:08:34,201 INFO L226 Difference]: Without dead ends: 130709 [2025-03-03 15:08:34,290 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 15:08:34,292 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 103 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:34,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 131 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:34,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130709 states. [2025-03-03 15:08:35,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130709 to 129863. [2025-03-03 15:08:35,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129863 states, 129862 states have (on average 1.3974064776455006) internal successors, (181470), 129862 states have internal predecessors, (181470), 0 states have call successors, (0), 0 states 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 15:08:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129863 states to 129863 states and 181470 transitions. [2025-03-03 15:08:36,042 INFO L78 Accepts]: Start accepts. Automaton has 129863 states and 181470 transitions. Word has length 79 [2025-03-03 15:08:36,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:36,043 INFO L471 AbstractCegarLoop]: Abstraction has 129863 states and 181470 transitions. [2025-03-03 15:08:36,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 15:08:36,043 INFO L276 IsEmpty]: Start isEmpty. Operand 129863 states and 181470 transitions. [2025-03-03 15:08:36,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:08:36,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:36,048 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:36,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:08:36,048 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:36,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:36,048 INFO L85 PathProgramCache]: Analyzing trace with hash -460378779, now seen corresponding path program 1 times [2025-03-03 15:08:36,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:36,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096867110] [2025-03-03 15:08:36,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:36,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:36,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:08:36,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:08:36,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:36,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:36,140 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 15:08:36,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:36,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096867110] [2025-03-03 15:08:36,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096867110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:36,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:36,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:36,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392881333] [2025-03-03 15:08:36,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:36,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:36,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:36,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:36,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:36,142 INFO L87 Difference]: Start difference. First operand 129863 states and 181470 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 15:08:37,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:37,089 INFO L93 Difference]: Finished difference Result 206305 states and 290528 transitions. [2025-03-03 15:08:37,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:37,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-03 15:08:37,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:37,342 INFO L225 Difference]: With dead ends: 206305 [2025-03-03 15:08:37,342 INFO L226 Difference]: Without dead ends: 190335 [2025-03-03 15:08:37,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:37,393 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 782 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:37,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 903 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:37,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190335 states. [2025-03-03 15:08:38,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190335 to 145417. [2025-03-03 15:08:38,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145417 states, 145416 states have (on average 1.3979892171425428) internal successors, (203290), 145416 states have internal predecessors, (203290), 0 states have call successors, (0), 0 states 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 15:08:39,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145417 states to 145417 states and 203290 transitions. [2025-03-03 15:08:39,162 INFO L78 Accepts]: Start accepts. Automaton has 145417 states and 203290 transitions. Word has length 79 [2025-03-03 15:08:39,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:39,162 INFO L471 AbstractCegarLoop]: Abstraction has 145417 states and 203290 transitions. [2025-03-03 15:08:39,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 15:08:39,162 INFO L276 IsEmpty]: Start isEmpty. Operand 145417 states and 203290 transitions. [2025-03-03 15:08:39,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 15:08:39,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:39,166 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:08:39,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:08:39,167 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:39,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:39,167 INFO L85 PathProgramCache]: Analyzing trace with hash -248601293, now seen corresponding path program 1 times [2025-03-03 15:08:39,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:39,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646065251] [2025-03-03 15:08:39,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:39,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:39,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 15:08:39,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 15:08:39,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:39,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:39,201 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:39,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:39,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646065251] [2025-03-03 15:08:39,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646065251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:39,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:39,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:39,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722842442] [2025-03-03 15:08:39,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:39,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:39,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:39,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:39,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:39,203 INFO L87 Difference]: Start difference. First operand 145417 states and 203290 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:40,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:40,297 INFO L93 Difference]: Finished difference Result 357004 states and 496604 transitions. [2025-03-03 15:08:40,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:40,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-03 15:08:40,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:40,663 INFO L225 Difference]: With dead ends: 357004 [2025-03-03 15:08:40,663 INFO L226 Difference]: Without dead ends: 228814 [2025-03-03 15:08:40,733 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 15:08:40,733 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 86 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:40,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 353 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:40,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228814 states. [2025-03-03 15:08:42,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228814 to 215597. [2025-03-03 15:08:43,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215597 states, 215596 states have (on average 1.376277853021392) internal successors, (296720), 215596 states have internal predecessors, (296720), 0 states have call successors, (0), 0 states 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 15:08:43,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215597 states to 215597 states and 296720 transitions. [2025-03-03 15:08:43,304 INFO L78 Accepts]: Start accepts. Automaton has 215597 states and 296720 transitions. Word has length 81 [2025-03-03 15:08:43,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:43,305 INFO L471 AbstractCegarLoop]: Abstraction has 215597 states and 296720 transitions. [2025-03-03 15:08:43,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:43,305 INFO L276 IsEmpty]: Start isEmpty. Operand 215597 states and 296720 transitions. [2025-03-03 15:08:43,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 15:08:43,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:43,312 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:43,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:08:43,312 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:43,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:43,312 INFO L85 PathProgramCache]: Analyzing trace with hash -823120975, now seen corresponding path program 1 times [2025-03-03 15:08:43,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:43,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934396881] [2025-03-03 15:08:43,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:43,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:43,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 15:08:43,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 15:08:43,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:43,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:43,807 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:43,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:43,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934396881] [2025-03-03 15:08:43,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934396881] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:08:43,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065447456] [2025-03-03 15:08:43,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:43,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:08:43,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:08:43,810 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:08:43,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:08:43,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 15:08:43,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 15:08:43,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:43,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:43,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:08:43,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:08:44,057 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:44,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:08:44,144 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:44,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065447456] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:08:44,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:08:44,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 15:08:44,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125590113] [2025-03-03 15:08:44,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:08:44,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:08:44,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:44,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:08:44,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:08:44,146 INFO L87 Difference]: Start difference. First operand 215597 states and 296720 transitions. Second operand has 11 states, 11 states have (on average 12.818181818181818) internal successors, (141), 10 states have internal predecessors, (141), 0 states have call successors, (0), 0 states 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 15:08:46,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:46,026 INFO L93 Difference]: Finished difference Result 590851 states and 816756 transitions. [2025-03-03 15:08:46,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:08:46,026 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.818181818181818) internal successors, (141), 10 states have internal predecessors, (141), 0 states have call successors, (0), 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 83 [2025-03-03 15:08:46,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:46,582 INFO L225 Difference]: With dead ends: 590851 [2025-03-03 15:08:46,583 INFO L226 Difference]: Without dead ends: 385038 [2025-03-03 15:08:46,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 156 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-03 15:08:46,677 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 1840 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1840 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:46,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1840 Valid, 487 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:46,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385038 states. [2025-03-03 15:08:49,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385038 to 248452. [2025-03-03 15:08:49,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248452 states, 248451 states have (on average 1.3780463753416166) internal successors, (342377), 248451 states have internal predecessors, (342377), 0 states have call successors, (0), 0 states 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 15:08:50,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248452 states to 248452 states and 342377 transitions. [2025-03-03 15:08:50,401 INFO L78 Accepts]: Start accepts. Automaton has 248452 states and 342377 transitions. Word has length 83 [2025-03-03 15:08:50,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:50,402 INFO L471 AbstractCegarLoop]: Abstraction has 248452 states and 342377 transitions. [2025-03-03 15:08:50,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.818181818181818) internal successors, (141), 10 states have internal predecessors, (141), 0 states have call successors, (0), 0 states 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 15:08:50,402 INFO L276 IsEmpty]: Start isEmpty. Operand 248452 states and 342377 transitions. [2025-03-03 15:08:50,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 15:08:50,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:50,409 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:50,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 15:08:50,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:08:50,610 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:50,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:50,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2086894555, now seen corresponding path program 1 times [2025-03-03 15:08:50,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:50,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119209422] [2025-03-03 15:08:50,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:50,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:50,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 15:08:50,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 15:08:50,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:50,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:50,689 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:50,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:50,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119209422] [2025-03-03 15:08:50,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119209422] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:08:50,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83294524] [2025-03-03 15:08:50,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:50,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:08:50,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:08:50,692 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:08:50,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 15:08:50,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 15:08:50,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 15:08:50,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:50,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:50,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:08:50,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:08:50,952 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:50,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:08:51,037 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:51,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83294524] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:08:51,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:08:51,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 15:08:51,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432073020] [2025-03-03 15:08:51,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:08:51,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:08:51,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:51,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:08:51,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:08:51,039 INFO L87 Difference]: Start difference. First operand 248452 states and 342377 transitions. Second operand has 11 states, 11 states have (on average 13.090909090909092) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states 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 15:08:52,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:52,812 INFO L93 Difference]: Finished difference Result 474853 states and 652691 transitions. [2025-03-03 15:08:52,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:08:52,812 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.090909090909092) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 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 83 [2025-03-03 15:08:52,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:53,358 INFO L225 Difference]: With dead ends: 474853 [2025-03-03 15:08:53,359 INFO L226 Difference]: Without dead ends: 351741 [2025-03-03 15:08:53,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 156 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-03 15:08:53,527 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 1113 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:53,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 442 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:53,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351741 states.