./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.UNBOUNDED.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_opt-floodmax.4.ufo.UNBOUNDED.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 9e29b1c17273501647988c2dcf7c62baca572c01c9f2bd474ce3ab9b8d1b7b68 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:22:07,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:22:07,737 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:22:07,747 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:22:07,747 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:22:07,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:22:07,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:22:07,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:22:07,767 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:22:07,767 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:22:07,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:22:07,767 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:22:07,767 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:22:07,767 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:22:07,767 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:22:07,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:22:07,768 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:22:07,768 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:22:07,768 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:22:07,768 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:22:07,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:22:07,768 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:22:07,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:22:07,768 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:22:07,768 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:22:07,768 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:22:07,769 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:22:07,769 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:22:07,769 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:22:07,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:22:07,769 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:22:07,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:22:07,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:22:07,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:22:07,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:22:07,769 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:22:07,770 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:22:07,770 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:22:07,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:22:07,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:22:07,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:22:07,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:22:07,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:22:07,770 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 -> 9e29b1c17273501647988c2dcf7c62baca572c01c9f2bd474ce3ab9b8d1b7b68 [2025-03-03 15:22:07,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:22:07,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:22:08,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:22:08,001 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:22:08,001 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:22:08,002 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-03 15:22:09,154 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4df84d6c/1772bc864b79402ba2d2eae299d29cd0/FLAG7aeec8134 [2025-03-03 15:22:09,475 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:22:09,475 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-03 15:22:09,489 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4df84d6c/1772bc864b79402ba2d2eae299d29cd0/FLAG7aeec8134 [2025-03-03 15:22:09,505 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4df84d6c/1772bc864b79402ba2d2eae299d29cd0 [2025-03-03 15:22:09,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:22:09,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:22:09,510 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:22:09,510 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:22:09,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:22:09,514 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:22:09" (1/1) ... [2025-03-03 15:22:09,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:22:09, skipping insertion in model container [2025-03-03 15:22:09,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:22:09" (1/1) ... [2025-03-03 15:22:09,557 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:22:09,740 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_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[13867,13880] [2025-03-03 15:22:09,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:22:09,805 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:22:09,865 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_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[13867,13880] [2025-03-03 15:22:09,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:22:09,910 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:22:09,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:22:09 WrapperNode [2025-03-03 15:22:09,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:22:09,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:22:09,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:22:09,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:22:09,917 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:22:09" (1/1) ... [2025-03-03 15:22:09,935 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:22:09" (1/1) ... [2025-03-03 15:22:09,991 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1455 [2025-03-03 15:22:09,992 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:22:09,992 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:22:09,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:22:09,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:22:10,002 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:22:09" (1/1) ... [2025-03-03 15:22:10,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:22:09" (1/1) ... [2025-03-03 15:22:10,013 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:22:09" (1/1) ... [2025-03-03 15:22:10,040 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:22:10,040 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:22:09" (1/1) ... [2025-03-03 15:22:10,040 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:22:09" (1/1) ... [2025-03-03 15:22:10,062 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:22:09" (1/1) ... [2025-03-03 15:22:10,069 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:22:09" (1/1) ... [2025-03-03 15:22:10,072 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:22:09" (1/1) ... [2025-03-03 15:22:10,078 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:22:09" (1/1) ... [2025-03-03 15:22:10,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:22:10,090 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:22:10,090 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:22:10,090 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:22:10,092 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:22:09" (1/1) ... [2025-03-03 15:22:10,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:22:10,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:22:10,116 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:22:10,118 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:22:10,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:22:10,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:22:10,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:22:10,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:22:10,266 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:22:10,268 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:22:11,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L730: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-03 15:22:11,250 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L575: havoc main_~node3__newmax~0#1; [2025-03-03 15:22:11,250 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L483: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r141~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r241~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r341~0#1, main_~init__r411~0#1, main_~init__r421~0#1, main_~init__r431~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r142~0#1, main_~init__tmp___1~0#1, main_~init__r212~0#1, main_~init__tmp___2~0#1, main_~init__r232~0#1, main_~init__tmp___3~0#1, main_~init__r242~0#1, main_~init__tmp___4~0#1, main_~init__r312~0#1, main_~init__tmp___5~0#1, main_~init__r322~0#1, main_~init__tmp___6~0#1, main_~init__r342~0#1, main_~init__tmp___7~0#1, main_~init__r412~0#1, main_~init__tmp___8~0#1, main_~init__r422~0#1, main_~init__tmp___9~0#1, main_~init__r432~0#1, main_~init__tmp___10~0#1, main_~init__r123~0#1, main_~init__tmp___11~0#1, main_~init__r133~0#1, main_~init__tmp___12~0#1, main_~init__r143~0#1, main_~init__tmp___13~0#1, main_~init__r213~0#1, main_~init__tmp___14~0#1, main_~init__r233~0#1, main_~init__tmp___15~0#1, main_~init__r243~0#1, main_~init__tmp___16~0#1, main_~init__r313~0#1, main_~init__tmp___17~0#1, main_~init__r323~0#1, main_~init__tmp___18~0#1, main_~init__r343~0#1, main_~init__tmp___19~0#1, main_~init__r413~0#1, main_~init__tmp___20~0#1, main_~init__r423~0#1, main_~init__tmp___21~0#1, main_~init__r433~0#1, main_~init__tmp___22~0#1, main_~init__tmp___23~0#1; [2025-03-03 15:22:11,251 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1409: havoc main_~node1____CPAchecker_TMP_2~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:22:11,251 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244: havoc main_~node2____CPAchecker_TMP_2~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:22:11,251 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1079: havoc main_~node3____CPAchecker_TMP_2~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:22:11,251 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L914: havoc main_~node4____CPAchecker_TMP_2~0#1;havoc main_~node4____CPAchecker_TMP_1~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-03 15:22:11,251 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L621: havoc main_~node4__newmax~0#1; [2025-03-03 15:22:11,251 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L529: havoc main_~node2__newmax~0#1; [2025-03-03 15:22:11,337 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-03-03 15:22:11,337 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:22:11,355 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:22:11,355 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:22:11,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:22:11 BoogieIcfgContainer [2025-03-03 15:22:11,355 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:22:11,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:22:11,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:22:11,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:22:11,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:22:09" (1/3) ... [2025-03-03 15:22:11,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e95629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:22:11, skipping insertion in model container [2025-03-03 15:22:11,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:22:09" (2/3) ... [2025-03-03 15:22:11,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e95629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:22:11, skipping insertion in model container [2025-03-03 15:22:11,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:22:11" (3/3) ... [2025-03-03 15:22:11,365 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-03 15:22:11,378 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:22:11,380 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 351 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:22:11,433 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:22:11,440 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;@7f7764ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:22:11,440 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:22:11,443 INFO L276 IsEmpty]: Start isEmpty. Operand has 351 states, 349 states have (on average 1.7879656160458453) internal successors, (624), 350 states have internal predecessors, (624), 0 states have call successors, (0), 0 states 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:22:11,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 15:22:11,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:22:11,451 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:11,451 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:22:11,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:22:11,455 INFO L85 PathProgramCache]: Analyzing trace with hash -848181599, now seen corresponding path program 1 times [2025-03-03 15:22:11,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:22:11,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744946640] [2025-03-03 15:22:11,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:22:11,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:22:11,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 15:22:11,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 15:22:11,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:22:11,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:22:12,059 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:22:12,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:22:12,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744946640] [2025-03-03 15:22:12,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744946640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:22:12,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:22:12,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:22:12,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43268246] [2025-03-03 15:22:12,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:22:12,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:22:12,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:22:12,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:22:12,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:22:12,085 INFO L87 Difference]: Start difference. First operand has 351 states, 349 states have (on average 1.7879656160458453) internal successors, (624), 350 states have internal predecessors, (624), 0 states have call successors, (0), 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 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:22:12,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:22:12,200 INFO L93 Difference]: Finished difference Result 655 states and 1130 transitions. [2025-03-03 15:22:12,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:22:12,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2025-03-03 15:22:12,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:22:12,214 INFO L225 Difference]: With dead ends: 655 [2025-03-03 15:22:12,215 INFO L226 Difference]: Without dead ends: 491 [2025-03-03 15:22:12,218 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:22:12,221 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 268 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:22:12,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 1150 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:22:12,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-03-03 15:22:12,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 488. [2025-03-03 15:22:12,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 487 states have (on average 1.6529774127310062) internal successors, (805), 487 states have internal predecessors, (805), 0 states have call successors, (0), 0 states 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:22:12,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 805 transitions. [2025-03-03 15:22:12,280 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 805 transitions. Word has length 118 [2025-03-03 15:22:12,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:22:12,281 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 805 transitions. [2025-03-03 15:22:12,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:22:12,282 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 805 transitions. [2025-03-03 15:22:12,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 15:22:12,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:22:12,287 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:12,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:22:12,287 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:22:12,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:22:12,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1095591777, now seen corresponding path program 1 times [2025-03-03 15:22:12,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:22:12,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483038367] [2025-03-03 15:22:12,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:22:12,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:22:12,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 15:22:12,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 15:22:12,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:22:12,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:22:12,563 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:22:12,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:22:12,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483038367] [2025-03-03 15:22:12,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483038367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:22:12,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:22:12,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:22:12,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111892217] [2025-03-03 15:22:12,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:22:12,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:22:12,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:22:12,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:22:12,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:22:12,567 INFO L87 Difference]: Start difference. First operand 488 states and 805 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:22:12,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:22:12,614 INFO L93 Difference]: Finished difference Result 1058 states and 1753 transitions. [2025-03-03 15:22:12,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:22:12,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2025-03-03 15:22:12,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:22:12,617 INFO L225 Difference]: With dead ends: 1058 [2025-03-03 15:22:12,617 INFO L226 Difference]: Without dead ends: 763 [2025-03-03 15:22:12,619 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:22:12,619 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 231 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:22:12,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 1100 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:22:12,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2025-03-03 15:22:12,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 759. [2025-03-03 15:22:12,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 758 states have (on average 1.654353562005277) internal successors, (1254), 758 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states 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:22:12,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1254 transitions. [2025-03-03 15:22:12,651 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1254 transitions. Word has length 121 [2025-03-03 15:22:12,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:22:12,651 INFO L471 AbstractCegarLoop]: Abstraction has 759 states and 1254 transitions. [2025-03-03 15:22:12,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:22:12,652 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1254 transitions. [2025-03-03 15:22:12,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:22:12,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:22:12,655 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:12,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:22:12,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:22:12,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:22:12,656 INFO L85 PathProgramCache]: Analyzing trace with hash -494679978, now seen corresponding path program 1 times [2025-03-03 15:22:12,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:22:12,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707750498] [2025-03-03 15:22:12,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:22:12,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:22:12,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 15:22:12,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 15:22:12,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:22:12,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:22:12,860 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:22:12,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:22:12,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707750498] [2025-03-03 15:22:12,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707750498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:22:12,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:22:12,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:22:12,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890458013] [2025-03-03 15:22:12,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:22:12,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:22:12,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:22:12,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:22:12,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:22:12,861 INFO L87 Difference]: Start difference. First operand 759 states and 1254 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:22:12,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:22:12,914 INFO L93 Difference]: Finished difference Result 1851 states and 3064 transitions. [2025-03-03 15:22:12,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:22:12,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-03-03 15:22:12,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:22:12,921 INFO L225 Difference]: With dead ends: 1851 [2025-03-03 15:22:12,921 INFO L226 Difference]: Without dead ends: 1285 [2025-03-03 15:22:12,925 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:22:12,926 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 224 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:22:12,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1101 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:22:12,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2025-03-03 15:22:12,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1279. [2025-03-03 15:22:12,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1279 states, 1278 states have (on average 1.6510172143974962) internal successors, (2110), 1278 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states 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:22:12,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 2110 transitions. [2025-03-03 15:22:12,963 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 2110 transitions. Word has length 124 [2025-03-03 15:22:12,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:22:12,964 INFO L471 AbstractCegarLoop]: Abstraction has 1279 states and 2110 transitions. [2025-03-03 15:22:12,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:22:12,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 2110 transitions. [2025-03-03 15:22:12,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 15:22:12,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:22:12,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:12,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:22:12,968 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:22:12,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:22:12,969 INFO L85 PathProgramCache]: Analyzing trace with hash 563680820, now seen corresponding path program 1 times [2025-03-03 15:22:12,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:22:12,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461454582] [2025-03-03 15:22:12,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:22:12,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:22:13,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 15:22:13,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 15:22:13,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:22:13,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:22:13,146 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:22:13,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:22:13,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461454582] [2025-03-03 15:22:13,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461454582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:22:13,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:22:13,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:22:13,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488395226] [2025-03-03 15:22:13,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:22:13,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:22:13,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:22:13,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:22:13,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:22:13,147 INFO L87 Difference]: Start difference. First operand 1279 states and 2110 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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:22:13,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:22:13,199 INFO L93 Difference]: Finished difference Result 3371 states and 5560 transitions. [2025-03-03 15:22:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:22:13,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-03-03 15:22:13,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:22:13,208 INFO L225 Difference]: With dead ends: 3371 [2025-03-03 15:22:13,209 INFO L226 Difference]: Without dead ends: 2285 [2025-03-03 15:22:13,210 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:22:13,211 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 216 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:22:13,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1099 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:22:13,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2285 states. [2025-03-03 15:22:13,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2285 to 2275. [2025-03-03 15:22:13,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2275 states, 2274 states have (on average 1.6402814423922603) internal successors, (3730), 2274 states have internal predecessors, (3730), 0 states have call successors, (0), 0 states 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:22:13,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 2275 states and 3730 transitions. [2025-03-03 15:22:13,261 INFO L78 Accepts]: Start accepts. Automaton has 2275 states and 3730 transitions. Word has length 127 [2025-03-03 15:22:13,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:22:13,261 INFO L471 AbstractCegarLoop]: Abstraction has 2275 states and 3730 transitions. [2025-03-03 15:22:13,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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:22:13,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2275 states and 3730 transitions. [2025-03-03 15:22:13,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 15:22:13,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:22:13,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:13,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:22:13,264 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:22:13,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:22:13,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1946026763, now seen corresponding path program 1 times [2025-03-03 15:22:13,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:22:13,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488770086] [2025-03-03 15:22:13,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:22:13,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:22:13,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 15:22:13,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 15:22:13,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:22:13,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:22:13,502 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:22:13,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:22:13,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488770086] [2025-03-03 15:22:13,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488770086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:22:13,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:22:13,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:22:13,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993886562] [2025-03-03 15:22:13,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:22:13,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:22:13,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:22:13,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:22:13,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:22:13,506 INFO L87 Difference]: Start difference. First operand 2275 states and 3730 transitions. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:22:13,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:22:13,793 INFO L93 Difference]: Finished difference Result 11927 states and 19706 transitions. [2025-03-03 15:22:13,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:22:13,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2025-03-03 15:22:13,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:22:13,825 INFO L225 Difference]: With dead ends: 11927 [2025-03-03 15:22:13,825 INFO L226 Difference]: Without dead ends: 9845 [2025-03-03 15:22:13,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:22:13,833 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 2156 mSDsluCounter, 4815 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2156 SdHoareTripleChecker+Valid, 5392 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:22:13,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2156 Valid, 5392 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:22:13,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9845 states. [2025-03-03 15:22:13,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9845 to 4220. [2025-03-03 15:22:13,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4220 states, 4219 states have (on average 1.6401990993126334) internal successors, (6920), 4219 states have internal predecessors, (6920), 0 states have call successors, (0), 0 states 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:22:13,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4220 states to 4220 states and 6920 transitions. [2025-03-03 15:22:13,970 INFO L78 Accepts]: Start accepts. Automaton has 4220 states and 6920 transitions. Word has length 130 [2025-03-03 15:22:13,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:22:13,970 INFO L471 AbstractCegarLoop]: Abstraction has 4220 states and 6920 transitions. [2025-03-03 15:22:13,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:22:13,971 INFO L276 IsEmpty]: Start isEmpty. Operand 4220 states and 6920 transitions. [2025-03-03 15:22:13,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 15:22:13,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:22:13,973 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:13,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:22:13,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:22:13,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:22:13,973 INFO L85 PathProgramCache]: Analyzing trace with hash 199255709, now seen corresponding path program 1 times [2025-03-03 15:22:13,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:22:13,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084904440] [2025-03-03 15:22:13,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:22:13,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:22:13,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 15:22:14,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 15:22:14,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:22:14,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:22:14,125 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:22:14,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:22:14,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084904440] [2025-03-03 15:22:14,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084904440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:22:14,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:22:14,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:22:14,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902524692] [2025-03-03 15:22:14,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:22:14,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:22:14,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:22:14,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:22:14,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:22:14,127 INFO L87 Difference]: Start difference. First operand 4220 states and 6920 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states 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:22:14,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:22:14,239 INFO L93 Difference]: Finished difference Result 12379 states and 20401 transitions. [2025-03-03 15:22:14,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:22:14,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2025-03-03 15:22:14,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:22:14,268 INFO L225 Difference]: With dead ends: 12379 [2025-03-03 15:22:14,269 INFO L226 Difference]: Without dead ends: 8352 [2025-03-03 15:22:14,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:22:14,279 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 760 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1904 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:22:14,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 1904 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:22:14,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8352 states. [2025-03-03 15:22:14,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8352 to 6269. [2025-03-03 15:22:14,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6269 states, 6268 states have (on average 1.6426292278238672) internal successors, (10296), 6268 states have internal predecessors, (10296), 0 states have call successors, (0), 0 states 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:22:14,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6269 states to 6269 states and 10296 transitions. [2025-03-03 15:22:14,410 INFO L78 Accepts]: Start accepts. Automaton has 6269 states and 10296 transitions. Word has length 131 [2025-03-03 15:22:14,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:22:14,410 INFO L471 AbstractCegarLoop]: Abstraction has 6269 states and 10296 transitions. [2025-03-03 15:22:14,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states 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:22:14,410 INFO L276 IsEmpty]: Start isEmpty. Operand 6269 states and 10296 transitions. [2025-03-03 15:22:14,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 15:22:14,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:22:14,413 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:14,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:22:14,413 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:22:14,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:22:14,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1883838510, now seen corresponding path program 1 times [2025-03-03 15:22:14,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:22:14,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166465415] [2025-03-03 15:22:14,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:22:14,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:22:14,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 15:22:14,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 15:22:14,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:22:14,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:22:14,585 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:22:14,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:22:14,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166465415] [2025-03-03 15:22:14,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166465415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:22:14,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:22:14,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:22:14,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049760320] [2025-03-03 15:22:14,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:22:14,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:22:14,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:22:14,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:22:14,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:22:14,587 INFO L87 Difference]: Start difference. First operand 6269 states and 10296 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states 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:22:14,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:22:14,726 INFO L93 Difference]: Finished difference Result 18421 states and 30329 transitions. [2025-03-03 15:22:14,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:22:14,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2025-03-03 15:22:14,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:22:14,759 INFO L225 Difference]: With dead ends: 18421 [2025-03-03 15:22:14,759 INFO L226 Difference]: Without dead ends: 12345 [2025-03-03 15:22:14,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:22:14,772 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 758 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 1909 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:22:14,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 1909 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:22:14,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12345 states. [2025-03-03 15:22:14,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12345 to 9283. [2025-03-03 15:22:14,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9283 states, 9282 states have (on average 1.641025641025641) internal successors, (15232), 9282 states have internal predecessors, (15232), 0 states have call successors, (0), 0 states 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:22:14,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9283 states to 9283 states and 15232 transitions. [2025-03-03 15:22:14,945 INFO L78 Accepts]: Start accepts. Automaton has 9283 states and 15232 transitions. Word has length 132 [2025-03-03 15:22:14,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:22:14,945 INFO L471 AbstractCegarLoop]: Abstraction has 9283 states and 15232 transitions. [2025-03-03 15:22:14,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states 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:22:14,946 INFO L276 IsEmpty]: Start isEmpty. Operand 9283 states and 15232 transitions. [2025-03-03 15:22:14,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 15:22:14,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:22:14,949 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:14,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:22:14,949 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:22:14,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:22:14,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1728758880, now seen corresponding path program 1 times [2025-03-03 15:22:14,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:22:14,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618156212] [2025-03-03 15:22:14,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:22:14,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:22:14,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 15:22:14,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 15:22:14,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:22:14,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:22:15,120 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:22:15,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:22:15,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618156212] [2025-03-03 15:22:15,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618156212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:22:15,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:22:15,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:22:15,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667570083] [2025-03-03 15:22:15,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:22:15,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:22:15,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:22:15,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:22:15,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:22:15,122 INFO L87 Difference]: Start difference. First operand 9283 states and 15232 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states 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:22:15,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:22:15,239 INFO L93 Difference]: Finished difference Result 27309 states and 44917 transitions. [2025-03-03 15:22:15,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:22:15,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2025-03-03 15:22:15,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:22:15,273 INFO L225 Difference]: With dead ends: 27309 [2025-03-03 15:22:15,273 INFO L226 Difference]: Without dead ends: 18219 [2025-03-03 15:22:15,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:22:15,289 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 756 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 1904 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:22:15,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 1904 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:22:15,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18219 states. [2025-03-03 15:22:15,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18219 to 13717. [2025-03-03 15:22:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13717 states, 13716 states have (on average 1.6393992417614465) internal successors, (22486), 13716 states have internal predecessors, (22486), 0 states have call successors, (0), 0 states 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:22:15,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13717 states to 13717 states and 22486 transitions. [2025-03-03 15:22:15,573 INFO L78 Accepts]: Start accepts. Automaton has 13717 states and 22486 transitions. Word has length 133 [2025-03-03 15:22:15,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:22:15,574 INFO L471 AbstractCegarLoop]: Abstraction has 13717 states and 22486 transitions. [2025-03-03 15:22:15,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states 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:22:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 13717 states and 22486 transitions. [2025-03-03 15:22:15,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:22:15,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:22:15,580 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:15,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:22:15,581 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:22:15,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:22:15,582 INFO L85 PathProgramCache]: Analyzing trace with hash 229706988, now seen corresponding path program 1 times [2025-03-03 15:22:15,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:22:15,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237745771] [2025-03-03 15:22:15,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:22:15,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:22:15,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:22:15,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:22:15,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:22:15,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:22:15,676 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:22:15,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:22:15,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237745771] [2025-03-03 15:22:15,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237745771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:22:15,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:22:15,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:22:15,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416012854] [2025-03-03 15:22:15,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:22:15,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:22:15,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:22:15,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:22:15,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:22:15,679 INFO L87 Difference]: Start difference. First operand 13717 states and 22486 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states 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:22:15,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:22:15,755 INFO L93 Difference]: Finished difference Result 30564 states and 50300 transitions. [2025-03-03 15:22:15,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:22:15,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-03-03 15:22:15,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:22:15,797 INFO L225 Difference]: With dead ends: 30564 [2025-03-03 15:22:15,797 INFO L226 Difference]: Without dead ends: 21069 [2025-03-03 15:22:15,818 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:22:15,820 INFO L435 NwaCegarLoop]: 768 mSDtfsCounter, 237 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1295 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:22:15,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1295 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:22:15,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21069 states. [2025-03-03 15:22:16,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21069 to 21067. [2025-03-03 15:22:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21067 states, 21066 states have (on average 1.6386594512484571) internal successors, (34520), 21066 states have internal predecessors, (34520), 0 states have call successors, (0), 0 states 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:22:16,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21067 states to 21067 states and 34520 transitions. [2025-03-03 15:22:16,154 INFO L78 Accepts]: Start accepts. Automaton has 21067 states and 34520 transitions. Word has length 134 [2025-03-03 15:22:16,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:22:16,154 INFO L471 AbstractCegarLoop]: Abstraction has 21067 states and 34520 transitions. [2025-03-03 15:22:16,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states 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:22:16,155 INFO L276 IsEmpty]: Start isEmpty. Operand 21067 states and 34520 transitions. [2025-03-03 15:22:16,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:22:16,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:22:16,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:16,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:22:16,158 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:22:16,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:22:16,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1999192566, now seen corresponding path program 1 times [2025-03-03 15:22:16,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:22:16,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075846780] [2025-03-03 15:22:16,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:22:16,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:22:16,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:22:16,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:22:16,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:22:16,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:22:16,252 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:22:16,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:22:16,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075846780] [2025-03-03 15:22:16,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075846780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:22:16,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:22:16,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:22:16,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81155858] [2025-03-03 15:22:16,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:22:16,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:22:16,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:22:16,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:22:16,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:22:16,253 INFO L87 Difference]: Start difference. First operand 21067 states and 34520 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states 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:22:16,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:22:16,436 INFO L93 Difference]: Finished difference Result 46560 states and 76368 transitions. [2025-03-03 15:22:16,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:22:16,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-03-03 15:22:16,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:22:16,502 INFO L225 Difference]: With dead ends: 46560 [2025-03-03 15:22:16,503 INFO L226 Difference]: Without dead ends: 32027 [2025-03-03 15:22:16,530 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:22:16,531 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 230 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1270 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.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:22:16,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:22:16,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32027 states. [2025-03-03 15:22:16,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32027 to 32025. [2025-03-03 15:22:16,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32025 states, 32024 states have (on average 1.6338058955783163) internal successors, (52321), 32024 states have internal predecessors, (52321), 0 states have call successors, (0), 0 states 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:22:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32025 states to 32025 states and 52321 transitions. [2025-03-03 15:22:16,995 INFO L78 Accepts]: Start accepts. Automaton has 32025 states and 52321 transitions. Word has length 134 [2025-03-03 15:22:16,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:22:16,995 INFO L471 AbstractCegarLoop]: Abstraction has 32025 states and 52321 transitions. [2025-03-03 15:22:16,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states 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:22:16,996 INFO L276 IsEmpty]: Start isEmpty. Operand 32025 states and 52321 transitions. [2025-03-03 15:22:16,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:22:16,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:22:16,997 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:16,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:22:16,997 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:22:16,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:22:16,998 INFO L85 PathProgramCache]: Analyzing trace with hash -829623636, now seen corresponding path program 1 times [2025-03-03 15:22:16,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:22:16,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956160673] [2025-03-03 15:22:16,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:22:16,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:22:17,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:22:17,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:22:17,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:22:17,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:22:17,170 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:22:17,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:22:17,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956160673] [2025-03-03 15:22:17,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956160673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:22:17,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:22:17,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:22:17,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294820627] [2025-03-03 15:22:17,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:22:17,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:22:17,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:22:17,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:22:17,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:22:17,172 INFO L87 Difference]: Start difference. First operand 32025 states and 52321 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states 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:22:17,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:22:17,352 INFO L93 Difference]: Finished difference Result 70377 states and 115087 transitions. [2025-03-03 15:22:17,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:22:17,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-03-03 15:22:17,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:22:17,439 INFO L225 Difference]: With dead ends: 70377 [2025-03-03 15:22:17,439 INFO L226 Difference]: Without dead ends: 48201 [2025-03-03 15:22:17,470 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:22:17,470 INFO L435 NwaCegarLoop]: 708 mSDtfsCounter, 223 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1237 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:22:17,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1237 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:22:17,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48201 states. [2025-03-03 15:22:17,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48201 to 48199. [2025-03-03 15:22:18,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48199 states, 48198 states have (on average 1.627909871778912) internal successors, (78462), 48198 states have internal predecessors, (78462), 0 states have call successors, (0), 0 states 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:22:18,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48199 states to 48199 states and 78462 transitions. [2025-03-03 15:22:18,090 INFO L78 Accepts]: Start accepts. Automaton has 48199 states and 78462 transitions. Word has length 134 [2025-03-03 15:22:18,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:22:18,090 INFO L471 AbstractCegarLoop]: Abstraction has 48199 states and 78462 transitions. [2025-03-03 15:22:18,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states 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:22:18,090 INFO L276 IsEmpty]: Start isEmpty. Operand 48199 states and 78462 transitions. [2025-03-03 15:22:18,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:22:18,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:22:18,091 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:18,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:22:18,091 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:22:18,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:22:18,091 INFO L85 PathProgramCache]: Analyzing trace with hash -2050217647, now seen corresponding path program 1 times [2025-03-03 15:22:18,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:22:18,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008257759] [2025-03-03 15:22:18,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:22:18,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:22:18,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:22:18,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:22:18,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:22:18,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:22:18,202 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:22:18,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:22:18,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008257759] [2025-03-03 15:22:18,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008257759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:22:18,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:22:18,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:22:18,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358186061] [2025-03-03 15:22:18,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:22:18,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:22:18,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:22:18,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:22:18,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:22:18,205 INFO L87 Difference]: Start difference. First operand 48199 states and 78462 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states 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:22:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:22:18,732 INFO L93 Difference]: Finished difference Result 143685 states and 234811 transitions. [2025-03-03 15:22:18,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:22:18,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-03-03 15:22:18,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:22:18,873 INFO L225 Difference]: With dead ends: 143685 [2025-03-03 15:22:18,873 INFO L226 Difference]: Without dead ends: 95725 [2025-03-03 15:22:18,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:22:18,917 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 733 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 2012 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:22:18,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 2012 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:22:18,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95725 states. [2025-03-03 15:22:20,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95725 to 71737. [2025-03-03 15:22:20,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71737 states, 71736 states have (on average 1.6268540202966433) internal successors, (116704), 71736 states have internal predecessors, (116704), 0 states have call successors, (0), 0 states 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:22:20,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71737 states to 71737 states and 116704 transitions. [2025-03-03 15:22:20,191 INFO L78 Accepts]: Start accepts. Automaton has 71737 states and 116704 transitions. Word has length 134 [2025-03-03 15:22:20,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:22:20,191 INFO L471 AbstractCegarLoop]: Abstraction has 71737 states and 116704 transitions. [2025-03-03 15:22:20,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states 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:22:20,191 INFO L276 IsEmpty]: Start isEmpty. Operand 71737 states and 116704 transitions. [2025-03-03 15:22:20,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 15:22:20,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:22:20,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:20,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:22:20,193 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:22:20,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:22:20,194 INFO L85 PathProgramCache]: Analyzing trace with hash -913949677, now seen corresponding path program 1 times [2025-03-03 15:22:20,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:22:20,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947375238] [2025-03-03 15:22:20,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:22:20,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:22:20,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 15:22:20,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 15:22:20,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:22:20,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:22:20,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:22:20,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:22:20,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947375238] [2025-03-03 15:22:20,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947375238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:22:20,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:22:20,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:22:20,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513031219] [2025-03-03 15:22:20,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:22:20,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:22:20,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:22:20,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:22:20,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:22:20,294 INFO L87 Difference]: Start difference. First operand 71737 states and 116704 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states 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:22:20,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:22:20,877 INFO L93 Difference]: Finished difference Result 156755 states and 255331 transitions. [2025-03-03 15:22:20,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:22:20,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2025-03-03 15:22:20,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:22:21,033 INFO L225 Difference]: With dead ends: 156755 [2025-03-03 15:22:21,034 INFO L226 Difference]: Without dead ends: 106563 [2025-03-03 15:22:21,081 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:22:21,082 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 214 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1202 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:22:21,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1202 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:22:21,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106563 states. [2025-03-03 15:22:22,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106563 to 106561. [2025-03-03 15:22:22,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106561 states, 106560 states have (on average 1.6191629129129128) internal successors, (172538), 106560 states have internal predecessors, (172538), 0 states have call successors, (0), 0 states 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:22:22,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106561 states to 106561 states and 172538 transitions. [2025-03-03 15:22:22,568 INFO L78 Accepts]: Start accepts. Automaton has 106561 states and 172538 transitions. Word has length 135 [2025-03-03 15:22:22,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:22:22,568 INFO L471 AbstractCegarLoop]: Abstraction has 106561 states and 172538 transitions. [2025-03-03 15:22:22,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states 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:22:22,568 INFO L276 IsEmpty]: Start isEmpty. Operand 106561 states and 172538 transitions. [2025-03-03 15:22:22,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 15:22:22,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:22:22,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:22,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:22:22,570 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:22:22,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:22:22,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1182313171, now seen corresponding path program 1 times [2025-03-03 15:22:22,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:22:22,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071679955] [2025-03-03 15:22:22,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:22:22,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:22:22,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 15:22:22,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 15:22:22,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:22:22,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:22:23,142 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:22:23,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:22:23,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071679955] [2025-03-03 15:22:23,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071679955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:22:23,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:22:23,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:22:23,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951828433] [2025-03-03 15:22:23,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:22:23,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:22:23,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:22:23,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:22:23,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:22:23,144 INFO L87 Difference]: Start difference. First operand 106561 states and 172538 transitions. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states 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:22:23,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:22:23,909 INFO L93 Difference]: Finished difference Result 212863 states and 344660 transitions. [2025-03-03 15:22:23,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:22:23,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2025-03-03 15:22:23,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:22:24,071 INFO L225 Difference]: With dead ends: 212863 [2025-03-03 15:22:24,071 INFO L226 Difference]: Without dead ends: 106563 [2025-03-03 15:22:24,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:22:24,138 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 660 mSDsluCounter, 1611 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 2184 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:22:24,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 2184 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:22:24,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106563 states. [2025-03-03 15:22:25,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106563 to 106561. [2025-03-03 15:22:25,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106561 states, 106560 states have (on average 1.6132976726726727) internal successors, (171913), 106560 states have internal predecessors, (171913), 0 states have call successors, (0), 0 states 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:22:25,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106561 states to 106561 states and 171913 transitions. [2025-03-03 15:22:25,550 INFO L78 Accepts]: Start accepts. Automaton has 106561 states and 171913 transitions. Word has length 136 [2025-03-03 15:22:25,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:22:25,550 INFO L471 AbstractCegarLoop]: Abstraction has 106561 states and 171913 transitions. [2025-03-03 15:22:25,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states 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:22:25,550 INFO L276 IsEmpty]: Start isEmpty. Operand 106561 states and 171913 transitions. [2025-03-03 15:22:25,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 15:22:25,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:22:25,551 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:25,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:22:25,551 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:22:25,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:22:25,552 INFO L85 PathProgramCache]: Analyzing trace with hash 652412426, now seen corresponding path program 1 times [2025-03-03 15:22:25,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:22:25,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152700138] [2025-03-03 15:22:25,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:22:25,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:22:25,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 15:22:25,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 15:22:25,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:22:25,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:22:25,883 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:22:25,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:22:25,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152700138] [2025-03-03 15:22:25,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152700138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:22:25,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:22:25,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:22:25,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392703655] [2025-03-03 15:22:25,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:22:25,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:22:25,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:22:25,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:22:25,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:22:25,885 INFO L87 Difference]: Start difference. First operand 106561 states and 171913 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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:22:26,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:22:26,879 INFO L93 Difference]: Finished difference Result 311503 states and 503008 transitions. [2025-03-03 15:22:26,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:22:26,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-03-03 15:22:26,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:22:27,441 INFO L225 Difference]: With dead ends: 311503 [2025-03-03 15:22:27,441 INFO L226 Difference]: Without dead ends: 205203 [2025-03-03 15:22:27,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:22:27,524 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 871 mSDsluCounter, 1629 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 2190 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:22:27,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 2190 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:22:27,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205203 states. [2025-03-03 15:22:29,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205203 to 205201. [2025-03-03 15:22:29,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205201 states, 205200 states have (on average 1.6057212475633529) internal successors, (329494), 205200 states have internal predecessors, (329494), 0 states have call successors, (0), 0 states 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:22:30,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205201 states to 205201 states and 329494 transitions. [2025-03-03 15:22:30,009 INFO L78 Accepts]: Start accepts. Automaton has 205201 states and 329494 transitions. Word has length 139 [2025-03-03 15:22:30,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:22:30,009 INFO L471 AbstractCegarLoop]: Abstraction has 205201 states and 329494 transitions. [2025-03-03 15:22:30,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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:22:30,009 INFO L276 IsEmpty]: Start isEmpty. Operand 205201 states and 329494 transitions. [2025-03-03 15:22:30,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 15:22:30,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:22:30,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:30,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:22:30,010 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:22:30,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:22:30,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1249095968, now seen corresponding path program 1 times [2025-03-03 15:22:30,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:22:30,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932722989] [2025-03-03 15:22:30,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:22:30,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:22:30,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 15:22:30,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 15:22:30,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:22:30,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:22:30,703 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:22:30,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:22:30,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932722989] [2025-03-03 15:22:30,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932722989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:22:30,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:22:30,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:22:30,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424745702] [2025-03-03 15:22:30,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:22:30,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:22:30,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:22:30,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:22:30,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:22:30,706 INFO L87 Difference]: Start difference. First operand 205201 states and 329494 transitions. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 0 states 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:22:31,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:22:31,436 INFO L93 Difference]: Finished difference Result 209075 states and 335303 transitions. [2025-03-03 15:22:31,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:22:31,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2025-03-03 15:22:31,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:22:31,770 INFO L225 Difference]: With dead ends: 209075 [2025-03-03 15:22:31,770 INFO L226 Difference]: Without dead ends: 209073 [2025-03-03 15:22:31,812 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:22:31,813 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 0 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2267 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:22:31,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2267 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:22:31,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209073 states. [2025-03-03 15:22:33,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209073 to 209073. [2025-03-03 15:22:34,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209073 states, 209072 states have (on average 1.5943741868829877) internal successors, (333339), 209072 states have internal predecessors, (333339), 0 states have call successors, (0), 0 states 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:22:34,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209073 states to 209073 states and 333339 transitions. [2025-03-03 15:22:34,732 INFO L78 Accepts]: Start accepts. Automaton has 209073 states and 333339 transitions. Word has length 140 [2025-03-03 15:22:34,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:22:34,732 INFO L471 AbstractCegarLoop]: Abstraction has 209073 states and 333339 transitions. [2025-03-03 15:22:34,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 0 states 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:22:34,732 INFO L276 IsEmpty]: Start isEmpty. Operand 209073 states and 333339 transitions. [2025-03-03 15:22:34,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 15:22:34,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:22:34,736 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:34,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:22:34,737 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:22:34,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:22:34,737 INFO L85 PathProgramCache]: Analyzing trace with hash -592514161, now seen corresponding path program 1 times [2025-03-03 15:22:34,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:22:34,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865521793] [2025-03-03 15:22:34,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:22:34,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:22:34,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 15:22:34,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 15:22:34,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:22:34,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:22:34,915 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 15:22:34,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:22:34,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865521793] [2025-03-03 15:22:34,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865521793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:22:34,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:22:34,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:22:34,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288192376] [2025-03-03 15:22:34,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:22:34,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:22:34,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:22:34,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:22:34,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:22:34,918 INFO L87 Difference]: Start difference. First operand 209073 states and 333339 transitions. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states 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:22:37,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:22:37,145 INFO L93 Difference]: Finished difference Result 570403 states and 912112 transitions. [2025-03-03 15:22:37,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:22:37,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 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 176 [2025-03-03 15:22:37,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:22:38,020 INFO L225 Difference]: With dead ends: 570403 [2025-03-03 15:22:38,020 INFO L226 Difference]: Without dead ends: 477401 [2025-03-03 15:22:38,102 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:22:38,103 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 1515 mSDsluCounter, 2887 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 3713 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:22:38,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 3713 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:22:38,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477401 states. [2025-03-03 15:22:42,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477401 to 336137. [2025-03-03 15:22:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336137 states, 336136 states have (on average 1.5929058476331008) internal successors, (535433), 336136 states have internal predecessors, (535433), 0 states have call successors, (0), 0 states 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:22:43,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336137 states to 336137 states and 535433 transitions. [2025-03-03 15:22:43,708 INFO L78 Accepts]: Start accepts. Automaton has 336137 states and 535433 transitions. Word has length 176 [2025-03-03 15:22:43,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:22:43,710 INFO L471 AbstractCegarLoop]: Abstraction has 336137 states and 535433 transitions. [2025-03-03 15:22:43,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states 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:22:43,710 INFO L276 IsEmpty]: Start isEmpty. Operand 336137 states and 535433 transitions. [2025-03-03 15:22:43,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 15:22:43,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:22:43,714 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:43,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:22:43,714 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:22:43,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:22:43,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1473553581, now seen corresponding path program 1 times [2025-03-03 15:22:43,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:22:43,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124212904] [2025-03-03 15:22:43,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:22:43,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:22:43,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 15:22:43,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 15:22:43,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:22:43,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:22:43,961 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 15:22:43,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:22:43,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124212904] [2025-03-03 15:22:43,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124212904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:22:43,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:22:43,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:22:43,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119782531] [2025-03-03 15:22:43,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:22:43,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:22:43,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:22:43,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:22:43,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:22:43,967 INFO L87 Difference]: Start difference. First operand 336137 states and 535433 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states 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:22:46,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:22:46,125 INFO L93 Difference]: Finished difference Result 641805 states and 1026412 transitions. [2025-03-03 15:22:46,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:22:46,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 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 176 [2025-03-03 15:22:46,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:22:47,222 INFO L225 Difference]: With dead ends: 641805 [2025-03-03 15:22:47,223 INFO L226 Difference]: Without dead ends: 549953 [2025-03-03 15:22:47,451 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:22:47,452 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 1515 mSDsluCounter, 2790 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 3620 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:22:47,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 3620 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:22:48,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549953 states.