./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-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 c1928fd99ddae1c837272e074c24407d4011054550d928a14afc6eb7550c755f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:21:05,584 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:21:05,639 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:21:05,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:21:05,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:21:05,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:21:05,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:21:05,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:21:05,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:21:05,670 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:21:05,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:21:05,671 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:21:05,671 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:21:05,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:21:05,671 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:21:05,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:21:05,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:21:05,672 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:21:05,672 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:21:05,672 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:21:05,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:21:05,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:21:05,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:21:05,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:21:05,672 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:21:05,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:21:05,672 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:21:05,672 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:21:05,672 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:21:05,673 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:21:05,673 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:21:05,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:21:05,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:21:05,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:21:05,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:21:05,674 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:21:05,674 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:21:05,674 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:21:05,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:21:05,674 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:21:05,674 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:21:05,674 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:21:05,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:21:05,674 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 -> c1928fd99ddae1c837272e074c24407d4011054550d928a14afc6eb7550c755f [2025-03-16 19:21:05,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:21:05,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:21:05,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:21:05,893 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:21:05,893 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:21:05,894 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-03-16 19:21:07,033 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c732335f8/a442fa4f27934653bca7efc9fa659500/FLAG8ccd1614c [2025-03-16 19:21:07,393 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:21:07,394 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-03-16 19:21:07,416 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c732335f8/a442fa4f27934653bca7efc9fa659500/FLAG8ccd1614c [2025-03-16 19:21:07,617 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c732335f8/a442fa4f27934653bca7efc9fa659500 [2025-03-16 19:21:07,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:21:07,620 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:21:07,621 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:21:07,621 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:21:07,624 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:21:07,625 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:21:07" (1/1) ... [2025-03-16 19:21:07,625 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7729f0e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:21:07, skipping insertion in model container [2025-03-16 19:21:07,626 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:21:07" (1/1) ... [2025-03-16 19:21:07,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:21:07,921 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_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[24251,24264] [2025-03-16 19:21:07,947 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_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[28044,28057] [2025-03-16 19:21:08,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:21:08,025 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:21:08,109 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_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[24251,24264] [2025-03-16 19:21:08,124 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_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[28044,28057] [2025-03-16 19:21:08,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:21:08,186 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:21:08,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:21:08 WrapperNode [2025-03-16 19:21:08,187 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:21:08,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:21:08,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:21:08,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:21:08,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:21:08" (1/1) ... [2025-03-16 19:21:08,214 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:21:08" (1/1) ... [2025-03-16 19:21:08,290 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2471 [2025-03-16 19:21:08,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:21:08,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:21:08,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:21:08,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:21:08,299 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:21:08" (1/1) ... [2025-03-16 19:21:08,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:21:08" (1/1) ... [2025-03-16 19:21:08,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:21:08" (1/1) ... [2025-03-16 19:21:08,346 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-16 19:21:08,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:21:08" (1/1) ... [2025-03-16 19:21:08,346 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:21:08" (1/1) ... [2025-03-16 19:21:08,379 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:21:08" (1/1) ... [2025-03-16 19:21:08,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:21:08" (1/1) ... [2025-03-16 19:21:08,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:21:08" (1/1) ... [2025-03-16 19:21:08,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:21:08" (1/1) ... [2025-03-16 19:21:08,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:21:08,402 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:21:08,402 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:21:08,402 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:21:08,403 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:21:08" (1/1) ... [2025-03-16 19:21:08,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:21:08,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:21:08,427 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-16 19:21:08,433 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-16 19:21:08,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:21:08,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:21:08,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:21:08,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:21:08,577 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:21:08,578 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:21:09,936 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2350: havoc main_~node2____CPAchecker_TMP_2~2#1;havoc main_~node2____CPAchecker_TMP_1~2#1;havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-16 19:21:09,937 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2489: havoc main_~node1____CPAchecker_TMP_2~2#1;havoc main_~node1____CPAchecker_TMP_1~2#1;havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-16 19:21:09,937 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1370: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-16 19:21:09,937 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1175: havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1;havoc main_~node4____CPAchecker_TMP_2~1#1;havoc main_~node4____CPAchecker_TMP_1~1#1;havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node3____CPAchecker_TMP_2~1#1;havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node2____CPAchecker_TMP_2~1#1;havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node1____CPAchecker_TMP_2~1#1;havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node4____CPAchecker_TMP_2~0#1;havoc main_~node4____CPAchecker_TMP_1~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node3____CPAchecker_TMP_2~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node2____CPAchecker_TMP_2~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node1____CPAchecker_TMP_2~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~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-16 19:21:09,937 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1709: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-16 19:21:09,938 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2072: havoc main_~node4____CPAchecker_TMP_2~2#1;havoc main_~node4____CPAchecker_TMP_1~2#1;havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-03-16 19:21:09,938 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2211: havoc main_~node3____CPAchecker_TMP_2~2#1;havoc main_~node3____CPAchecker_TMP_1~2#1;havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-16 19:21:09,938 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882: havoc main_~check__tmp~5#1; [2025-03-16 19:21:10,056 INFO L? ?]: Removed 173 outVars from TransFormulas that were not future-live. [2025-03-16 19:21:10,057 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:21:10,081 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:21:10,081 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:21:10,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:21:10 BoogieIcfgContainer [2025-03-16 19:21:10,082 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:21:10,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:21:10,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:21:10,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:21:10,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:21:07" (1/3) ... [2025-03-16 19:21:10,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c8880ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:21:10, skipping insertion in model container [2025-03-16 19:21:10,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:21:08" (2/3) ... [2025-03-16 19:21:10,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c8880ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:21:10, skipping insertion in model container [2025-03-16 19:21:10,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:21:10" (3/3) ... [2025-03-16 19:21:10,094 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-03-16 19:21:10,107 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:21:10,110 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c that has 1 procedures, 612 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-16 19:21:10,169 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:21:10,176 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;@7cee3744, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:21:10,177 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 19:21:10,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 612 states, 609 states have (on average 1.80623973727422) internal successors, (1100), 611 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:10,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-16 19:21:10,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:10,207 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:21:10,207 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:21:10,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:10,212 INFO L85 PathProgramCache]: Analyzing trace with hash 922866057, now seen corresponding path program 1 times [2025-03-16 19:21:10,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:10,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767437407] [2025-03-16 19:21:10,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:10,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:10,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-16 19:21:10,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-16 19:21:10,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:10,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:11,789 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-16 19:21:11,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:11,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767437407] [2025-03-16 19:21:11,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767437407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:11,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:11,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:21:11,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550908122] [2025-03-16 19:21:11,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:11,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:21:11,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:11,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:21:11,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:21:11,816 INFO L87 Difference]: Start difference. First operand has 612 states, 609 states have (on average 1.80623973727422) internal successors, (1100), 611 states have internal predecessors, (1100), 0 states have call successors, (0), 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 4 states, 4 states have (on average 57.5) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:12,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:12,066 INFO L93 Difference]: Finished difference Result 2970 states and 5347 transitions. [2025-03-16 19:21:12,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:21:12,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 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 230 [2025-03-16 19:21:12,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:12,090 INFO L225 Difference]: With dead ends: 2970 [2025-03-16 19:21:12,090 INFO L226 Difference]: Without dead ends: 2360 [2025-03-16 19:21:12,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:21:12,100 INFO L435 NwaCegarLoop]: 1769 mSDtfsCounter, 3352 mSDsluCounter, 2786 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3352 SdHoareTripleChecker+Valid, 4555 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:12,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3352 Valid, 4555 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:21:12,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2025-03-16 19:21:12,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 1161. [2025-03-16 19:21:12,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1159 states have (on average 1.5625539257981018) internal successors, (1811), 1160 states have internal predecessors, (1811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:12,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1811 transitions. [2025-03-16 19:21:12,185 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1811 transitions. Word has length 230 [2025-03-16 19:21:12,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:12,185 INFO L471 AbstractCegarLoop]: Abstraction has 1161 states and 1811 transitions. [2025-03-16 19:21:12,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:12,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1811 transitions. [2025-03-16 19:21:12,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-16 19:21:12,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:12,189 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:21:12,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:21:12,190 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:21:12,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:12,190 INFO L85 PathProgramCache]: Analyzing trace with hash 426171853, now seen corresponding path program 1 times [2025-03-16 19:21:12,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:12,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807559284] [2025-03-16 19:21:12,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:12,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:12,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-16 19:21:12,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-16 19:21:12,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:12,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:12,425 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-16 19:21:12,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:12,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807559284] [2025-03-16 19:21:12,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807559284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:12,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:12,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:21:12,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048843771] [2025-03-16 19:21:12,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:12,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:21:12,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:12,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:21:12,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:21:12,429 INFO L87 Difference]: Start difference. First operand 1161 states and 1811 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:12,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:12,510 INFO L93 Difference]: Finished difference Result 3319 states and 5145 transitions. [2025-03-16 19:21:12,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:21:12,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2025-03-16 19:21:12,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:12,523 INFO L225 Difference]: With dead ends: 3319 [2025-03-16 19:21:12,523 INFO L226 Difference]: Without dead ends: 2282 [2025-03-16 19:21:12,524 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-16 19:21:12,525 INFO L435 NwaCegarLoop]: 1793 mSDtfsCounter, 820 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 2700 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:12,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 2700 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:21:12,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2025-03-16 19:21:12,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2251. [2025-03-16 19:21:12,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2251 states, 2249 states have (on average 1.5540240106714096) internal successors, (3495), 2250 states have internal predecessors, (3495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:12,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 2251 states and 3495 transitions. [2025-03-16 19:21:12,572 INFO L78 Accepts]: Start accepts. Automaton has 2251 states and 3495 transitions. Word has length 232 [2025-03-16 19:21:12,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:12,573 INFO L471 AbstractCegarLoop]: Abstraction has 2251 states and 3495 transitions. [2025-03-16 19:21:12,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:12,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2251 states and 3495 transitions. [2025-03-16 19:21:12,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-16 19:21:12,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:21:12,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:21:12,580 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:21:12,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:12,585 INFO L85 PathProgramCache]: Analyzing trace with hash 2055829362, now seen corresponding path program 1 times [2025-03-16 19:21:12,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:12,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062773138] [2025-03-16 19:21:12,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:12,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:12,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-16 19:21:12,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-16 19:21:12,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:12,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:12,743 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-16 19:21:12,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:12,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062773138] [2025-03-16 19:21:12,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062773138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:12,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:12,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:21:12,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388207177] [2025-03-16 19:21:12,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:12,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:21:12,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:12,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:21:12,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:21:12,749 INFO L87 Difference]: Start difference. First operand 2251 states and 3495 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:12,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:12,859 INFO L93 Difference]: Finished difference Result 6688 states and 10371 transitions. [2025-03-16 19:21:12,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:21:12,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2025-03-16 19:21:12,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:12,879 INFO L225 Difference]: With dead ends: 6688 [2025-03-16 19:21:12,879 INFO L226 Difference]: Without dead ends: 4474 [2025-03-16 19:21:12,886 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-16 19:21:12,887 INFO L435 NwaCegarLoop]: 1887 mSDtfsCounter, 941 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 2828 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:12,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 2828 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:21:12,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4474 states. [2025-03-16 19:21:12,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4474 to 2270. [2025-03-16 19:21:12,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2270 states, 2268 states have (on average 1.5533509700176367) internal successors, (3523), 2269 states have internal predecessors, (3523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 3523 transitions. [2025-03-16 19:21:12,955 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 3523 transitions. Word has length 232 [2025-03-16 19:21:12,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:12,955 INFO L471 AbstractCegarLoop]: Abstraction has 2270 states and 3523 transitions. [2025-03-16 19:21:12,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:12,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 3523 transitions. [2025-03-16 19:21:12,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-16 19:21:12,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:12,961 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:21:12,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:21:12,961 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:21:12,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:12,962 INFO L85 PathProgramCache]: Analyzing trace with hash 674645511, now seen corresponding path program 1 times [2025-03-16 19:21:12,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:12,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634645799] [2025-03-16 19:21:12,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:12,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:12,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-16 19:21:13,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-16 19:21:13,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:13,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:13,110 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-16 19:21:13,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:13,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634645799] [2025-03-16 19:21:13,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634645799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:13,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:13,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:21:13,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420750566] [2025-03-16 19:21:13,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:13,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:21:13,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:13,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:21:13,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:21:13,112 INFO L87 Difference]: Start difference. First operand 2270 states and 3523 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:13,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:13,166 INFO L93 Difference]: Finished difference Result 4503 states and 6980 transitions. [2025-03-16 19:21:13,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:21:13,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 233 [2025-03-16 19:21:13,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:13,175 INFO L225 Difference]: With dead ends: 4503 [2025-03-16 19:21:13,175 INFO L226 Difference]: Without dead ends: 2288 [2025-03-16 19:21:13,178 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-16 19:21:13,179 INFO L435 NwaCegarLoop]: 964 mSDtfsCounter, 5 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1913 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:13,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1913 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:21:13,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2288 states. [2025-03-16 19:21:13,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2288 to 2288. [2025-03-16 19:21:13,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2288 states, 2286 states have (on average 1.5503062117235347) internal successors, (3544), 2287 states have internal predecessors, (3544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:13,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2288 states to 2288 states and 3544 transitions. [2025-03-16 19:21:13,225 INFO L78 Accepts]: Start accepts. Automaton has 2288 states and 3544 transitions. Word has length 233 [2025-03-16 19:21:13,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:13,225 INFO L471 AbstractCegarLoop]: Abstraction has 2288 states and 3544 transitions. [2025-03-16 19:21:13,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:13,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2288 states and 3544 transitions. [2025-03-16 19:21:13,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-16 19:21:13,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:13,231 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:21:13,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:21:13,231 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:21:13,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:13,232 INFO L85 PathProgramCache]: Analyzing trace with hash 152471216, now seen corresponding path program 1 times [2025-03-16 19:21:13,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:13,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806774549] [2025-03-16 19:21:13,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:13,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:13,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-16 19:21:13,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-16 19:21:13,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:13,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:13,421 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-16 19:21:13,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:13,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806774549] [2025-03-16 19:21:13,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806774549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:13,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:13,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:21:13,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907220659] [2025-03-16 19:21:13,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:13,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:21:13,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:13,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:21:13,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:21:13,423 INFO L87 Difference]: Start difference. First operand 2288 states and 3544 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:13,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:13,505 INFO L93 Difference]: Finished difference Result 6450 states and 9929 transitions. [2025-03-16 19:21:13,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:21:13,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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 234 [2025-03-16 19:21:13,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:13,519 INFO L225 Difference]: With dead ends: 6450 [2025-03-16 19:21:13,520 INFO L226 Difference]: Without dead ends: 4402 [2025-03-16 19:21:13,523 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-16 19:21:13,525 INFO L435 NwaCegarLoop]: 1855 mSDtfsCounter, 813 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 2762 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:13,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 2762 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:21:13,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4402 states. [2025-03-16 19:21:13,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4402 to 4373. [2025-03-16 19:21:13,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4373 states, 4371 states have (on average 1.538320750400366) internal successors, (6724), 4372 states have internal predecessors, (6724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:13,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4373 states to 4373 states and 6724 transitions. [2025-03-16 19:21:13,632 INFO L78 Accepts]: Start accepts. Automaton has 4373 states and 6724 transitions. Word has length 234 [2025-03-16 19:21:13,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:13,633 INFO L471 AbstractCegarLoop]: Abstraction has 4373 states and 6724 transitions. [2025-03-16 19:21:13,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:13,633 INFO L276 IsEmpty]: Start isEmpty. Operand 4373 states and 6724 transitions. [2025-03-16 19:21:13,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-16 19:21:13,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:13,640 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:21:13,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:21:13,641 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:21:13,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:13,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1036321358, now seen corresponding path program 1 times [2025-03-16 19:21:13,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:13,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687318169] [2025-03-16 19:21:13,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:13,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:13,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-16 19:21:13,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-16 19:21:13,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:13,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:14,311 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-16 19:21:14,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:14,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687318169] [2025-03-16 19:21:14,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687318169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:14,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:14,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:21:14,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025576269] [2025-03-16 19:21:14,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:14,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:21:14,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:14,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:21:14,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:21:14,314 INFO L87 Difference]: Start difference. First operand 4373 states and 6724 transitions. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:14,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:14,406 INFO L93 Difference]: Finished difference Result 12188 states and 18548 transitions. [2025-03-16 19:21:14,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:21:14,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 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 234 [2025-03-16 19:21:14,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:14,435 INFO L225 Difference]: With dead ends: 12188 [2025-03-16 19:21:14,436 INFO L226 Difference]: Without dead ends: 8350 [2025-03-16 19:21:14,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:21:14,446 INFO L435 NwaCegarLoop]: 1500 mSDtfsCounter, 910 mSDsluCounter, 2441 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 3941 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:14,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 3941 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:21:14,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8350 states. [2025-03-16 19:21:14,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8350 to 4608. [2025-03-16 19:21:14,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4608 states, 4606 states have (on average 1.5440729483282676) internal successors, (7112), 4607 states have internal predecessors, (7112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:14,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4608 states to 4608 states and 7112 transitions. [2025-03-16 19:21:14,590 INFO L78 Accepts]: Start accepts. Automaton has 4608 states and 7112 transitions. Word has length 234 [2025-03-16 19:21:14,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:14,590 INFO L471 AbstractCegarLoop]: Abstraction has 4608 states and 7112 transitions. [2025-03-16 19:21:14,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:14,591 INFO L276 IsEmpty]: Start isEmpty. Operand 4608 states and 7112 transitions. [2025-03-16 19:21:14,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-16 19:21:14,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:14,599 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:21:14,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:21:14,599 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:21:14,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:14,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1841779365, now seen corresponding path program 1 times [2025-03-16 19:21:14,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:14,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419840882] [2025-03-16 19:21:14,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:14,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:14,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-16 19:21:14,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-16 19:21:14,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:14,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:14,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:14,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:14,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419840882] [2025-03-16 19:21:14,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419840882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:14,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:14,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:21:14,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902210615] [2025-03-16 19:21:14,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:14,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:21:14,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:14,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:21:14,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:21:14,733 INFO L87 Difference]: Start difference. First operand 4608 states and 7112 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:14,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:14,805 INFO L93 Difference]: Finished difference Result 12264 states and 18627 transitions. [2025-03-16 19:21:14,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:21:14,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 236 [2025-03-16 19:21:14,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:14,822 INFO L225 Difference]: With dead ends: 12264 [2025-03-16 19:21:14,822 INFO L226 Difference]: Without dead ends: 8454 [2025-03-16 19:21:14,828 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-16 19:21:14,829 INFO L435 NwaCegarLoop]: 1755 mSDtfsCounter, 809 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 2695 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:14,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 2695 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:21:14,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8454 states. [2025-03-16 19:21:14,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8454 to 4712. [2025-03-16 19:21:14,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4712 states, 4710 states have (on average 1.540339702760085) internal successors, (7255), 4711 states have internal predecessors, (7255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:14,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4712 states to 4712 states and 7255 transitions. [2025-03-16 19:21:14,947 INFO L78 Accepts]: Start accepts. Automaton has 4712 states and 7255 transitions. Word has length 236 [2025-03-16 19:21:14,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:14,947 INFO L471 AbstractCegarLoop]: Abstraction has 4712 states and 7255 transitions. [2025-03-16 19:21:14,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:14,947 INFO L276 IsEmpty]: Start isEmpty. Operand 4712 states and 7255 transitions. [2025-03-16 19:21:14,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-16 19:21:14,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:14,955 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:21:14,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:21:14,955 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:21:14,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:14,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1482761830, now seen corresponding path program 1 times [2025-03-16 19:21:14,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:14,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206245298] [2025-03-16 19:21:14,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:14,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:14,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-16 19:21:15,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-16 19:21:15,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:15,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:15,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:15,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:15,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206245298] [2025-03-16 19:21:15,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206245298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:15,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:15,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:21:15,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631495332] [2025-03-16 19:21:15,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:15,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:21:15,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:15,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:21:15,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:21:15,075 INFO L87 Difference]: Start difference. First operand 4712 states and 7255 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:15,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:15,124 INFO L93 Difference]: Finished difference Result 8654 states and 13175 transitions. [2025-03-16 19:21:15,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:21:15,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 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 237 [2025-03-16 19:21:15,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:15,134 INFO L225 Difference]: With dead ends: 8654 [2025-03-16 19:21:15,134 INFO L226 Difference]: Without dead ends: 4837 [2025-03-16 19:21:15,139 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-16 19:21:15,139 INFO L435 NwaCegarLoop]: 964 mSDtfsCounter, 5 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:15,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1912 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:21:15,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4837 states. [2025-03-16 19:21:15,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4837 to 4837. [2025-03-16 19:21:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4837 states, 4835 states have (on average 1.5307135470527404) internal successors, (7401), 4836 states have internal predecessors, (7401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:15,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4837 states to 4837 states and 7401 transitions. [2025-03-16 19:21:15,228 INFO L78 Accepts]: Start accepts. Automaton has 4837 states and 7401 transitions. Word has length 237 [2025-03-16 19:21:15,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:15,229 INFO L471 AbstractCegarLoop]: Abstraction has 4837 states and 7401 transitions. [2025-03-16 19:21:15,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:15,229 INFO L276 IsEmpty]: Start isEmpty. Operand 4837 states and 7401 transitions. [2025-03-16 19:21:15,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-16 19:21:15,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:15,237 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:21:15,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:21:15,238 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:21:15,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:15,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1627889061, now seen corresponding path program 1 times [2025-03-16 19:21:15,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:15,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236147303] [2025-03-16 19:21:15,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:15,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:15,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-16 19:21:15,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-16 19:21:15,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:15,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:15,775 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-16 19:21:15,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:15,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236147303] [2025-03-16 19:21:15,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236147303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:15,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:15,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:21:15,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467748661] [2025-03-16 19:21:15,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:15,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:21:15,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:15,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:21:15,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:21:15,778 INFO L87 Difference]: Start difference. First operand 4837 states and 7401 transitions. Second operand has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:15,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:15,838 INFO L93 Difference]: Finished difference Result 8238 states and 12497 transitions. [2025-03-16 19:21:15,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:21:15,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 0 states have call successors, (0), 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 238 [2025-03-16 19:21:15,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:15,846 INFO L225 Difference]: With dead ends: 8238 [2025-03-16 19:21:15,846 INFO L226 Difference]: Without dead ends: 4259 [2025-03-16 19:21:15,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:21:15,855 INFO L435 NwaCegarLoop]: 1091 mSDtfsCounter, 99 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 3128 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:15,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 3128 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:21:15,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4259 states. [2025-03-16 19:21:15,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4259 to 4239. [2025-03-16 19:21:15,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4239 states, 4237 states have (on average 1.535992447486429) internal successors, (6508), 4238 states have internal predecessors, (6508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:15,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4239 states to 4239 states and 6508 transitions. [2025-03-16 19:21:15,922 INFO L78 Accepts]: Start accepts. Automaton has 4239 states and 6508 transitions. Word has length 238 [2025-03-16 19:21:15,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:15,922 INFO L471 AbstractCegarLoop]: Abstraction has 4239 states and 6508 transitions. [2025-03-16 19:21:15,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:15,922 INFO L276 IsEmpty]: Start isEmpty. Operand 4239 states and 6508 transitions. [2025-03-16 19:21:15,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-16 19:21:15,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:15,928 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:21:15,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:21:15,929 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:21:15,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:15,931 INFO L85 PathProgramCache]: Analyzing trace with hash -745298991, now seen corresponding path program 1 times [2025-03-16 19:21:15,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:15,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212659178] [2025-03-16 19:21:15,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:15,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:15,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-16 19:21:16,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-16 19:21:16,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:16,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:17,102 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-16 19:21:17,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:17,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212659178] [2025-03-16 19:21:17,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212659178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:17,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:17,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:21:17,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411934846] [2025-03-16 19:21:17,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:17,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:21:17,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:17,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:21:17,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:21:17,104 INFO L87 Difference]: Start difference. First operand 4239 states and 6508 transitions. Second operand has 13 states, 13 states have (on average 18.307692307692307) internal successors, (238), 13 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:18,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:18,173 INFO L93 Difference]: Finished difference Result 7039 states and 10764 transitions. [2025-03-16 19:21:18,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 19:21:18,201 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 18.307692307692307) internal successors, (238), 13 states have internal predecessors, (238), 0 states have call successors, (0), 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 238 [2025-03-16 19:21:18,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:18,212 INFO L225 Difference]: With dead ends: 7039 [2025-03-16 19:21:18,212 INFO L226 Difference]: Without dead ends: 6397 [2025-03-16 19:21:18,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:21:18,214 INFO L435 NwaCegarLoop]: 967 mSDtfsCounter, 5266 mSDsluCounter, 7069 mSDsCounter, 0 mSdLazyCounter, 1306 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5266 SdHoareTripleChecker+Valid, 8036 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:18,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5266 Valid, 8036 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1306 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:21:18,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6397 states. [2025-03-16 19:21:18,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6397 to 5095. [2025-03-16 19:21:18,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5095 states, 5093 states have (on average 1.5165913999607303) internal successors, (7724), 5094 states have internal predecessors, (7724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:18,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5095 states to 5095 states and 7724 transitions. [2025-03-16 19:21:18,293 INFO L78 Accepts]: Start accepts. Automaton has 5095 states and 7724 transitions. Word has length 238 [2025-03-16 19:21:18,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:18,294 INFO L471 AbstractCegarLoop]: Abstraction has 5095 states and 7724 transitions. [2025-03-16 19:21:18,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.307692307692307) internal successors, (238), 13 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:18,294 INFO L276 IsEmpty]: Start isEmpty. Operand 5095 states and 7724 transitions. [2025-03-16 19:21:18,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-16 19:21:18,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:18,301 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:21:18,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:21:18,302 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:21:18,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:18,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1744229971, now seen corresponding path program 1 times [2025-03-16 19:21:18,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:18,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258230146] [2025-03-16 19:21:18,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:18,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:18,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-16 19:21:18,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-16 19:21:18,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:18,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:18,729 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-16 19:21:18,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:18,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258230146] [2025-03-16 19:21:18,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258230146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:18,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:18,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:21:18,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004662199] [2025-03-16 19:21:18,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:18,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:21:18,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:18,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:21:18,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:21:18,731 INFO L87 Difference]: Start difference. First operand 5095 states and 7724 transitions. Second operand has 4 states, 4 states have (on average 59.5) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:18,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:18,854 INFO L93 Difference]: Finished difference Result 19368 states and 29218 transitions. [2025-03-16 19:21:18,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:21:18,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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 238 [2025-03-16 19:21:18,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:18,878 INFO L225 Difference]: With dead ends: 19368 [2025-03-16 19:21:18,878 INFO L226 Difference]: Without dead ends: 14471 [2025-03-16 19:21:18,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:21:18,888 INFO L435 NwaCegarLoop]: 1484 mSDtfsCounter, 2035 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2035 SdHoareTripleChecker+Valid, 3252 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:18,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2035 Valid, 3252 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:21:18,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2025-03-16 19:21:19,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 9779. [2025-03-16 19:21:19,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9779 states, 9777 states have (on average 1.5015853533803825) internal successors, (14681), 9778 states have internal predecessors, (14681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:19,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9779 states to 9779 states and 14681 transitions. [2025-03-16 19:21:19,042 INFO L78 Accepts]: Start accepts. Automaton has 9779 states and 14681 transitions. Word has length 238 [2025-03-16 19:21:19,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:19,042 INFO L471 AbstractCegarLoop]: Abstraction has 9779 states and 14681 transitions. [2025-03-16 19:21:19,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:19,043 INFO L276 IsEmpty]: Start isEmpty. Operand 9779 states and 14681 transitions. [2025-03-16 19:21:19,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-16 19:21:19,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:19,055 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:21:19,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:21:19,055 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:21:19,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:19,055 INFO L85 PathProgramCache]: Analyzing trace with hash 2125835607, now seen corresponding path program 1 times [2025-03-16 19:21:19,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:19,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894463712] [2025-03-16 19:21:19,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:19,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:19,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-16 19:21:19,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-16 19:21:19,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:19,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:19,161 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-16 19:21:19,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:19,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894463712] [2025-03-16 19:21:19,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894463712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:19,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:19,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:21:19,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876079671] [2025-03-16 19:21:19,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:19,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:21:19,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:19,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:21:19,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:21:19,163 INFO L87 Difference]: Start difference. First operand 9779 states and 14681 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:19,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:19,254 INFO L93 Difference]: Finished difference Result 27229 states and 40475 transitions. [2025-03-16 19:21:19,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:21:19,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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 240 [2025-03-16 19:21:19,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:19,285 INFO L225 Difference]: With dead ends: 27229 [2025-03-16 19:21:19,286 INFO L226 Difference]: Without dead ends: 18755 [2025-03-16 19:21:19,301 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-16 19:21:19,302 INFO L435 NwaCegarLoop]: 1829 mSDtfsCounter, 805 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 2734 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:19,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 2734 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:21:19,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18755 states. [2025-03-16 19:21:19,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18755 to 18732. [2025-03-16 19:21:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18732 states, 18730 states have (on average 1.4854244527495997) internal successors, (27822), 18731 states have internal predecessors, (27822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:19,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18732 states to 18732 states and 27822 transitions. [2025-03-16 19:21:19,640 INFO L78 Accepts]: Start accepts. Automaton has 18732 states and 27822 transitions. Word has length 240 [2025-03-16 19:21:19,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:19,640 INFO L471 AbstractCegarLoop]: Abstraction has 18732 states and 27822 transitions. [2025-03-16 19:21:19,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:19,640 INFO L276 IsEmpty]: Start isEmpty. Operand 18732 states and 27822 transitions. [2025-03-16 19:21:19,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-03-16 19:21:19,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:19,669 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:21:19,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:21:19,669 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:21:19,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:19,670 INFO L85 PathProgramCache]: Analyzing trace with hash -875790918, now seen corresponding path program 1 times [2025-03-16 19:21:19,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:19,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61503458] [2025-03-16 19:21:19,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:19,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:19,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-16 19:21:19,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-16 19:21:19,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:19,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:19,804 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-16 19:21:19,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:19,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61503458] [2025-03-16 19:21:19,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61503458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:19,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:19,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:21:19,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584999158] [2025-03-16 19:21:19,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:19,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:21:19,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:19,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:21:19,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:21:19,806 INFO L87 Difference]: Start difference. First operand 18732 states and 27822 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:19,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:19,953 INFO L93 Difference]: Finished difference Result 54469 states and 80611 transitions. [2025-03-16 19:21:19,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:21:19,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 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 242 [2025-03-16 19:21:19,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:20,014 INFO L225 Difference]: With dead ends: 54469 [2025-03-16 19:21:20,014 INFO L226 Difference]: Without dead ends: 36619 [2025-03-16 19:21:20,042 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-16 19:21:20,043 INFO L435 NwaCegarLoop]: 1810 mSDtfsCounter, 795 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 2715 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:20,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 2715 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:21:20,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36619 states. [2025-03-16 19:21:20,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36619 to 36598. [2025-03-16 19:21:20,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36598 states, 36596 states have (on average 1.4742594819105914) internal successors, (53952), 36597 states have internal predecessors, (53952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:20,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36598 states to 36598 states and 53952 transitions. [2025-03-16 19:21:20,543 INFO L78 Accepts]: Start accepts. Automaton has 36598 states and 53952 transitions. Word has length 242 [2025-03-16 19:21:20,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:20,543 INFO L471 AbstractCegarLoop]: Abstraction has 36598 states and 53952 transitions. [2025-03-16 19:21:20,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:20,543 INFO L276 IsEmpty]: Start isEmpty. Operand 36598 states and 53952 transitions. [2025-03-16 19:21:20,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-03-16 19:21:20,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:20,586 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:21:20,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:21:20,587 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:21:20,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:20,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1991759044, now seen corresponding path program 1 times [2025-03-16 19:21:20,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:20,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524903269] [2025-03-16 19:21:20,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:20,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:20,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-16 19:21:20,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-16 19:21:20,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:20,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:21,148 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-16 19:21:21,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:21,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524903269] [2025-03-16 19:21:21,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524903269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:21,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:21,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:21:21,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496810119] [2025-03-16 19:21:21,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:21,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:21:21,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:21,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:21:21,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:21:21,150 INFO L87 Difference]: Start difference. First operand 36598 states and 53952 transitions. Second operand has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:21,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:21,368 INFO L93 Difference]: Finished difference Result 100808 states and 147525 transitions. [2025-03-16 19:21:21,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:21:21,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 0 states have call successors, (0), 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 242 [2025-03-16 19:21:21,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:21,486 INFO L225 Difference]: With dead ends: 100808 [2025-03-16 19:21:21,486 INFO L226 Difference]: Without dead ends: 67729 [2025-03-16 19:21:21,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:21:21,539 INFO L435 NwaCegarLoop]: 1487 mSDtfsCounter, 898 mSDsluCounter, 2426 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 3913 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:21,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 3913 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:21:21,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67729 states. [2025-03-16 19:21:22,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67729 to 36718. [2025-03-16 19:21:22,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36718 states, 36716 states have (on average 1.4788375640047935) internal successors, (54297), 36717 states have internal predecessors, (54297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:22,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36718 states to 36718 states and 54297 transitions. [2025-03-16 19:21:22,249 INFO L78 Accepts]: Start accepts. Automaton has 36718 states and 54297 transitions. Word has length 242 [2025-03-16 19:21:22,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:22,250 INFO L471 AbstractCegarLoop]: Abstraction has 36718 states and 54297 transitions. [2025-03-16 19:21:22,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:22,250 INFO L276 IsEmpty]: Start isEmpty. Operand 36718 states and 54297 transitions. [2025-03-16 19:21:22,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-03-16 19:21:22,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:22,296 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:21:22,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:21:22,296 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:21:22,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:22,297 INFO L85 PathProgramCache]: Analyzing trace with hash 612914238, now seen corresponding path program 1 times [2025-03-16 19:21:22,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:22,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744008990] [2025-03-16 19:21:22,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:22,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:22,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-03-16 19:21:22,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-03-16 19:21:22,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:22,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:22,409 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-16 19:21:22,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:22,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744008990] [2025-03-16 19:21:22,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744008990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:22,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:22,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:21:22,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214819722] [2025-03-16 19:21:22,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:22,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:21:22,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:22,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:21:22,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:21:22,411 INFO L87 Difference]: Start difference. First operand 36718 states and 54297 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:22,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:22,594 INFO L93 Difference]: Finished difference Result 97159 states and 142129 transitions. [2025-03-16 19:21:22,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:21:22,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 245 [2025-03-16 19:21:22,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:22,687 INFO L225 Difference]: With dead ends: 97159 [2025-03-16 19:21:22,687 INFO L226 Difference]: Without dead ends: 66905 [2025-03-16 19:21:22,725 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-16 19:21:22,726 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 802 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 1896 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:22,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 1896 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:21:22,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66905 states. [2025-03-16 19:21:23,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66905 to 37207. [2025-03-16 19:21:23,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37207 states, 37205 states have (on average 1.4756887515118935) internal successors, (54903), 37206 states have internal predecessors, (54903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:23,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37207 states to 37207 states and 54903 transitions. [2025-03-16 19:21:23,363 INFO L78 Accepts]: Start accepts. Automaton has 37207 states and 54903 transitions. Word has length 245 [2025-03-16 19:21:23,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:23,364 INFO L471 AbstractCegarLoop]: Abstraction has 37207 states and 54903 transitions. [2025-03-16 19:21:23,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:23,364 INFO L276 IsEmpty]: Start isEmpty. Operand 37207 states and 54903 transitions. [2025-03-16 19:21:23,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-16 19:21:23,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:23,402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:21:23,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:21:23,402 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:21:23,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:23,403 INFO L85 PathProgramCache]: Analyzing trace with hash -43018075, now seen corresponding path program 1 times [2025-03-16 19:21:23,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:23,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853322715] [2025-03-16 19:21:23,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:23,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:23,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-16 19:21:23,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-16 19:21:23,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:23,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:23,907 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-16 19:21:23,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:23,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853322715] [2025-03-16 19:21:23,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853322715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:23,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:23,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:21:23,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437520827] [2025-03-16 19:21:23,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:23,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:21:23,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:23,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:21:23,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:21:23,910 INFO L87 Difference]: Start difference. First operand 37207 states and 54903 transitions. Second operand has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:24,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:24,133 INFO L93 Difference]: Finished difference Result 64386 states and 94252 transitions. [2025-03-16 19:21:24,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:21:24,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 0 states have call successors, (0), 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 246 [2025-03-16 19:21:24,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:24,173 INFO L225 Difference]: With dead ends: 64386 [2025-03-16 19:21:24,174 INFO L226 Difference]: Without dead ends: 33489 [2025-03-16 19:21:24,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:21:24,190 INFO L435 NwaCegarLoop]: 1076 mSDtfsCounter, 87 mSDsluCounter, 2020 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 3096 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:24,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 3096 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:21:24,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33489 states. [2025-03-16 19:21:24,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33489 to 33054. [2025-03-16 19:21:24,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33054 states, 33052 states have (on average 1.4763705675904635) internal successors, (48797), 33053 states have internal predecessors, (48797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:24,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33054 states to 33054 states and 48797 transitions. [2025-03-16 19:21:24,470 INFO L78 Accepts]: Start accepts. Automaton has 33054 states and 48797 transitions. Word has length 246 [2025-03-16 19:21:24,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:24,470 INFO L471 AbstractCegarLoop]: Abstraction has 33054 states and 48797 transitions. [2025-03-16 19:21:24,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:24,470 INFO L276 IsEmpty]: Start isEmpty. Operand 33054 states and 48797 transitions. [2025-03-16 19:21:24,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-16 19:21:24,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:24,495 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:21:24,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:21:24,496 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:21:24,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:24,497 INFO L85 PathProgramCache]: Analyzing trace with hash -953721857, now seen corresponding path program 1 times [2025-03-16 19:21:24,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:24,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555385417] [2025-03-16 19:21:24,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:24,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:24,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-16 19:21:24,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-16 19:21:24,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:24,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:25,286 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-16 19:21:25,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:25,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555385417] [2025-03-16 19:21:25,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555385417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:25,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:25,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:21:25,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301380728] [2025-03-16 19:21:25,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:25,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:21:25,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:25,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:21:25,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:21:25,289 INFO L87 Difference]: Start difference. First operand 33054 states and 48797 transitions. Second operand has 13 states, 13 states have (on average 18.923076923076923) internal successors, (246), 13 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:26,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:26,255 INFO L93 Difference]: Finished difference Result 57274 states and 84282 transitions. [2025-03-16 19:21:26,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 19:21:26,255 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 18.923076923076923) internal successors, (246), 13 states have internal predecessors, (246), 0 states have call successors, (0), 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 246 [2025-03-16 19:21:26,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:26,315 INFO L225 Difference]: With dead ends: 57274 [2025-03-16 19:21:26,316 INFO L226 Difference]: Without dead ends: 53420 [2025-03-16 19:21:26,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:21:26,336 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 5881 mSDsluCounter, 6427 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5881 SdHoareTripleChecker+Valid, 7323 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:26,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5881 Valid, 7323 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:21:26,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53420 states. [2025-03-16 19:21:26,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53420 to 42042. [2025-03-16 19:21:26,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42042 states, 42040 states have (on average 1.4582540437678402) internal successors, (61305), 42041 states have internal predecessors, (61305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:26,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42042 states to 42042 states and 61305 transitions. [2025-03-16 19:21:26,776 INFO L78 Accepts]: Start accepts. Automaton has 42042 states and 61305 transitions. Word has length 246 [2025-03-16 19:21:26,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:26,776 INFO L471 AbstractCegarLoop]: Abstraction has 42042 states and 61305 transitions. [2025-03-16 19:21:26,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.923076923076923) internal successors, (246), 13 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:26,777 INFO L276 IsEmpty]: Start isEmpty. Operand 42042 states and 61305 transitions. [2025-03-16 19:21:26,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-16 19:21:26,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:26,810 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:21:26,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:21:26,810 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:21:26,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:26,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1347100733, now seen corresponding path program 1 times [2025-03-16 19:21:26,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:26,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399234063] [2025-03-16 19:21:26,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:26,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:26,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-16 19:21:27,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-16 19:21:27,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:27,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:27,318 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-16 19:21:27,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:27,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399234063] [2025-03-16 19:21:27,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399234063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:27,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:27,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:21:27,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657026920] [2025-03-16 19:21:27,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:27,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:21:27,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:27,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:21:27,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:21:27,320 INFO L87 Difference]: Start difference. First operand 42042 states and 61305 transitions. Second operand has 4 states, 4 states have (on average 61.5) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:27,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:27,619 INFO L93 Difference]: Finished difference Result 120863 states and 175676 transitions. [2025-03-16 19:21:27,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:21:27,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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 246 [2025-03-16 19:21:27,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:27,714 INFO L225 Difference]: With dead ends: 120863 [2025-03-16 19:21:27,714 INFO L226 Difference]: Without dead ends: 79089 [2025-03-16 19:21:27,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:21:27,760 INFO L435 NwaCegarLoop]: 1538 mSDtfsCounter, 835 mSDsluCounter, 2387 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 3925 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:27,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 3925 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:21:27,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79089 states. [2025-03-16 19:21:28,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79089 to 79072. [2025-03-16 19:21:28,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79072 states, 79070 states have (on average 1.4422663462754521) internal successors, (114040), 79071 states have internal predecessors, (114040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:28,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79072 states to 79072 states and 114040 transitions. [2025-03-16 19:21:28,783 INFO L78 Accepts]: Start accepts. Automaton has 79072 states and 114040 transitions. Word has length 246 [2025-03-16 19:21:28,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:28,784 INFO L471 AbstractCegarLoop]: Abstraction has 79072 states and 114040 transitions. [2025-03-16 19:21:28,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:28,784 INFO L276 IsEmpty]: Start isEmpty. Operand 79072 states and 114040 transitions. [2025-03-16 19:21:28,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-16 19:21:28,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:28,863 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:21:28,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:21:28,864 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:21:28,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:28,864 INFO L85 PathProgramCache]: Analyzing trace with hash -569970175, now seen corresponding path program 1 times [2025-03-16 19:21:28,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:28,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34701909] [2025-03-16 19:21:28,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:28,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:28,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-16 19:21:28,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-16 19:21:28,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:28,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:28,982 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-16 19:21:28,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:28,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34701909] [2025-03-16 19:21:28,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34701909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:28,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:28,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:21:28,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676151684] [2025-03-16 19:21:28,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:28,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:21:28,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:28,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:21:28,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:21:28,984 INFO L87 Difference]: Start difference. First operand 79072 states and 114040 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:29,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:29,460 INFO L93 Difference]: Finished difference Result 227056 states and 325585 transitions. [2025-03-16 19:21:29,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:21:29,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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 248 [2025-03-16 19:21:29,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:29,633 INFO L225 Difference]: With dead ends: 227056 [2025-03-16 19:21:29,633 INFO L226 Difference]: Without dead ends: 153743 [2025-03-16 19:21:29,717 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-16 19:21:29,718 INFO L435 NwaCegarLoop]: 1820 mSDtfsCounter, 795 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 2723 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:29,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 2723 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:21:29,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153743 states. [2025-03-16 19:21:31,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153743 to 153476. [2025-03-16 19:21:31,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153476 states, 153474 states have (on average 1.4289847140232221) internal successors, (219312), 153475 states have internal predecessors, (219312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:32,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153476 states to 153476 states and 219312 transitions. [2025-03-16 19:21:32,001 INFO L78 Accepts]: Start accepts. Automaton has 153476 states and 219312 transitions. Word has length 248 [2025-03-16 19:21:32,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:32,002 INFO L471 AbstractCegarLoop]: Abstraction has 153476 states and 219312 transitions. [2025-03-16 19:21:32,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:32,002 INFO L276 IsEmpty]: Start isEmpty. Operand 153476 states and 219312 transitions. [2025-03-16 19:21:32,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-16 19:21:32,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:32,140 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:21:32,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:21:32,140 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:21:32,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:32,141 INFO L85 PathProgramCache]: Analyzing trace with hash 2004026519, now seen corresponding path program 1 times [2025-03-16 19:21:32,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:32,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883102063] [2025-03-16 19:21:32,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:32,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:32,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-16 19:21:32,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-16 19:21:32,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:32,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:32,206 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-16 19:21:32,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:32,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883102063] [2025-03-16 19:21:32,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883102063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:32,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:32,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:21:32,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223017569] [2025-03-16 19:21:32,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:32,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:21:32,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:32,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:21:32,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:21:32,208 INFO L87 Difference]: Start difference. First operand 153476 states and 219312 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:33,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:33,082 INFO L93 Difference]: Finished difference Result 326680 states and 463609 transitions. [2025-03-16 19:21:33,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:21:33,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 249 [2025-03-16 19:21:33,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:33,282 INFO L225 Difference]: With dead ends: 326680 [2025-03-16 19:21:33,282 INFO L226 Difference]: Without dead ends: 220553 [2025-03-16 19:21:33,323 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-16 19:21:33,323 INFO L435 NwaCegarLoop]: 1505 mSDtfsCounter, 918 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 2448 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:33,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 2448 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:21:33,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220553 states. [2025-03-16 19:21:34,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220553 to 151104. [2025-03-16 19:21:35,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151104 states, 151102 states have (on average 1.425421238633506) internal successors, (215384), 151103 states have internal predecessors, (215384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:35,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151104 states to 151104 states and 215384 transitions. [2025-03-16 19:21:35,322 INFO L78 Accepts]: Start accepts. Automaton has 151104 states and 215384 transitions. Word has length 249 [2025-03-16 19:21:35,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:35,322 INFO L471 AbstractCegarLoop]: Abstraction has 151104 states and 215384 transitions. [2025-03-16 19:21:35,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:35,323 INFO L276 IsEmpty]: Start isEmpty. Operand 151104 states and 215384 transitions. [2025-03-16 19:21:35,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-16 19:21:35,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:35,472 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:21:35,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:21:35,475 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:21:35,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:35,475 INFO L85 PathProgramCache]: Analyzing trace with hash -758150684, now seen corresponding path program 1 times [2025-03-16 19:21:35,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:35,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096448476] [2025-03-16 19:21:35,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:35,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:35,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-16 19:21:35,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-16 19:21:35,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:35,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:35,624 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-16 19:21:35,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:35,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096448476] [2025-03-16 19:21:35,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096448476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:35,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:35,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:21:35,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297373227] [2025-03-16 19:21:35,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:35,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:21:35,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:35,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:21:35,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:21:35,627 INFO L87 Difference]: Start difference. First operand 151104 states and 215384 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:36,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:36,650 INFO L93 Difference]: Finished difference Result 435847 states and 618589 transitions. [2025-03-16 19:21:36,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:21:36,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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 250 [2025-03-16 19:21:36,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:37,242 INFO L225 Difference]: With dead ends: 435847 [2025-03-16 19:21:37,242 INFO L226 Difference]: Without dead ends: 295591 [2025-03-16 19:21:37,311 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-16 19:21:37,312 INFO L435 NwaCegarLoop]: 1797 mSDtfsCounter, 789 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 2700 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:37,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 2700 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:21:37,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295591 states. [2025-03-16 19:21:39,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295591 to 295578. [2025-03-16 19:21:40,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295578 states, 295576 states have (on average 1.4137311554388718) internal successors, (417865), 295577 states have internal predecessors, (417865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:40,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295578 states to 295578 states and 417865 transitions. [2025-03-16 19:21:40,934 INFO L78 Accepts]: Start accepts. Automaton has 295578 states and 417865 transitions. Word has length 250 [2025-03-16 19:21:40,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:40,935 INFO L471 AbstractCegarLoop]: Abstraction has 295578 states and 417865 transitions. [2025-03-16 19:21:40,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:40,935 INFO L276 IsEmpty]: Start isEmpty. Operand 295578 states and 417865 transitions. [2025-03-16 19:21:41,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-16 19:21:41,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:41,161 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:21:41,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:21:41,161 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:21:41,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:41,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1157657114, now seen corresponding path program 1 times [2025-03-16 19:21:41,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:41,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141906954] [2025-03-16 19:21:41,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:41,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:41,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-16 19:21:41,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-16 19:21:41,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:41,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:41,691 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-16 19:21:41,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:41,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141906954] [2025-03-16 19:21:41,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141906954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:41,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:41,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:21:41,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632565946] [2025-03-16 19:21:41,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:41,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:21:41,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:41,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:21:41,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:21:41,693 INFO L87 Difference]: Start difference. First operand 295578 states and 417865 transitions. Second operand has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:44,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:44,515 INFO L93 Difference]: Finished difference Result 1141835 states and 1606697 transitions. [2025-03-16 19:21:44,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:21:44,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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 250 [2025-03-16 19:21:44,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:45,891 INFO L225 Difference]: With dead ends: 1141835 [2025-03-16 19:21:45,891 INFO L226 Difference]: Without dead ends: 848073 [2025-03-16 19:21:46,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:21:46,008 INFO L435 NwaCegarLoop]: 1512 mSDtfsCounter, 1689 mSDsluCounter, 1743 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 3255 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:46,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1689 Valid, 3255 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:21:46,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848073 states. [2025-03-16 19:21:53,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848073 to 572297. [2025-03-16 19:21:53,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572297 states, 572295 states have (on average 1.3990144942730585) internal successors, (800649), 572296 states have internal predecessors, (800649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)