./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-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 0ffe39e5069596e29b504492c7e6b50a86ab43c69c1a6acd2a45f3ed316ecfd7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:20:12,767 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:20:12,818 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:20:12,823 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:20:12,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:20:12,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:20:12,847 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:20:12,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:20:12,847 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:20:12,847 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:20:12,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:20:12,848 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:20:12,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:20:12,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:20:12,848 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:20:12,848 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:20:12,848 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:20:12,848 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:20:12,849 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:20:12,849 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:20:12,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:20:12,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:20:12,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:20:12,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:20:12,849 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:20:12,849 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:20:12,849 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:20:12,849 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:20:12,850 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:20:12,850 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:20:12,850 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:20:12,850 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:20:12,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:20:12,850 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:20:12,850 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:20:12,850 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:20:12,850 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:20:12,850 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:20:12,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:20:12,850 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:20:12,850 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:20:12,850 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:20:12,850 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:20:12,850 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 -> 0ffe39e5069596e29b504492c7e6b50a86ab43c69c1a6acd2a45f3ed316ecfd7 [2025-03-03 15:20:13,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:20:13,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:20:13,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:20:13,137 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:20:13,137 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:20:13,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2025-03-03 15:20:14,281 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d98cd2c98/761a66fa29594f9a9765b1b531b04b94/FLAGe1573b5e7 [2025-03-03 15:20:14,558 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:20:14,560 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2025-03-03 15:20:14,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d98cd2c98/761a66fa29594f9a9765b1b531b04b94/FLAGe1573b5e7 [2025-03-03 15:20:14,854 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d98cd2c98/761a66fa29594f9a9765b1b531b04b94 [2025-03-03 15:20:14,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:20:14,857 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:20:14,858 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:20:14,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:20:14,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:20:14,861 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:20:14" (1/1) ... [2025-03-03 15:20:14,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f4c08a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:20:14, skipping insertion in model container [2025-03-03 15:20:14,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:20:14" (1/1) ... [2025-03-03 15:20:14,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:20:15,172 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[15966,15979] [2025-03-03 15:20:15,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:20:15,240 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:20:15,325 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[15966,15979] [2025-03-03 15:20:15,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:20:15,367 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:20:15,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:20:15 WrapperNode [2025-03-03 15:20:15,368 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:20:15,369 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:20:15,369 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:20:15,369 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:20:15,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:20:15" (1/1) ... [2025-03-03 15:20:15,388 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:20:15" (1/1) ... [2025-03-03 15:20:15,443 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1382 [2025-03-03 15:20:15,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:20:15,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:20:15,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:20:15,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:20:15,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:20:15" (1/1) ... [2025-03-03 15:20:15,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:20:15" (1/1) ... [2025-03-03 15:20:15,457 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:20:15" (1/1) ... [2025-03-03 15:20:15,484 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:20:15,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:20:15" (1/1) ... [2025-03-03 15:20:15,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:20:15" (1/1) ... [2025-03-03 15:20:15,498 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:20:15" (1/1) ... [2025-03-03 15:20:15,500 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:20:15" (1/1) ... [2025-03-03 15:20:15,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:20:15" (1/1) ... [2025-03-03 15:20:15,507 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:20:15" (1/1) ... [2025-03-03 15:20:15,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:20:15,513 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:20:15,514 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:20:15,514 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:20:15,515 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:20:15" (1/1) ... [2025-03-03 15:20:15,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:20:15,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:20:15,541 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:20:15,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:20:15,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:20:15,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:20:15,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:20:15,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:20:15,664 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:20:15,665 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:20:16,556 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1428: havoc main_~node1____CPAchecker_TMP_1~2#1;havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-03 15:20:16,557 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1198: havoc main_~node3____CPAchecker_TMP_1~2#1;havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-03 15:20:16,557 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1034: havoc main_~check__tmp~4#1; [2025-03-03 15:20:16,557 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1313: havoc main_~node2____CPAchecker_TMP_1~2#1;havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-03 15:20:16,557 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L989: havoc main_~node3__newmax~4#1; [2025-03-03 15:20:16,557 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L956: havoc main_~node2__newmax~4#1; [2025-03-03 15:20:16,557 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L923: havoc main_~node1__newmax~4#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1;havoc main_~node3__newmax~3#1;havoc main_~node2__newmax~3#1;havoc main_~node1__newmax~3#1;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_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__newmax~2#1;havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__newmax~2#1;havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#1;havoc main_~node1__newmax~2#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_~node3__newmax~1#1;havoc main_~node2__newmax~1#1;havoc main_~node1__newmax~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_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__newmax~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__newmax~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2025-03-03 15:20:16,629 INFO L? ?]: Removed 99 outVars from TransFormulas that were not future-live. [2025-03-03 15:20:16,629 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:20:16,640 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:20:16,640 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:20:16,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:20:16 BoogieIcfgContainer [2025-03-03 15:20:16,641 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:20:16,642 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:20:16,642 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:20:16,645 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:20:16,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:20:14" (1/3) ... [2025-03-03 15:20:16,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b54b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:20:16, skipping insertion in model container [2025-03-03 15:20:16,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:20:15" (2/3) ... [2025-03-03 15:20:16,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b54b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:20:16, skipping insertion in model container [2025-03-03 15:20:16,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:20:16" (3/3) ... [2025-03-03 15:20:16,647 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2025-03-03 15:20:16,657 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:20:16,659 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c that has 1 procedures, 337 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:20:16,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:20:16,713 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;@683d6e81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:20:16,713 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:20:16,718 INFO L276 IsEmpty]: Start isEmpty. Operand has 337 states, 335 states have (on average 1.773134328358209) internal successors, (594), 336 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:16,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 15:20:16,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:16,731 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] [2025-03-03 15:20:16,732 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:16,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:16,737 INFO L85 PathProgramCache]: Analyzing trace with hash -387221603, now seen corresponding path program 1 times [2025-03-03 15:20:16,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:16,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918192960] [2025-03-03 15:20:16,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:16,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:16,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 15:20:17,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 15:20:17,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:17,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:17,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:17,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:17,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918192960] [2025-03-03 15:20:17,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918192960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:17,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:17,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:20:17,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824654772] [2025-03-03 15:20:17,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:17,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:20:17,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:17,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:20:17,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:20:17,702 INFO L87 Difference]: Start difference. First operand has 337 states, 335 states have (on average 1.773134328358209) internal successors, (594), 336 states have internal predecessors, (594), 0 states have call successors, (0), 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 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:17,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:17,908 INFO L93 Difference]: Finished difference Result 1612 states and 2853 transitions. [2025-03-03 15:20:17,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:20:17,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2025-03-03 15:20:17,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:17,929 INFO L225 Difference]: With dead ends: 1612 [2025-03-03 15:20:17,929 INFO L226 Difference]: Without dead ends: 1276 [2025-03-03 15:20:17,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:20:17,938 INFO L435 NwaCegarLoop]: 1012 mSDtfsCounter, 1732 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1732 SdHoareTripleChecker+Valid, 2650 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:17,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1732 Valid, 2650 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:20:17,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2025-03-03 15:20:18,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 642. [2025-03-03 15:20:18,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 1.4617784711388455) internal successors, (937), 641 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 937 transitions. [2025-03-03 15:20:18,020 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 937 transitions. Word has length 153 [2025-03-03 15:20:18,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:18,020 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 937 transitions. [2025-03-03 15:20:18,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:18,021 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 937 transitions. [2025-03-03 15:20:18,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 15:20:18,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:18,025 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] [2025-03-03 15:20:18,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:20:18,026 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:18,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:18,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1035664996, now seen corresponding path program 1 times [2025-03-03 15:20:18,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:18,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310252654] [2025-03-03 15:20:18,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:18,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:18,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 15:20:18,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 15:20:18,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:18,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:18,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:18,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:18,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310252654] [2025-03-03 15:20:18,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310252654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:18,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:18,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:20:18,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442821983] [2025-03-03 15:20:18,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:18,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:20:18,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:18,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:20:18,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:18,177 INFO L87 Difference]: Start difference. First operand 642 states and 937 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:18,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:18,204 INFO L93 Difference]: Finished difference Result 1258 states and 1831 transitions. [2025-03-03 15:20:18,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:20:18,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2025-03-03 15:20:18,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:18,208 INFO L225 Difference]: With dead ends: 1258 [2025-03-03 15:20:18,209 INFO L226 Difference]: Without dead ends: 644 [2025-03-03 15:20:18,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:18,213 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 0 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:18,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 982 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:20:18,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-03-03 15:20:18,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2025-03-03 15:20:18,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 1.4603421461897357) internal successors, (939), 643 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:18,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 939 transitions. [2025-03-03 15:20:18,233 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 939 transitions. Word has length 154 [2025-03-03 15:20:18,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:18,233 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 939 transitions. [2025-03-03 15:20:18,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:18,235 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 939 transitions. [2025-03-03 15:20:18,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 15:20:18,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:18,238 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] [2025-03-03 15:20:18,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:20:18,238 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:18,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:18,239 INFO L85 PathProgramCache]: Analyzing trace with hash 53646885, now seen corresponding path program 1 times [2025-03-03 15:20:18,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:18,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627003718] [2025-03-03 15:20:18,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:18,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:18,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 15:20:18,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 15:20:18,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:18,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:18,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:18,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:18,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627003718] [2025-03-03 15:20:18,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627003718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:18,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:18,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:20:18,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257913513] [2025-03-03 15:20:18,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:18,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:20:18,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:18,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:20:18,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:20:18,695 INFO L87 Difference]: Start difference. First operand 644 states and 939 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:18,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:18,802 INFO L93 Difference]: Finished difference Result 3034 states and 4389 transitions. [2025-03-03 15:20:18,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:20:18,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2025-03-03 15:20:18,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:18,810 INFO L225 Difference]: With dead ends: 3034 [2025-03-03 15:20:18,810 INFO L226 Difference]: Without dead ends: 2420 [2025-03-03 15:20:18,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:20:18,812 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 1374 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:18,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 2138 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:20:18,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2025-03-03 15:20:18,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 1226. [2025-03-03 15:20:18,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 1225 states have (on average 1.4383673469387754) internal successors, (1762), 1225 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:18,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1762 transitions. [2025-03-03 15:20:18,844 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1762 transitions. Word has length 155 [2025-03-03 15:20:18,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:18,845 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1762 transitions. [2025-03-03 15:20:18,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:18,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1762 transitions. [2025-03-03 15:20:18,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:20:18,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:18,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:20:18,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:20:18,847 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:18,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:18,848 INFO L85 PathProgramCache]: Analyzing trace with hash -859505820, now seen corresponding path program 1 times [2025-03-03 15:20:18,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:18,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723839662] [2025-03-03 15:20:18,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:18,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:18,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:20:18,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:20:18,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:18,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:18,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:18,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:18,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723839662] [2025-03-03 15:20:18,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723839662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:18,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:18,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:20:18,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170204154] [2025-03-03 15:20:18,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:18,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:20:18,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:18,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:20:18,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:18,929 INFO L87 Difference]: Start difference. First operand 1226 states and 1762 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:18,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:18,950 INFO L93 Difference]: Finished difference Result 2412 states and 3461 transitions. [2025-03-03 15:20:18,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:20:18,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2025-03-03 15:20:18,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:18,954 INFO L225 Difference]: With dead ends: 2412 [2025-03-03 15:20:18,954 INFO L226 Difference]: Without dead ends: 1230 [2025-03-03 15:20:18,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:18,956 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 0 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:18,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 982 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:20:18,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2025-03-03 15:20:18,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1230. [2025-03-03 15:20:18,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1229 states have (on average 1.436940602115541) internal successors, (1766), 1229 states have internal predecessors, (1766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:18,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1766 transitions. [2025-03-03 15:20:18,978 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1766 transitions. Word has length 156 [2025-03-03 15:20:18,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:18,978 INFO L471 AbstractCegarLoop]: Abstraction has 1230 states and 1766 transitions. [2025-03-03 15:20:18,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:18,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1766 transitions. [2025-03-03 15:20:18,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 15:20:18,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:18,980 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] [2025-03-03 15:20:18,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:20:18,980 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:18,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:18,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1549709485, now seen corresponding path program 1 times [2025-03-03 15:20:18,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:18,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360123837] [2025-03-03 15:20:18,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:18,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:18,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 15:20:19,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 15:20:19,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:19,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:19,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:19,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:19,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360123837] [2025-03-03 15:20:19,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360123837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:19,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:19,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:20:19,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049560180] [2025-03-03 15:20:19,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:19,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:20:19,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:19,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:20:19,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:20:19,346 INFO L87 Difference]: Start difference. First operand 1230 states and 1766 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:19,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:19,372 INFO L93 Difference]: Finished difference Result 2428 states and 3485 transitions. [2025-03-03 15:20:19,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:20:19,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 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 157 [2025-03-03 15:20:19,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:19,377 INFO L225 Difference]: With dead ends: 2428 [2025-03-03 15:20:19,377 INFO L226 Difference]: Without dead ends: 1226 [2025-03-03 15:20:19,378 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-03 15:20:19,380 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 14 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:19,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1530 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:20:19,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2025-03-03 15:20:19,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1226. [2025-03-03 15:20:19,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 1225 states have (on average 1.4351020408163266) internal successors, (1758), 1225 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:19,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1758 transitions. [2025-03-03 15:20:19,409 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1758 transitions. Word has length 157 [2025-03-03 15:20:19,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:19,409 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1758 transitions. [2025-03-03 15:20:19,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:19,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1758 transitions. [2025-03-03 15:20:19,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 15:20:19,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:19,411 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] [2025-03-03 15:20:19,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:20:19,412 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:19,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:19,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2038453656, now seen corresponding path program 1 times [2025-03-03 15:20:19,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:19,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284789133] [2025-03-03 15:20:19,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:19,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:19,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 15:20:19,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 15:20:19,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:19,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:19,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:19,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:19,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284789133] [2025-03-03 15:20:19,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284789133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:19,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:19,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:20:19,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032607764] [2025-03-03 15:20:19,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:19,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:20:19,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:19,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:20:19,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:19,505 INFO L87 Difference]: Start difference. First operand 1226 states and 1758 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:19,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:19,557 INFO L93 Difference]: Finished difference Result 2700 states and 3903 transitions. [2025-03-03 15:20:19,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:20:19,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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 157 [2025-03-03 15:20:19,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:19,564 INFO L225 Difference]: With dead ends: 2700 [2025-03-03 15:20:19,564 INFO L226 Difference]: Without dead ends: 1806 [2025-03-03 15:20:19,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:19,567 INFO L435 NwaCegarLoop]: 912 mSDtfsCounter, 408 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:19,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 1350 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:20:19,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2025-03-03 15:20:19,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1804. [2025-03-03 15:20:19,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1803 states have (on average 1.415973377703827) internal successors, (2553), 1803 states have internal predecessors, (2553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:19,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2553 transitions. [2025-03-03 15:20:19,605 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2553 transitions. Word has length 157 [2025-03-03 15:20:19,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:19,606 INFO L471 AbstractCegarLoop]: Abstraction has 1804 states and 2553 transitions. [2025-03-03 15:20:19,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:19,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2553 transitions. [2025-03-03 15:20:19,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-03 15:20:19,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:19,609 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] [2025-03-03 15:20:19,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:20:19,609 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:19,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:19,609 INFO L85 PathProgramCache]: Analyzing trace with hash 306153127, now seen corresponding path program 1 times [2025-03-03 15:20:19,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:19,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345293488] [2025-03-03 15:20:19,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:19,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:19,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 15:20:19,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 15:20:19,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:19,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:19,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:19,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:19,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345293488] [2025-03-03 15:20:19,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345293488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:19,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:19,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:20:19,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462188153] [2025-03-03 15:20:19,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:19,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:20:19,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:19,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:20:19,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:19,688 INFO L87 Difference]: Start difference. First operand 1804 states and 2553 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:19,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:19,743 INFO L93 Difference]: Finished difference Result 3878 states and 5635 transitions. [2025-03-03 15:20:19,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:20:19,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2025-03-03 15:20:19,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:19,753 INFO L225 Difference]: With dead ends: 3878 [2025-03-03 15:20:19,753 INFO L226 Difference]: Without dead ends: 2483 [2025-03-03 15:20:19,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:19,757 INFO L435 NwaCegarLoop]: 678 mSDtfsCounter, 304 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:19,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1027 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:20:19,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2025-03-03 15:20:19,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 2213. [2025-03-03 15:20:19,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2213 states, 2212 states have (on average 1.4520795660036165) internal successors, (3212), 2212 states have internal predecessors, (3212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:19,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 3212 transitions. [2025-03-03 15:20:19,849 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 3212 transitions. Word has length 159 [2025-03-03 15:20:19,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:19,849 INFO L471 AbstractCegarLoop]: Abstraction has 2213 states and 3212 transitions. [2025-03-03 15:20:19,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:19,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 3212 transitions. [2025-03-03 15:20:19,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 15:20:19,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:19,853 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] [2025-03-03 15:20:19,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:20:19,853 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:19,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:19,854 INFO L85 PathProgramCache]: Analyzing trace with hash 812751464, now seen corresponding path program 1 times [2025-03-03 15:20:19,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:19,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608843673] [2025-03-03 15:20:19,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:19,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:19,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 15:20:19,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 15:20:19,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:19,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:19,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:19,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608843673] [2025-03-03 15:20:19,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608843673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:19,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:19,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:20:19,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169007354] [2025-03-03 15:20:19,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:19,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:20:19,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:19,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:20:19,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:19,956 INFO L87 Difference]: Start difference. First operand 2213 states and 3212 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:20,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:20,016 INFO L93 Difference]: Finished difference Result 4933 states and 7378 transitions. [2025-03-03 15:20:20,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:20:20,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2025-03-03 15:20:20,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:20,026 INFO L225 Difference]: With dead ends: 4933 [2025-03-03 15:20:20,026 INFO L226 Difference]: Without dead ends: 3209 [2025-03-03 15:20:20,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:20,030 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 299 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:20,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1006 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:20:20,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3209 states. [2025-03-03 15:20:20,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3209 to 2932. [2025-03-03 15:20:20,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2932 states, 2931 states have (on average 1.489252814738997) internal successors, (4365), 2931 states have internal predecessors, (4365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:20,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2932 states to 2932 states and 4365 transitions. [2025-03-03 15:20:20,107 INFO L78 Accepts]: Start accepts. Automaton has 2932 states and 4365 transitions. Word has length 161 [2025-03-03 15:20:20,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:20,107 INFO L471 AbstractCegarLoop]: Abstraction has 2932 states and 4365 transitions. [2025-03-03 15:20:20,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:20,107 INFO L276 IsEmpty]: Start isEmpty. Operand 2932 states and 4365 transitions. [2025-03-03 15:20:20,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 15:20:20,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:20,110 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] [2025-03-03 15:20:20,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:20:20,110 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:20,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:20,111 INFO L85 PathProgramCache]: Analyzing trace with hash -911355944, now seen corresponding path program 1 times [2025-03-03 15:20:20,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:20,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680214621] [2025-03-03 15:20:20,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:20,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:20,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 15:20:20,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 15:20:20,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:20,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:20,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:20,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:20,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680214621] [2025-03-03 15:20:20,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680214621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:20,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:20,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:20:20,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243963033] [2025-03-03 15:20:20,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:20,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:20:20,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:20,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:20:20,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:20:20,586 INFO L87 Difference]: Start difference. First operand 2932 states and 4365 transitions. Second operand has 9 states, 9 states have (on average 18.0) internal successors, (162), 8 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:21,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:21,311 INFO L93 Difference]: Finished difference Result 12784 states and 19746 transitions. [2025-03-03 15:20:21,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:20:21,311 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 8 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-03-03 15:20:21,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:21,348 INFO L225 Difference]: With dead ends: 12784 [2025-03-03 15:20:21,349 INFO L226 Difference]: Without dead ends: 10175 [2025-03-03 15:20:21,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:20:21,357 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 4392 mSDsluCounter, 1968 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4392 SdHoareTripleChecker+Valid, 2344 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:21,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4392 Valid, 2344 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:20:21,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10175 states. [2025-03-03 15:20:21,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10175 to 6834. [2025-03-03 15:20:21,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6834 states, 6833 states have (on average 1.519683887018879) internal successors, (10384), 6833 states have internal predecessors, (10384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:21,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6834 states to 6834 states and 10384 transitions. [2025-03-03 15:20:21,568 INFO L78 Accepts]: Start accepts. Automaton has 6834 states and 10384 transitions. Word has length 162 [2025-03-03 15:20:21,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:21,569 INFO L471 AbstractCegarLoop]: Abstraction has 6834 states and 10384 transitions. [2025-03-03 15:20:21,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 8 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:21,569 INFO L276 IsEmpty]: Start isEmpty. Operand 6834 states and 10384 transitions. [2025-03-03 15:20:21,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 15:20:21,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:21,574 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] [2025-03-03 15:20:21,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:20:21,575 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:21,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:21,576 INFO L85 PathProgramCache]: Analyzing trace with hash -770807334, now seen corresponding path program 1 times [2025-03-03 15:20:21,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:21,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69367659] [2025-03-03 15:20:21,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:21,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:21,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 15:20:21,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 15:20:21,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:21,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:21,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:21,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:21,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69367659] [2025-03-03 15:20:21,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69367659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:21,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:21,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:20:21,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890079699] [2025-03-03 15:20:21,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:21,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:20:21,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:21,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:20:21,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:20:21,873 INFO L87 Difference]: Start difference. First operand 6834 states and 10384 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:21,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:21,992 INFO L93 Difference]: Finished difference Result 13423 states and 20965 transitions. [2025-03-03 15:20:21,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:20:21,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-03-03 15:20:21,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:22,009 INFO L225 Difference]: With dead ends: 13423 [2025-03-03 15:20:22,010 INFO L226 Difference]: Without dead ends: 8617 [2025-03-03 15:20:22,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-03 15:20:22,019 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 627 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:22,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 954 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:20:22,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8617 states. [2025-03-03 15:20:22,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8617 to 8615. [2025-03-03 15:20:22,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8615 states, 8614 states have (on average 1.526236359414906) internal successors, (13147), 8614 states have internal predecessors, (13147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:22,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8615 states to 8615 states and 13147 transitions. [2025-03-03 15:20:22,189 INFO L78 Accepts]: Start accepts. Automaton has 8615 states and 13147 transitions. Word has length 162 [2025-03-03 15:20:22,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:22,191 INFO L471 AbstractCegarLoop]: Abstraction has 8615 states and 13147 transitions. [2025-03-03 15:20:22,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:22,192 INFO L276 IsEmpty]: Start isEmpty. Operand 8615 states and 13147 transitions. [2025-03-03 15:20:22,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 15:20:22,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:22,196 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] [2025-03-03 15:20:22,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:20:22,197 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:22,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:22,197 INFO L85 PathProgramCache]: Analyzing trace with hash -348105508, now seen corresponding path program 1 times [2025-03-03 15:20:22,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:22,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984973645] [2025-03-03 15:20:22,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:22,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:22,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 15:20:22,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 15:20:22,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:22,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:22,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:22,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:22,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984973645] [2025-03-03 15:20:22,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984973645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:22,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:22,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:20:22,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918494596] [2025-03-03 15:20:22,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:22,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:20:22,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:22,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:20:22,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:20:22,597 INFO L87 Difference]: Start difference. First operand 8615 states and 13147 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:22,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:22,674 INFO L93 Difference]: Finished difference Result 17216 states and 26273 transitions. [2025-03-03 15:20:22,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:20:22,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-03-03 15:20:22,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:22,690 INFO L225 Difference]: With dead ends: 17216 [2025-03-03 15:20:22,691 INFO L226 Difference]: Without dead ends: 8615 [2025-03-03 15:20:22,702 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-03 15:20:22,702 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 18 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:22,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1504 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:20:22,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8615 states. [2025-03-03 15:20:22,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8615 to 8614. [2025-03-03 15:20:22,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8614 states, 8613 states have (on average 1.5260652502031813) internal successors, (13144), 8613 states have internal predecessors, (13144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8614 states to 8614 states and 13144 transitions. [2025-03-03 15:20:22,867 INFO L78 Accepts]: Start accepts. Automaton has 8614 states and 13144 transitions. Word has length 162 [2025-03-03 15:20:22,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:22,867 INFO L471 AbstractCegarLoop]: Abstraction has 8614 states and 13144 transitions. [2025-03-03 15:20:22,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:22,868 INFO L276 IsEmpty]: Start isEmpty. Operand 8614 states and 13144 transitions. [2025-03-03 15:20:22,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 15:20:22,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:22,872 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] [2025-03-03 15:20:22,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:20:22,873 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:22,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:22,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1782740927, now seen corresponding path program 1 times [2025-03-03 15:20:22,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:22,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793140507] [2025-03-03 15:20:22,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:22,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:22,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 15:20:22,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 15:20:22,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:22,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:22,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:22,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:22,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793140507] [2025-03-03 15:20:22,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793140507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:22,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:22,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:20:22,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246629614] [2025-03-03 15:20:22,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:22,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:20:22,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:22,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:20:22,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:22,983 INFO L87 Difference]: Start difference. First operand 8614 states and 13144 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:23,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:23,086 INFO L93 Difference]: Finished difference Result 23967 states and 36612 transitions. [2025-03-03 15:20:23,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:20:23,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-03-03 15:20:23,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:23,116 INFO L225 Difference]: With dead ends: 23967 [2025-03-03 15:20:23,116 INFO L226 Difference]: Without dead ends: 15865 [2025-03-03 15:20:23,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:23,131 INFO L435 NwaCegarLoop]: 907 mSDtfsCounter, 399 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:23,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1341 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:20:23,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15865 states. [2025-03-03 15:20:23,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15865 to 15863. [2025-03-03 15:20:23,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15863 states, 15862 states have (on average 1.5064935064935066) internal successors, (23896), 15862 states have internal predecessors, (23896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:23,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15863 states to 15863 states and 23896 transitions. [2025-03-03 15:20:23,443 INFO L78 Accepts]: Start accepts. Automaton has 15863 states and 23896 transitions. Word has length 162 [2025-03-03 15:20:23,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:23,443 INFO L471 AbstractCegarLoop]: Abstraction has 15863 states and 23896 transitions. [2025-03-03 15:20:23,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:23,444 INFO L276 IsEmpty]: Start isEmpty. Operand 15863 states and 23896 transitions. [2025-03-03 15:20:23,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 15:20:23,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:23,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:20:23,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:20:23,452 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:23,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:23,453 INFO L85 PathProgramCache]: Analyzing trace with hash 316997503, now seen corresponding path program 1 times [2025-03-03 15:20:23,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:23,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014716211] [2025-03-03 15:20:23,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:23,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:23,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 15:20:23,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 15:20:23,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:23,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:23,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:23,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014716211] [2025-03-03 15:20:23,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014716211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:23,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:23,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:20:23,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940243718] [2025-03-03 15:20:23,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:23,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:20:23,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:23,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:20:23,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:20:23,791 INFO L87 Difference]: Start difference. First operand 15863 states and 23896 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:23,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:23,904 INFO L93 Difference]: Finished difference Result 27736 states and 41851 transitions. [2025-03-03 15:20:23,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:20:23,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-03-03 15:20:23,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:23,926 INFO L225 Difference]: With dead ends: 27736 [2025-03-03 15:20:23,926 INFO L226 Difference]: Without dead ends: 12353 [2025-03-03 15:20:23,944 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-03 15:20:23,944 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 21 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:23,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1508 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:20:23,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12353 states. [2025-03-03 15:20:24,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12353 to 12353. [2025-03-03 15:20:24,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12353 states, 12352 states have (on average 1.5012953367875648) internal successors, (18544), 12352 states have internal predecessors, (18544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:24,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12353 states to 12353 states and 18544 transitions. [2025-03-03 15:20:24,168 INFO L78 Accepts]: Start accepts. Automaton has 12353 states and 18544 transitions. Word has length 162 [2025-03-03 15:20:24,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:24,168 INFO L471 AbstractCegarLoop]: Abstraction has 12353 states and 18544 transitions. [2025-03-03 15:20:24,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:24,168 INFO L276 IsEmpty]: Start isEmpty. Operand 12353 states and 18544 transitions. [2025-03-03 15:20:24,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 15:20:24,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:24,174 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] [2025-03-03 15:20:24,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:20:24,174 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:24,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:24,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1531752184, now seen corresponding path program 1 times [2025-03-03 15:20:24,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:24,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520048761] [2025-03-03 15:20:24,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:24,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:24,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 15:20:24,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 15:20:24,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:24,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:24,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:24,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:24,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520048761] [2025-03-03 15:20:24,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520048761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:24,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:24,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:20:24,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784832420] [2025-03-03 15:20:24,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:24,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:20:24,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:24,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:20:24,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:24,239 INFO L87 Difference]: Start difference. First operand 12353 states and 18544 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:24,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:24,330 INFO L93 Difference]: Finished difference Result 31593 states and 48122 transitions. [2025-03-03 15:20:24,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:20:24,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-03-03 15:20:24,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:24,366 INFO L225 Difference]: With dead ends: 31593 [2025-03-03 15:20:24,366 INFO L226 Difference]: Without dead ends: 19733 [2025-03-03 15:20:24,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:24,385 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 297 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:24,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1028 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:20:24,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19733 states. [2025-03-03 15:20:24,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19733 to 18165. [2025-03-03 15:20:24,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18165 states, 18164 states have (on average 1.5352345298392425) internal successors, (27886), 18164 states have internal predecessors, (27886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:24,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18165 states to 18165 states and 27886 transitions. [2025-03-03 15:20:24,807 INFO L78 Accepts]: Start accepts. Automaton has 18165 states and 27886 transitions. Word has length 164 [2025-03-03 15:20:24,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:24,807 INFO L471 AbstractCegarLoop]: Abstraction has 18165 states and 27886 transitions. [2025-03-03 15:20:24,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:24,808 INFO L276 IsEmpty]: Start isEmpty. Operand 18165 states and 27886 transitions. [2025-03-03 15:20:24,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:20:24,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:24,814 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] [2025-03-03 15:20:24,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:20:24,815 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:24,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:24,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1909891245, now seen corresponding path program 1 times [2025-03-03 15:20:24,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:24,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845745103] [2025-03-03 15:20:24,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:24,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:24,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:20:24,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:20:24,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:24,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:25,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:25,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:25,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845745103] [2025-03-03 15:20:25,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845745103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:25,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:25,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:20:25,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906194629] [2025-03-03 15:20:25,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:25,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:20:25,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:25,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:20:25,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:20:25,267 INFO L87 Difference]: Start difference. First operand 18165 states and 27886 transitions. Second operand has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 8 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:26,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:26,201 INFO L93 Difference]: Finished difference Result 93353 states and 143888 transitions. [2025-03-03 15:20:26,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:20:26,208 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 8 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-03-03 15:20:26,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:26,366 INFO L225 Difference]: With dead ends: 93353 [2025-03-03 15:20:26,366 INFO L226 Difference]: Without dead ends: 75783 [2025-03-03 15:20:26,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:20:26,386 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 4914 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4914 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:26,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4914 Valid, 2252 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:20:26,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75783 states. [2025-03-03 15:20:27,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75783 to 47156. [2025-03-03 15:20:27,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47156 states, 47155 states have (on average 1.52675220019086) internal successors, (71994), 47155 states have internal predecessors, (71994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:27,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47156 states to 47156 states and 71994 transitions. [2025-03-03 15:20:27,275 INFO L78 Accepts]: Start accepts. Automaton has 47156 states and 71994 transitions. Word has length 167 [2025-03-03 15:20:27,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:27,276 INFO L471 AbstractCegarLoop]: Abstraction has 47156 states and 71994 transitions. [2025-03-03 15:20:27,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 8 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:27,276 INFO L276 IsEmpty]: Start isEmpty. Operand 47156 states and 71994 transitions. [2025-03-03 15:20:27,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:20:27,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:27,292 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] [2025-03-03 15:20:27,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:20:27,292 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:27,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:27,293 INFO L85 PathProgramCache]: Analyzing trace with hash -84253461, now seen corresponding path program 1 times [2025-03-03 15:20:27,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:27,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27415586] [2025-03-03 15:20:27,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:27,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:27,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:20:27,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:20:27,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:27,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:27,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:27,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:27,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27415586] [2025-03-03 15:20:27,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27415586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:27,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:27,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:20:27,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098696788] [2025-03-03 15:20:27,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:27,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:20:27,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:27,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:20:27,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:20:27,551 INFO L87 Difference]: Start difference. First operand 47156 states and 71994 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:27,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:27,982 INFO L93 Difference]: Finished difference Result 102574 states and 159023 transitions. [2025-03-03 15:20:27,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:20:27,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-03-03 15:20:27,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:28,069 INFO L225 Difference]: With dead ends: 102574 [2025-03-03 15:20:28,070 INFO L226 Difference]: Without dead ends: 62278 [2025-03-03 15:20:28,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-03 15:20:28,101 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 834 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:28,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 876 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:20:28,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62278 states. [2025-03-03 15:20:28,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62278 to 62276. [2025-03-03 15:20:28,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62276 states, 62275 states have (on average 1.532059413890004) internal successors, (95409), 62275 states have internal predecessors, (95409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:29,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62276 states to 62276 states and 95409 transitions. [2025-03-03 15:20:29,030 INFO L78 Accepts]: Start accepts. Automaton has 62276 states and 95409 transitions. Word has length 167 [2025-03-03 15:20:29,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:29,031 INFO L471 AbstractCegarLoop]: Abstraction has 62276 states and 95409 transitions. [2025-03-03 15:20:29,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:29,031 INFO L276 IsEmpty]: Start isEmpty. Operand 62276 states and 95409 transitions. [2025-03-03 15:20:29,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:20:29,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:29,046 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] [2025-03-03 15:20:29,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:20:29,046 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:29,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:29,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1095370711, now seen corresponding path program 1 times [2025-03-03 15:20:29,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:29,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981856675] [2025-03-03 15:20:29,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:29,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:29,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:20:29,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:20:29,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:29,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:29,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:29,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981856675] [2025-03-03 15:20:29,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981856675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:29,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:29,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:20:29,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849337774] [2025-03-03 15:20:29,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:29,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:20:29,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:29,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:20:29,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:20:29,362 INFO L87 Difference]: Start difference. First operand 62276 states and 95409 transitions. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:29,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:29,866 INFO L93 Difference]: Finished difference Result 184190 states and 285709 transitions. [2025-03-03 15:20:29,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:20:29,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-03-03 15:20:29,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:30,172 INFO L225 Difference]: With dead ends: 184190 [2025-03-03 15:20:30,173 INFO L226 Difference]: Without dead ends: 156481 [2025-03-03 15:20:30,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:20:30,402 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 1059 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:30,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 1407 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:20:30,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156481 states. [2025-03-03 15:20:31,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156481 to 118581. [2025-03-03 15:20:31,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118581 states, 118580 states have (on average 1.5400320458762018) internal successors, (182617), 118580 states have internal predecessors, (182617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:32,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118581 states to 118581 states and 182617 transitions. [2025-03-03 15:20:32,061 INFO L78 Accepts]: Start accepts. Automaton has 118581 states and 182617 transitions. Word has length 167 [2025-03-03 15:20:32,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:32,062 INFO L471 AbstractCegarLoop]: Abstraction has 118581 states and 182617 transitions. [2025-03-03 15:20:32,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:32,062 INFO L276 IsEmpty]: Start isEmpty. Operand 118581 states and 182617 transitions. [2025-03-03 15:20:32,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:20:32,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:32,074 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] [2025-03-03 15:20:32,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:20:32,075 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:32,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:32,075 INFO L85 PathProgramCache]: Analyzing trace with hash 679636651, now seen corresponding path program 1 times [2025-03-03 15:20:32,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:32,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591789988] [2025-03-03 15:20:32,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:32,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:32,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:20:32,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:20:32,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:32,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:32,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:32,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:32,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591789988] [2025-03-03 15:20:32,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591789988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:32,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:32,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:20:32,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904846010] [2025-03-03 15:20:32,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:32,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:20:32,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:32,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:20:32,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:32,416 INFO L87 Difference]: Start difference. First operand 118581 states and 182617 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:33,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:33,290 INFO L93 Difference]: Finished difference Result 316363 states and 489195 transitions. [2025-03-03 15:20:33,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:20:33,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-03-03 15:20:33,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:33,680 INFO L225 Difference]: With dead ends: 316363 [2025-03-03 15:20:33,680 INFO L226 Difference]: Without dead ends: 206199 [2025-03-03 15:20:33,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:33,751 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 277 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:33,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 762 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:20:34,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206199 states. [2025-03-03 15:20:36,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206199 to 206197. [2025-03-03 15:20:36,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206197 states, 206196 states have (on average 1.5360288269413567) internal successors, (316723), 206196 states have internal predecessors, (316723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:37,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206197 states to 206197 states and 316723 transitions. [2025-03-03 15:20:37,013 INFO L78 Accepts]: Start accepts. Automaton has 206197 states and 316723 transitions. Word has length 167 [2025-03-03 15:20:37,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:37,013 INFO L471 AbstractCegarLoop]: Abstraction has 206197 states and 316723 transitions. [2025-03-03 15:20:37,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:37,013 INFO L276 IsEmpty]: Start isEmpty. Operand 206197 states and 316723 transitions. [2025-03-03 15:20:37,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:20:37,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:37,033 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] [2025-03-03 15:20:37,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:20:37,033 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:37,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:37,033 INFO L85 PathProgramCache]: Analyzing trace with hash 754780201, now seen corresponding path program 1 times [2025-03-03 15:20:37,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:37,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224815286] [2025-03-03 15:20:37,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:37,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:37,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:20:37,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:20:37,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:37,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:37,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:37,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:37,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224815286] [2025-03-03 15:20:37,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224815286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:37,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:37,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:20:37,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582854359] [2025-03-03 15:20:37,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:37,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:20:37,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:37,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:20:37,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:20:37,348 INFO L87 Difference]: Start difference. First operand 206197 states and 316723 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:38,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:38,300 INFO L93 Difference]: Finished difference Result 284818 states and 437927 transitions. [2025-03-03 15:20:38,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:20:38,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-03-03 15:20:38,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:38,680 INFO L225 Difference]: With dead ends: 284818 [2025-03-03 15:20:38,680 INFO L226 Difference]: Without dead ends: 205251 [2025-03-03 15:20:38,775 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-03 15:20:38,776 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 94 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:38,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1531 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:20:38,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205251 states. [2025-03-03 15:20:41,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205251 to 205251. [2025-03-03 15:20:41,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205251 states, 205250 states have (on average 1.5371254567600487) internal successors, (315495), 205250 states have internal predecessors, (315495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:42,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205251 states to 205251 states and 315495 transitions. [2025-03-03 15:20:42,125 INFO L78 Accepts]: Start accepts. Automaton has 205251 states and 315495 transitions. Word has length 167 [2025-03-03 15:20:42,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:42,125 INFO L471 AbstractCegarLoop]: Abstraction has 205251 states and 315495 transitions. [2025-03-03 15:20:42,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:42,126 INFO L276 IsEmpty]: Start isEmpty. Operand 205251 states and 315495 transitions. [2025-03-03 15:20:42,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:20:42,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:42,139 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] [2025-03-03 15:20:42,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:20:42,139 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:42,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:42,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1101610921, now seen corresponding path program 1 times [2025-03-03 15:20:42,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:42,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97031122] [2025-03-03 15:20:42,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:42,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:42,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:20:42,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:20:42,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:42,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:42,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:42,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:42,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97031122] [2025-03-03 15:20:42,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97031122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:42,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:42,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:20:42,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847101877] [2025-03-03 15:20:42,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:42,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:20:42,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:42,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:20:42,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:20:42,422 INFO L87 Difference]: Start difference. First operand 205251 states and 315495 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:43,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:43,557 INFO L93 Difference]: Finished difference Result 292716 states and 448943 transitions. [2025-03-03 15:20:43,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:20:43,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-03-03 15:20:43,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:43,944 INFO L225 Difference]: With dead ends: 292716 [2025-03-03 15:20:43,944 INFO L226 Difference]: Without dead ends: 204813 [2025-03-03 15:20:44,045 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-03 15:20:44,046 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 97 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:44,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1515 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:20:44,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204813 states. [2025-03-03 15:20:46,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204813 to 204813. [2025-03-03 15:20:46,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204813 states, 204812 states have (on average 1.5374050348612387) internal successors, (314879), 204812 states have internal predecessors, (314879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:47,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204813 states to 204813 states and 314879 transitions. [2025-03-03 15:20:47,239 INFO L78 Accepts]: Start accepts. Automaton has 204813 states and 314879 transitions. Word has length 167 [2025-03-03 15:20:47,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:47,239 INFO L471 AbstractCegarLoop]: Abstraction has 204813 states and 314879 transitions. [2025-03-03 15:20:47,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:47,239 INFO L276 IsEmpty]: Start isEmpty. Operand 204813 states and 314879 transitions. [2025-03-03 15:20:47,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:20:47,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:47,252 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] [2025-03-03 15:20:47,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:20:47,252 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:47,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:47,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1186390359, now seen corresponding path program 1 times [2025-03-03 15:20:47,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:47,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535584220] [2025-03-03 15:20:47,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:47,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:47,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:20:47,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:20:47,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:47,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:47,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:47,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:47,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535584220] [2025-03-03 15:20:47,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535584220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:47,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:47,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:20:47,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727629946] [2025-03-03 15:20:47,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:47,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:20:47,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:47,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:20:47,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:20:47,414 INFO L87 Difference]: Start difference. First operand 204813 states and 314879 transitions. Second operand has 8 states, 8 states have (on average 20.875) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:49,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:49,977 INFO L93 Difference]: Finished difference Result 548875 states and 835286 transitions. [2025-03-03 15:20:49,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:20:49,977 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.875) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-03-03 15:20:49,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:51,095 INFO L225 Difference]: With dead ends: 548875 [2025-03-03 15:20:51,096 INFO L226 Difference]: Without dead ends: 481427 [2025-03-03 15:20:51,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2025-03-03 15:20:51,233 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 5248 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5248 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:51,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5248 Valid, 1185 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:20:51,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481427 states. [2025-03-03 15:20:55,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481427 to 123001. [2025-03-03 15:20:55,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123001 states, 123000 states have (on average 1.53039837398374) internal successors, (188239), 123000 states have internal predecessors, (188239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:56,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123001 states to 123001 states and 188239 transitions. [2025-03-03 15:20:56,132 INFO L78 Accepts]: Start accepts. Automaton has 123001 states and 188239 transitions. Word has length 167 [2025-03-03 15:20:56,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:56,132 INFO L471 AbstractCegarLoop]: Abstraction has 123001 states and 188239 transitions. [2025-03-03 15:20:56,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.875) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:56,132 INFO L276 IsEmpty]: Start isEmpty. Operand 123001 states and 188239 transitions. [2025-03-03 15:20:56,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:20:56,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:56,141 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] [2025-03-03 15:20:56,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:20:56,142 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:56,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:56,142 INFO L85 PathProgramCache]: Analyzing trace with hash -360178007, now seen corresponding path program 1 times [2025-03-03 15:20:56,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:56,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949302760] [2025-03-03 15:20:56,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:56,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:56,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:20:56,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:20:56,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:56,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:56,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:56,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:56,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949302760] [2025-03-03 15:20:56,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949302760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:56,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:56,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:20:56,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038594724] [2025-03-03 15:20:56,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:56,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:20:56,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:56,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:20:56,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:20:56,623 INFO L87 Difference]: Start difference. First operand 123001 states and 188239 transitions. Second operand has 8 states, 8 states have (on average 20.875) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:57,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:57,866 INFO L93 Difference]: Finished difference Result 361749 states and 548061 transitions. [2025-03-03 15:20:57,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:20:57,870 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.875) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-03-03 15:20:57,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:58,469 INFO L225 Difference]: With dead ends: 361749 [2025-03-03 15:20:58,469 INFO L226 Difference]: Without dead ends: 318578 [2025-03-03 15:20:58,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2025-03-03 15:20:58,601 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 5880 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5880 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:58,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5880 Valid, 1267 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:20:59,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318578 states. [2025-03-03 15:21:01,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318578 to 88464. [2025-03-03 15:21:01,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88464 states, 88463 states have (on average 1.5068333653617896) internal successors, (133299), 88463 states have internal predecessors, (133299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:01,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88464 states to 88464 states and 133299 transitions. [2025-03-03 15:21:01,639 INFO L78 Accepts]: Start accepts. Automaton has 88464 states and 133299 transitions. Word has length 167 [2025-03-03 15:21:01,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:21:01,639 INFO L471 AbstractCegarLoop]: Abstraction has 88464 states and 133299 transitions. [2025-03-03 15:21:01,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.875) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:01,639 INFO L276 IsEmpty]: Start isEmpty. Operand 88464 states and 133299 transitions. [2025-03-03 15:21:01,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:21:01,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:21:01,648 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] [2025-03-03 15:21:01,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:21:01,649 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:21:01,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:21:01,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1343205463, now seen corresponding path program 1 times [2025-03-03 15:21:01,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:21:01,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830282647] [2025-03-03 15:21:01,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:21:01,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:21:01,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:21:01,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:21:01,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:21:01,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:21:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:21:01,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:21:01,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830282647] [2025-03-03 15:21:01,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830282647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:21:01,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:21:01,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:21:01,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070621684] [2025-03-03 15:21:01,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:21:01,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:21:01,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:21:01,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:21:01,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:21:01,826 INFO L87 Difference]: Start difference. First operand 88464 states and 133299 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:02,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:21:02,782 INFO L93 Difference]: Finished difference Result 238394 states and 359374 transitions. [2025-03-03 15:21:02,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:21:02,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-03-03 15:21:02,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:21:03,005 INFO L225 Difference]: With dead ends: 238394 [2025-03-03 15:21:03,005 INFO L226 Difference]: Without dead ends: 150070 [2025-03-03 15:21:03,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:21:03,072 INFO L435 NwaCegarLoop]: 770 mSDtfsCounter, 403 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1937 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:21:03,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1937 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:21:03,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150070 states. [2025-03-03 15:21:04,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150070 to 150068. [2025-03-03 15:21:04,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150068 states, 150067 states have (on average 1.49489228144762) internal successors, (224334), 150067 states have internal predecessors, (224334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:05,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150068 states to 150068 states and 224334 transitions. [2025-03-03 15:21:05,243 INFO L78 Accepts]: Start accepts. Automaton has 150068 states and 224334 transitions. Word has length 167 [2025-03-03 15:21:05,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:21:05,244 INFO L471 AbstractCegarLoop]: Abstraction has 150068 states and 224334 transitions. [2025-03-03 15:21:05,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:05,244 INFO L276 IsEmpty]: Start isEmpty. Operand 150068 states and 224334 transitions. [2025-03-03 15:21:05,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 15:21:05,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:21:05,256 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] [2025-03-03 15:21:05,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:21:05,257 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:21:05,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:21:05,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1270915820, now seen corresponding path program 1 times [2025-03-03 15:21:05,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:21:05,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265959886] [2025-03-03 15:21:05,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:21:05,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:21:05,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 15:21:05,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 15:21:05,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:21:05,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:21:05,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:21:05,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:21:05,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265959886] [2025-03-03 15:21:05,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265959886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:21:05,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:21:05,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:21:05,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696107929] [2025-03-03 15:21:05,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:21:05,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:21:05,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:21:05,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:21:05,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:21:05,312 INFO L87 Difference]: Start difference. First operand 150068 states and 224334 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:06,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:21:06,191 INFO L93 Difference]: Finished difference Result 371417 states and 554872 transitions. [2025-03-03 15:21:06,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:21:06,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2025-03-03 15:21:06,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted.