./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7d273a09ef49b5374355f70a7c3526050d90f635e0e9c0c426afbe9f20d712a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:40:28,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:40:28,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:40:28,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:40:28,183 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:40:28,203 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:40:28,204 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:40:28,204 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:40:28,204 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:40:28,204 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:40:28,205 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:40:28,205 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:40:28,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:40:28,205 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:40:28,206 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:40:28,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:40:28,206 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:40:28,206 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:40:28,206 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:40:28,206 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:40:28,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:40:28,206 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:40:28,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:40:28,206 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:40:28,207 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:40:28,207 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:40:28,207 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:40:28,207 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:40:28,207 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:40:28,207 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:40:28,207 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:40:28,207 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:40:28,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:40:28,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:40:28,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:40:28,208 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:40:28,208 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:40:28,208 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:40:28,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:40:28,208 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:40:28,208 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:40:28,208 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:40:28,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:40:28,208 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 -> c7d273a09ef49b5374355f70a7c3526050d90f635e0e9c0c426afbe9f20d712a [2025-03-16 19:40:28,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:40:28,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:40:28,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:40:28,437 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:40:28,437 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:40:28,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-16 19:40:29,590 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f30abb8b/1c7c63fc583649568f8319e42db9b72d/FLAG1fc633e51 [2025-03-16 19:40:29,853 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:40:29,853 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-16 19:40:29,867 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f30abb8b/1c7c63fc583649568f8319e42db9b72d/FLAG1fc633e51 [2025-03-16 19:40:29,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f30abb8b/1c7c63fc583649568f8319e42db9b72d [2025-03-16 19:40:29,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:40:29,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:40:29,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:40:29,881 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:40:29,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:40:29,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:40:29" (1/1) ... [2025-03-16 19:40:29,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5540f65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:40:29, skipping insertion in model container [2025-03-16 19:40:29,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:40:29" (1/1) ... [2025-03-16 19:40:29,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:40:30,134 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[13826,13839] [2025-03-16 19:40:30,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:40:30,206 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:40:30,275 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[13826,13839] [2025-03-16 19:40:30,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:40:30,317 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:40:30,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:40:30 WrapperNode [2025-03-16 19:40:30,318 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:40:30,319 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:40:30,319 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:40:30,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:40:30,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:40:30" (1/1) ... [2025-03-16 19:40:30,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:40:30" (1/1) ... [2025-03-16 19:40:30,371 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1451 [2025-03-16 19:40:30,371 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:40:30,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:40:30,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:40:30,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:40:30,378 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:40:30" (1/1) ... [2025-03-16 19:40:30,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:40:30" (1/1) ... [2025-03-16 19:40:30,384 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:40:30" (1/1) ... [2025-03-16 19:40:30,402 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:40:30,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:40:30" (1/1) ... [2025-03-16 19:40:30,402 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:40:30" (1/1) ... [2025-03-16 19:40:30,414 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:40:30" (1/1) ... [2025-03-16 19:40:30,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:40:30" (1/1) ... [2025-03-16 19:40:30,420 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:40:30" (1/1) ... [2025-03-16 19:40:30,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:40:30" (1/1) ... [2025-03-16 19:40:30,428 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:40:30,429 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:40:30,429 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:40:30,429 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:40:30,432 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:40:30" (1/1) ... [2025-03-16 19:40:30,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:40:30,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:40:30,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:40:30,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:40:30,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:40:30,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:40:30,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:40:30,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:40:30,629 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:40:30,631 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:40:31,612 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1400: havoc main_~node1____CPAchecker_TMP_2~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-16 19:40:31,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235: havoc main_~node2____CPAchecker_TMP_2~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:40:31,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1070: havoc main_~node3____CPAchecker_TMP_2~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:40:31,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L905: havoc main_~node4____CPAchecker_TMP_2~0#1;havoc main_~node4____CPAchecker_TMP_1~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-16 19:40:31,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L575: havoc main_~node3__newmax~0#1; [2025-03-16 19:40:31,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L483: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r141~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r241~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r341~0#1, main_~init__r411~0#1, main_~init__r421~0#1, main_~init__r431~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r142~0#1, main_~init__tmp___1~0#1, main_~init__r212~0#1, main_~init__tmp___2~0#1, main_~init__r232~0#1, main_~init__tmp___3~0#1, main_~init__r242~0#1, main_~init__tmp___4~0#1, main_~init__r312~0#1, main_~init__tmp___5~0#1, main_~init__r322~0#1, main_~init__tmp___6~0#1, main_~init__r342~0#1, main_~init__tmp___7~0#1, main_~init__r412~0#1, main_~init__tmp___8~0#1, main_~init__r422~0#1, main_~init__tmp___9~0#1, main_~init__r432~0#1, main_~init__tmp___10~0#1, main_~init__r123~0#1, main_~init__tmp___11~0#1, main_~init__r133~0#1, main_~init__tmp___12~0#1, main_~init__r143~0#1, main_~init__tmp___13~0#1, main_~init__r213~0#1, main_~init__tmp___14~0#1, main_~init__r233~0#1, main_~init__tmp___15~0#1, main_~init__r243~0#1, main_~init__tmp___16~0#1, main_~init__r313~0#1, main_~init__tmp___17~0#1, main_~init__r323~0#1, main_~init__tmp___18~0#1, main_~init__r343~0#1, main_~init__tmp___19~0#1, main_~init__r413~0#1, main_~init__tmp___20~0#1, main_~init__r423~0#1, main_~init__tmp___21~0#1, main_~init__r433~0#1, main_~init__tmp___22~0#1, main_~init__tmp___23~0#1; [2025-03-16 19:40:31,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L621: havoc main_~node4__newmax~0#1; [2025-03-16 19:40:31,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L726: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-16 19:40:31,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L529: havoc main_~node2__newmax~0#1; [2025-03-16 19:40:31,726 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-03-16 19:40:31,726 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:40:31,745 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:40:31,747 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:40:31,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:40:31 BoogieIcfgContainer [2025-03-16 19:40:31,747 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:40:31,749 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:40:31,749 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:40:31,753 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:40:31,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:40:29" (1/3) ... [2025-03-16 19:40:31,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d9966eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:40:31, skipping insertion in model container [2025-03-16 19:40:31,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:40:30" (2/3) ... [2025-03-16 19:40:31,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d9966eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:40:31, skipping insertion in model container [2025-03-16 19:40:31,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:40:31" (3/3) ... [2025-03-16 19:40:31,756 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-16 19:40:31,768 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:40:31,771 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 349 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:40:31,830 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:40:31,839 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;@5fb4cf35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:40:31,839 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:40:31,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 349 states, 347 states have (on average 1.7896253602305476) internal successors, (621), 348 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:31,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-16 19:40:31,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:40:31,857 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] [2025-03-16 19:40:31,858 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:40:31,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:40:31,862 INFO L85 PathProgramCache]: Analyzing trace with hash -732847651, now seen corresponding path program 1 times [2025-03-16 19:40:31,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:40:31,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761274012] [2025-03-16 19:40:31,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:40:31,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:40:31,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-16 19:40:32,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-16 19:40:32,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:40:32,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:40:32,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:40:32,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:40:32,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761274012] [2025-03-16 19:40:32,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761274012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:40:32,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:40:32,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:40:32,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570459357] [2025-03-16 19:40:32,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:40:32,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:40:32,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:40:32,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:40:32,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:40:32,456 INFO L87 Difference]: Start difference. First operand has 349 states, 347 states have (on average 1.7896253602305476) internal successors, (621), 348 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:32,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:40:32,556 INFO L93 Difference]: Finished difference Result 651 states and 1123 transitions. [2025-03-16 19:40:32,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:40:32,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2025-03-16 19:40:32,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:40:32,568 INFO L225 Difference]: With dead ends: 651 [2025-03-16 19:40:32,569 INFO L226 Difference]: Without dead ends: 488 [2025-03-16 19:40:32,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:40:32,575 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 266 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:40:32,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 1145 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:40:32,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-03-16 19:40:32,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 485. [2025-03-16 19:40:32,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 1.6528925619834711) internal successors, (800), 484 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:32,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 800 transitions. [2025-03-16 19:40:32,618 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 800 transitions. Word has length 117 [2025-03-16 19:40:32,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:40:32,619 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 800 transitions. [2025-03-16 19:40:32,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:32,619 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 800 transitions. [2025-03-16 19:40:32,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-16 19:40:32,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:40:32,621 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] [2025-03-16 19:40:32,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:40:32,622 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:40:32,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:40:32,622 INFO L85 PathProgramCache]: Analyzing trace with hash -542678618, now seen corresponding path program 1 times [2025-03-16 19:40:32,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:40:32,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200766235] [2025-03-16 19:40:32,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:40:32,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:40:32,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-16 19:40:32,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-16 19:40:32,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:40:32,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:40:32,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:40:32,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:40:32,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200766235] [2025-03-16 19:40:32,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200766235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:40:32,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:40:32,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:40:32,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056877440] [2025-03-16 19:40:32,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:40:32,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:40:32,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:40:32,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:40:32,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:40:32,830 INFO L87 Difference]: Start difference. First operand 485 states and 800 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:32,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:40:32,870 INFO L93 Difference]: Finished difference Result 1051 states and 1740 transitions. [2025-03-16 19:40:32,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:40:32,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2025-03-16 19:40:32,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:40:32,877 INFO L225 Difference]: With dead ends: 1051 [2025-03-16 19:40:32,877 INFO L226 Difference]: Without dead ends: 758 [2025-03-16 19:40:32,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:40:32,881 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 229 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:40:32,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1095 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:40:32,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2025-03-16 19:40:32,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 754. [2025-03-16 19:40:32,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.653386454183267) internal successors, (1245), 753 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:32,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1245 transitions. [2025-03-16 19:40:32,912 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1245 transitions. Word has length 120 [2025-03-16 19:40:32,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:40:32,913 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1245 transitions. [2025-03-16 19:40:32,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:32,914 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1245 transitions. [2025-03-16 19:40:32,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-16 19:40:32,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:40:32,915 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] [2025-03-16 19:40:32,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:40:32,915 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:40:32,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:40:32,916 INFO L85 PathProgramCache]: Analyzing trace with hash 754764722, now seen corresponding path program 1 times [2025-03-16 19:40:32,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:40:32,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434600816] [2025-03-16 19:40:32,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:40:32,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:40:32,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 19:40:32,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 19:40:32,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:40:32,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:40:33,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:40:33,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:40:33,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434600816] [2025-03-16 19:40:33,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434600816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:40:33,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:40:33,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:40:33,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074320034] [2025-03-16 19:40:33,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:40:33,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:40:33,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:40:33,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:40:33,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:40:33,116 INFO L87 Difference]: Start difference. First operand 754 states and 1245 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:33,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:40:33,155 INFO L93 Difference]: Finished difference Result 1838 states and 3039 transitions. [2025-03-16 19:40:33,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:40:33,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-03-16 19:40:33,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:40:33,161 INFO L225 Difference]: With dead ends: 1838 [2025-03-16 19:40:33,161 INFO L226 Difference]: Without dead ends: 1276 [2025-03-16 19:40:33,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:40:33,165 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 222 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:40:33,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 1096 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:40:33,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2025-03-16 19:40:33,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1270. [2025-03-16 19:40:33,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 1269 states have (on average 1.649330181245075) internal successors, (2093), 1269 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:33,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 2093 transitions. [2025-03-16 19:40:33,196 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 2093 transitions. Word has length 123 [2025-03-16 19:40:33,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:40:33,197 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 2093 transitions. [2025-03-16 19:40:33,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:33,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 2093 transitions. [2025-03-16 19:40:33,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 19:40:33,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:40:33,200 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] [2025-03-16 19:40:33,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:40:33,200 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:40:33,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:40:33,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1097710821, now seen corresponding path program 1 times [2025-03-16 19:40:33,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:40:33,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726135787] [2025-03-16 19:40:33,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:40:33,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:40:33,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 19:40:33,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 19:40:33,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:40:33,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:40:33,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:40:33,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:40:33,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726135787] [2025-03-16 19:40:33,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726135787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:40:33,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:40:33,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:40:33,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518162261] [2025-03-16 19:40:33,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:40:33,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:40:33,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:40:33,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:40:33,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:40:33,404 INFO L87 Difference]: Start difference. First operand 1270 states and 2093 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:33,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:40:33,446 INFO L93 Difference]: Finished difference Result 3346 states and 5511 transitions. [2025-03-16 19:40:33,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:40:33,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2025-03-16 19:40:33,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:40:33,455 INFO L225 Difference]: With dead ends: 3346 [2025-03-16 19:40:33,455 INFO L226 Difference]: Without dead ends: 2268 [2025-03-16 19:40:33,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:40:33,458 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 215 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:40:33,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1097 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:40:33,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2025-03-16 19:40:33,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 2258. [2025-03-16 19:40:33,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2258 states, 2257 states have (on average 1.6415595923792645) internal successors, (3705), 2257 states have internal predecessors, (3705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:33,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 3705 transitions. [2025-03-16 19:40:33,504 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 3705 transitions. Word has length 126 [2025-03-16 19:40:33,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:40:33,505 INFO L471 AbstractCegarLoop]: Abstraction has 2258 states and 3705 transitions. [2025-03-16 19:40:33,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:33,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 3705 transitions. [2025-03-16 19:40:33,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-16 19:40:33,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:40:33,508 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] [2025-03-16 19:40:33,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:40:33,508 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:40:33,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:40:33,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1051093369, now seen corresponding path program 1 times [2025-03-16 19:40:33,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:40:33,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081498852] [2025-03-16 19:40:33,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:40:33,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:40:33,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 19:40:33,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 19:40:33,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:40:33,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:40:33,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:40:33,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:40:33,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081498852] [2025-03-16 19:40:33,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081498852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:40:33,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:40:33,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:40:33,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028384606] [2025-03-16 19:40:33,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:40:33,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:40:33,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:40:33,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:40:33,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:40:33,730 INFO L87 Difference]: Start difference. First operand 2258 states and 3705 transitions. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:34,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:40:34,062 INFO L93 Difference]: Finished difference Result 11838 states and 19569 transitions. [2025-03-16 19:40:34,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:40:34,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2025-03-16 19:40:34,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:40:34,091 INFO L225 Difference]: With dead ends: 11838 [2025-03-16 19:40:34,092 INFO L226 Difference]: Without dead ends: 9772 [2025-03-16 19:40:34,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:40:34,096 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 2227 mSDsluCounter, 4864 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2227 SdHoareTripleChecker+Valid, 5441 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:40:34,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2227 Valid, 5441 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:40:34,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9772 states. [2025-03-16 19:40:34,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9772 to 4188. [2025-03-16 19:40:34,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4188 states, 4187 states have (on average 1.6412705994745642) internal successors, (6872), 4187 states have internal predecessors, (6872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:34,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4188 states to 4188 states and 6872 transitions. [2025-03-16 19:40:34,218 INFO L78 Accepts]: Start accepts. Automaton has 4188 states and 6872 transitions. Word has length 129 [2025-03-16 19:40:34,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:40:34,218 INFO L471 AbstractCegarLoop]: Abstraction has 4188 states and 6872 transitions. [2025-03-16 19:40:34,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:34,218 INFO L276 IsEmpty]: Start isEmpty. Operand 4188 states and 6872 transitions. [2025-03-16 19:40:34,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-16 19:40:34,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:40:34,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:40:34,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:40:34,222 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:40:34,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:40:34,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1777812129, now seen corresponding path program 1 times [2025-03-16 19:40:34,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:40:34,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411932906] [2025-03-16 19:40:34,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:40:34,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:40:34,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-16 19:40:34,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-16 19:40:34,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:40:34,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:40:34,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:40:34,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:40:34,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411932906] [2025-03-16 19:40:34,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411932906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:40:34,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:40:34,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:40:34,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803504312] [2025-03-16 19:40:34,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:40:34,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:40:34,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:40:34,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:40:34,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:40:34,390 INFO L87 Difference]: Start difference. First operand 4188 states and 6872 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:34,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:40:34,496 INFO L93 Difference]: Finished difference Result 12286 states and 20260 transitions. [2025-03-16 19:40:34,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:40:34,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2025-03-16 19:40:34,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:40:34,532 INFO L225 Difference]: With dead ends: 12286 [2025-03-16 19:40:34,533 INFO L226 Difference]: Without dead ends: 8290 [2025-03-16 19:40:34,543 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-16 19:40:34,544 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 752 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:40:34,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1903 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:40:34,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8290 states. [2025-03-16 19:40:34,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8290 to 6222. [2025-03-16 19:40:34,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6222 states, 6221 states have (on average 1.6436264266195146) internal successors, (10225), 6221 states have internal predecessors, (10225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:34,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 10225 transitions. [2025-03-16 19:40:34,688 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 10225 transitions. Word has length 130 [2025-03-16 19:40:34,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:40:34,689 INFO L471 AbstractCegarLoop]: Abstraction has 6222 states and 10225 transitions. [2025-03-16 19:40:34,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:34,689 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 10225 transitions. [2025-03-16 19:40:34,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-16 19:40:34,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:40:34,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:40:34,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:40:34,716 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:40:34,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:40:34,717 INFO L85 PathProgramCache]: Analyzing trace with hash -720520022, now seen corresponding path program 1 times [2025-03-16 19:40:34,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:40:34,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921431638] [2025-03-16 19:40:34,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:40:34,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:40:34,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-16 19:40:34,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-16 19:40:34,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:40:34,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:40:34,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:40:34,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:40:34,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921431638] [2025-03-16 19:40:34,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921431638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:40:34,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:40:34,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:40:34,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207600055] [2025-03-16 19:40:34,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:40:34,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:40:34,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:40:34,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:40:34,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:40:34,883 INFO L87 Difference]: Start difference. First operand 6222 states and 10225 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:35,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:40:35,020 INFO L93 Difference]: Finished difference Result 18284 states and 30120 transitions. [2025-03-16 19:40:35,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:40:35,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-03-16 19:40:35,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:40:35,049 INFO L225 Difference]: With dead ends: 18284 [2025-03-16 19:40:35,049 INFO L226 Difference]: Without dead ends: 12254 [2025-03-16 19:40:35,060 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-16 19:40:35,061 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 752 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1893 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:40:35,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1893 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:40:35,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12254 states. [2025-03-16 19:40:35,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12254 to 9214. [2025-03-16 19:40:35,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9214 states, 9213 states have (on average 1.6419190274611961) internal successors, (15127), 9213 states have internal predecessors, (15127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:35,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9214 states to 9214 states and 15127 transitions. [2025-03-16 19:40:35,308 INFO L78 Accepts]: Start accepts. Automaton has 9214 states and 15127 transitions. Word has length 131 [2025-03-16 19:40:35,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:40:35,308 INFO L471 AbstractCegarLoop]: Abstraction has 9214 states and 15127 transitions. [2025-03-16 19:40:35,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:35,309 INFO L276 IsEmpty]: Start isEmpty. Operand 9214 states and 15127 transitions. [2025-03-16 19:40:35,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 19:40:35,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:40:35,312 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:40:35,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:40:35,313 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:40:35,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:40:35,313 INFO L85 PathProgramCache]: Analyzing trace with hash -859494748, now seen corresponding path program 1 times [2025-03-16 19:40:35,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:40:35,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174166172] [2025-03-16 19:40:35,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:40:35,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:40:35,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 19:40:35,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 19:40:35,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:40:35,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:40:35,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:40:35,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:40:35,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174166172] [2025-03-16 19:40:35,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174166172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:40:35,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:40:35,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:40:35,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907560734] [2025-03-16 19:40:35,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:40:35,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:40:35,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:40:35,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:40:35,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:40:35,455 INFO L87 Difference]: Start difference. First operand 9214 states and 15127 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:35,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:40:35,663 INFO L93 Difference]: Finished difference Result 27108 states and 44608 transitions. [2025-03-16 19:40:35,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:40:35,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2025-03-16 19:40:35,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:40:35,703 INFO L225 Difference]: With dead ends: 27108 [2025-03-16 19:40:35,703 INFO L226 Difference]: Without dead ends: 18086 [2025-03-16 19:40:35,716 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-16 19:40:35,716 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 750 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:40:35,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 1823 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:40:35,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18086 states. [2025-03-16 19:40:35,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18086 to 13616. [2025-03-16 19:40:35,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13616 states, 13615 states have (on average 1.6401762761659935) internal successors, (22331), 13615 states have internal predecessors, (22331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:36,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13616 states to 13616 states and 22331 transitions. [2025-03-16 19:40:36,096 INFO L78 Accepts]: Start accepts. Automaton has 13616 states and 22331 transitions. Word has length 132 [2025-03-16 19:40:36,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:40:36,096 INFO L471 AbstractCegarLoop]: Abstraction has 13616 states and 22331 transitions. [2025-03-16 19:40:36,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:36,096 INFO L276 IsEmpty]: Start isEmpty. Operand 13616 states and 22331 transitions. [2025-03-16 19:40:36,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 19:40:36,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:40:36,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:40:36,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:40:36,101 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:40:36,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:40:36,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1147374808, now seen corresponding path program 1 times [2025-03-16 19:40:36,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:40:36,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908086244] [2025-03-16 19:40:36,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:40:36,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:40:36,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 19:40:36,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 19:40:36,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:40:36,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:40:36,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:40:36,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:40:36,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908086244] [2025-03-16 19:40:36,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908086244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:40:36,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:40:36,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:40:36,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979622443] [2025-03-16 19:40:36,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:40:36,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:40:36,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:40:36,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:40:36,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:40:36,207 INFO L87 Difference]: Start difference. First operand 13616 states and 22331 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:36,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:40:36,297 INFO L93 Difference]: Finished difference Result 30327 states and 49937 transitions. [2025-03-16 19:40:36,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:40:36,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-03-16 19:40:36,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:40:36,407 INFO L225 Difference]: With dead ends: 30327 [2025-03-16 19:40:36,408 INFO L226 Difference]: Without dead ends: 20900 [2025-03-16 19:40:36,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:40:36,418 INFO L435 NwaCegarLoop]: 763 mSDtfsCounter, 235 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:40:36,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1288 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:40:36,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20900 states. [2025-03-16 19:40:36,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20900 to 20898. [2025-03-16 19:40:36,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20898 states, 20897 states have (on average 1.6395176341101594) internal successors, (34261), 20897 states have internal predecessors, (34261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:36,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20898 states to 20898 states and 34261 transitions. [2025-03-16 19:40:36,738 INFO L78 Accepts]: Start accepts. Automaton has 20898 states and 34261 transitions. Word has length 133 [2025-03-16 19:40:36,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:40:36,739 INFO L471 AbstractCegarLoop]: Abstraction has 20898 states and 34261 transitions. [2025-03-16 19:40:36,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:36,739 INFO L276 IsEmpty]: Start isEmpty. Operand 20898 states and 34261 transitions. [2025-03-16 19:40:36,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 19:40:36,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:40:36,742 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:40:36,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:40:36,742 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:40:36,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:40:36,743 INFO L85 PathProgramCache]: Analyzing trace with hash 918692934, now seen corresponding path program 1 times [2025-03-16 19:40:36,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:40:36,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60212918] [2025-03-16 19:40:36,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:40:36,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:40:36,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 19:40:36,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 19:40:36,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:40:36,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:40:36,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:40:36,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:40:36,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60212918] [2025-03-16 19:40:36,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60212918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:40:36,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:40:36,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:40:36,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356084724] [2025-03-16 19:40:36,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:40:36,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:40:36,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:40:36,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:40:36,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:40:36,858 INFO L87 Difference]: Start difference. First operand 20898 states and 34261 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:37,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:40:37,128 INFO L93 Difference]: Finished difference Result 46163 states and 75761 transitions. [2025-03-16 19:40:37,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:40:37,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-03-16 19:40:37,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:40:37,180 INFO L225 Difference]: With dead ends: 46163 [2025-03-16 19:40:37,180 INFO L226 Difference]: Without dead ends: 31744 [2025-03-16 19:40:37,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:40:37,193 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 228 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:40:37,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1263 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:40:37,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31744 states. [2025-03-16 19:40:37,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31744 to 31742. [2025-03-16 19:40:37,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31742 states, 31741 states have (on average 1.6347311048801234) internal successors, (51888), 31741 states have internal predecessors, (51888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31742 states to 31742 states and 51888 transitions. [2025-03-16 19:40:37,711 INFO L78 Accepts]: Start accepts. Automaton has 31742 states and 51888 transitions. Word has length 133 [2025-03-16 19:40:37,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:40:37,711 INFO L471 AbstractCegarLoop]: Abstraction has 31742 states and 51888 transitions. [2025-03-16 19:40:37,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:37,711 INFO L276 IsEmpty]: Start isEmpty. Operand 31742 states and 51888 transitions. [2025-03-16 19:40:37,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 19:40:37,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:40:37,712 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:40:37,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:40:37,713 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:40:37,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:40:37,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1467561606, now seen corresponding path program 1 times [2025-03-16 19:40:37,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:40:37,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716816629] [2025-03-16 19:40:37,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:40:37,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:40:37,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 19:40:37,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 19:40:37,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:40:37,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:40:37,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:40:37,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:40:37,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716816629] [2025-03-16 19:40:37,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716816629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:40:37,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:40:37,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:40:37,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466829555] [2025-03-16 19:40:37,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:40:37,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:40:37,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:40:37,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:40:37,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:40:37,814 INFO L87 Difference]: Start difference. First operand 31742 states and 51888 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:37,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:40:37,972 INFO L93 Difference]: Finished difference Result 62054 states and 101575 transitions. [2025-03-16 19:40:37,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:40:37,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-03-16 19:40:37,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:40:38,132 INFO L225 Difference]: With dead ends: 62054 [2025-03-16 19:40:38,133 INFO L226 Difference]: Without dead ends: 44528 [2025-03-16 19:40:38,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:40:38,151 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 214 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:40:38,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1177 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:40:38,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44528 states. [2025-03-16 19:40:38,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44528 to 44526. [2025-03-16 19:40:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44526 states, 44525 states have (on average 1.6299831555306008) internal successors, (72575), 44525 states have internal predecessors, (72575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:38,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44526 states to 44526 states and 72575 transitions. [2025-03-16 19:40:38,727 INFO L78 Accepts]: Start accepts. Automaton has 44526 states and 72575 transitions. Word has length 133 [2025-03-16 19:40:38,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:40:38,728 INFO L471 AbstractCegarLoop]: Abstraction has 44526 states and 72575 transitions. [2025-03-16 19:40:38,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:38,728 INFO L276 IsEmpty]: Start isEmpty. Operand 44526 states and 72575 transitions. [2025-03-16 19:40:38,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 19:40:38,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:40:38,729 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:40:38,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:40:38,730 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:40:38,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:40:38,731 INFO L85 PathProgramCache]: Analyzing trace with hash -872833331, now seen corresponding path program 1 times [2025-03-16 19:40:38,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:40:38,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921851971] [2025-03-16 19:40:38,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:40:38,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:40:38,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 19:40:38,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 19:40:38,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:40:38,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:40:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:40:38,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:40:38,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921851971] [2025-03-16 19:40:38,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921851971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:40:38,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:40:38,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:40:38,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647779439] [2025-03-16 19:40:38,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:40:38,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:40:38,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:40:38,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:40:38,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:40:38,892 INFO L87 Difference]: Start difference. First operand 44526 states and 72575 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:39,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:40:39,241 INFO L93 Difference]: Finished difference Result 142152 states and 232071 transitions. [2025-03-16 19:40:39,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:40:39,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-03-16 19:40:39,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:40:39,408 INFO L225 Difference]: With dead ends: 142152 [2025-03-16 19:40:39,409 INFO L226 Difference]: Without dead ends: 97906 [2025-03-16 19:40:39,465 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-16 19:40:39,466 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 748 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:40:39,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 1897 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:40:39,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97906 states. [2025-03-16 19:40:40,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97906 to 71082. [2025-03-16 19:40:40,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71082 states, 71081 states have (on average 1.626271436811525) internal successors, (115597), 71081 states have internal predecessors, (115597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:40,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71082 states to 71082 states and 115597 transitions. [2025-03-16 19:40:40,633 INFO L78 Accepts]: Start accepts. Automaton has 71082 states and 115597 transitions. Word has length 133 [2025-03-16 19:40:40,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:40:40,633 INFO L471 AbstractCegarLoop]: Abstraction has 71082 states and 115597 transitions. [2025-03-16 19:40:40,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:40,634 INFO L276 IsEmpty]: Start isEmpty. Operand 71082 states and 115597 transitions. [2025-03-16 19:40:40,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 19:40:40,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:40:40,635 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:40:40,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:40:40,635 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:40:40,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:40:40,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2088261864, now seen corresponding path program 1 times [2025-03-16 19:40:40,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:40:40,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434964123] [2025-03-16 19:40:40,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:40:40,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:40:40,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 19:40:40,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 19:40:40,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:40:40,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:40:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:40:40,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:40:40,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434964123] [2025-03-16 19:40:40,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434964123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:40:40,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:40:40,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:40:40,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246908392] [2025-03-16 19:40:40,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:40:40,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:40:40,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:40:40,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:40:40,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:40:40,874 INFO L87 Difference]: Start difference. First operand 71082 states and 115597 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:41,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:40:41,379 INFO L93 Difference]: Finished difference Result 155603 states and 253241 transitions. [2025-03-16 19:40:41,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:40:41,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-03-16 19:40:41,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:40:41,641 INFO L225 Difference]: With dead ends: 155603 [2025-03-16 19:40:41,641 INFO L226 Difference]: Without dead ends: 105866 [2025-03-16 19:40:41,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:40:41,720 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 221 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:40:41,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1230 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:40:41,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105866 states. [2025-03-16 19:40:43,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105866 to 105864. [2025-03-16 19:40:43,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105864 states, 105863 states have (on average 1.618771431000444) internal successors, (171368), 105863 states have internal predecessors, (171368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:43,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105864 states to 105864 states and 171368 transitions. [2025-03-16 19:40:43,361 INFO L78 Accepts]: Start accepts. Automaton has 105864 states and 171368 transitions. Word has length 133 [2025-03-16 19:40:43,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:40:43,361 INFO L471 AbstractCegarLoop]: Abstraction has 105864 states and 171368 transitions. [2025-03-16 19:40:43,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:43,362 INFO L276 IsEmpty]: Start isEmpty. Operand 105864 states and 171368 transitions. [2025-03-16 19:40:43,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-16 19:40:43,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:40:43,363 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:40:43,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:40:43,363 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:40:43,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:40:43,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1222725297, now seen corresponding path program 1 times [2025-03-16 19:40:43,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:40:43,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616606546] [2025-03-16 19:40:43,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:40:43,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:40:43,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-16 19:40:43,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-16 19:40:43,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:40:43,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:40:43,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:40:43,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:40:43,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616606546] [2025-03-16 19:40:43,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616606546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:40:43,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:40:43,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:40:43,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234189250] [2025-03-16 19:40:43,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:40:43,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:40:43,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:40:43,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:40:43,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:40:43,693 INFO L87 Difference]: Start difference. First operand 105864 states and 171368 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:44,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:40:44,830 INFO L93 Difference]: Finished difference Result 211470 states and 342321 transitions. [2025-03-16 19:40:44,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:40:44,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2025-03-16 19:40:44,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:40:44,979 INFO L225 Difference]: With dead ends: 211470 [2025-03-16 19:40:44,979 INFO L226 Difference]: Without dead ends: 105866 [2025-03-16 19:40:45,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:40:45,007 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 871 mSDsluCounter, 1605 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 2173 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:40:45,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 2173 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:40:45,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105866 states. [2025-03-16 19:40:45,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105866 to 105864. [2025-03-16 19:40:46,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105864 states, 105863 states have (on average 1.612867574128827) internal successors, (170743), 105863 states have internal predecessors, (170743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:46,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105864 states to 105864 states and 170743 transitions. [2025-03-16 19:40:46,249 INFO L78 Accepts]: Start accepts. Automaton has 105864 states and 170743 transitions. Word has length 135 [2025-03-16 19:40:46,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:40:46,249 INFO L471 AbstractCegarLoop]: Abstraction has 105864 states and 170743 transitions. [2025-03-16 19:40:46,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:46,249 INFO L276 IsEmpty]: Start isEmpty. Operand 105864 states and 170743 transitions. [2025-03-16 19:40:46,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-16 19:40:46,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:40:46,250 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] [2025-03-16 19:40:46,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:40:46,250 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:40:46,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:40:46,251 INFO L85 PathProgramCache]: Analyzing trace with hash 795844110, now seen corresponding path program 1 times [2025-03-16 19:40:46,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:40:46,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521133395] [2025-03-16 19:40:46,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:40:46,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:40:46,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 19:40:46,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 19:40:46,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:40:46,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:40:46,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:40:46,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:40:46,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521133395] [2025-03-16 19:40:46,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521133395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:40:46,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:40:46,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:40:46,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252086581] [2025-03-16 19:40:46,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:40:46,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:40:46,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:40:46,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:40:46,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:40:46,704 INFO L87 Difference]: Start difference. First operand 105864 states and 170743 transitions. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:47,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:40:47,631 INFO L93 Difference]: Finished difference Result 309468 states and 499581 transitions. [2025-03-16 19:40:47,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:40:47,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-03-16 19:40:47,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:40:47,975 INFO L225 Difference]: With dead ends: 309468 [2025-03-16 19:40:47,975 INFO L226 Difference]: Without dead ends: 203864 [2025-03-16 19:40:48,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:40:48,065 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 433 mSDsluCounter, 1623 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:40:48,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 2182 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:40:48,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203864 states. [2025-03-16 19:40:50,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203864 to 203862. [2025-03-16 19:40:50,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203862 states, 203861 states have (on average 1.6051917728256018) internal successors, (327236), 203861 states have internal predecessors, (327236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:50,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203862 states to 203862 states and 327236 transitions. [2025-03-16 19:40:50,779 INFO L78 Accepts]: Start accepts. Automaton has 203862 states and 327236 transitions. Word has length 138 [2025-03-16 19:40:50,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:40:50,780 INFO L471 AbstractCegarLoop]: Abstraction has 203862 states and 327236 transitions. [2025-03-16 19:40:50,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:50,780 INFO L276 IsEmpty]: Start isEmpty. Operand 203862 states and 327236 transitions. [2025-03-16 19:40:50,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-16 19:40:50,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:40:50,781 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:40:50,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:40:50,781 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:40:50,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:40:50,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1097681060, now seen corresponding path program 1 times [2025-03-16 19:40:50,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:40:50,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968599776] [2025-03-16 19:40:50,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:40:50,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:40:50,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-16 19:40:50,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-16 19:40:50,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:40:50,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:40:51,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:40:51,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:40:51,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968599776] [2025-03-16 19:40:51,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968599776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:40:51,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:40:51,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:40:51,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778867454] [2025-03-16 19:40:51,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:40:51,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:40:51,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:40:51,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:40:51,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:40:51,455 INFO L87 Difference]: Start difference. First operand 203862 states and 327236 transitions. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:52,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:40:52,175 INFO L93 Difference]: Finished difference Result 207736 states and 333045 transitions. [2025-03-16 19:40:52,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:40:52,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2025-03-16 19:40:52,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:40:52,513 INFO L225 Difference]: With dead ends: 207736 [2025-03-16 19:40:52,513 INFO L226 Difference]: Without dead ends: 207734 [2025-03-16 19:40:52,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:40:52,568 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 0 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2255 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:40:52,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2255 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:40:52,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207734 states. [2025-03-16 19:40:54,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207734 to 207734. [2025-03-16 19:40:54,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207734 states, 207733 states have (on average 1.5937814405992308) internal successors, (331081), 207733 states have internal predecessors, (331081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:55,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207734 states to 207734 states and 331081 transitions. [2025-03-16 19:40:55,383 INFO L78 Accepts]: Start accepts. Automaton has 207734 states and 331081 transitions. Word has length 139 [2025-03-16 19:40:55,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:40:55,384 INFO L471 AbstractCegarLoop]: Abstraction has 207734 states and 331081 transitions. [2025-03-16 19:40:55,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:55,384 INFO L276 IsEmpty]: Start isEmpty. Operand 207734 states and 331081 transitions. [2025-03-16 19:40:55,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-16 19:40:55,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:40:55,390 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:40:55,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:40:55,395 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:40:55,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:40:55,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1361630219, now seen corresponding path program 1 times [2025-03-16 19:40:55,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:40:55,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251904122] [2025-03-16 19:40:55,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:40:55,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:40:55,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-16 19:40:55,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-16 19:40:55,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:40:55,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:40:55,608 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:40:55,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:40:55,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251904122] [2025-03-16 19:40:55,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251904122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:40:55,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:40:55,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:40:55,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330493532] [2025-03-16 19:40:55,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:40:55,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:40:55,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:40:55,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:40:55,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:40:55,610 INFO L87 Difference]: Start difference. First operand 207734 states and 331081 transitions. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:57,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:40:57,621 INFO L93 Difference]: Finished difference Result 566806 states and 905942 transitions. [2025-03-16 19:40:57,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:40:57,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 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 175 [2025-03-16 19:40:57,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:40:58,613 INFO L225 Difference]: With dead ends: 566806 [2025-03-16 19:40:58,613 INFO L226 Difference]: Without dead ends: 474404 [2025-03-16 19:40:58,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:40:58,778 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 1691 mSDsluCounter, 2388 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1691 SdHoareTripleChecker+Valid, 3203 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:40:58,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1691 Valid, 3203 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:40:59,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474404 states. [2025-03-16 19:41:02,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474404 to 334000. [2025-03-16 19:41:03,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334000 states, 333999 states have (on average 1.5922293180518505) internal successors, (531803), 333999 states have internal predecessors, (531803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:41:04,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334000 states to 334000 states and 531803 transitions. [2025-03-16 19:41:04,407 INFO L78 Accepts]: Start accepts. Automaton has 334000 states and 531803 transitions. Word has length 175 [2025-03-16 19:41:04,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:41:04,408 INFO L471 AbstractCegarLoop]: Abstraction has 334000 states and 531803 transitions. [2025-03-16 19:41:04,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:41:04,408 INFO L276 IsEmpty]: Start isEmpty. Operand 334000 states and 531803 transitions. [2025-03-16 19:41:04,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-16 19:41:04,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:41:04,412 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:41:04,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:41:04,412 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:41:04,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:41:04,412 INFO L85 PathProgramCache]: Analyzing trace with hash -867269335, now seen corresponding path program 1 times [2025-03-16 19:41:04,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:41:04,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106367944] [2025-03-16 19:41:04,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:41:04,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:41:04,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-16 19:41:04,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-16 19:41:04,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:41:04,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:41:04,666 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 19:41:04,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:41:04,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106367944] [2025-03-16 19:41:04,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106367944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:41:04,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:41:04,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:41:04,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172024964] [2025-03-16 19:41:04,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:41:04,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:41:04,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:41:04,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:41:04,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:41:04,669 INFO L87 Difference]: Start difference. First operand 334000 states and 531803 transitions. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 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-16 19:41:07,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:41:07,436 INFO L93 Difference]: Finished difference Result 637752 states and 1019458 transitions. [2025-03-16 19:41:07,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:41:07,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 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 175 [2025-03-16 19:41:07,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:41:08,492 INFO L225 Difference]: With dead ends: 637752 [2025-03-16 19:41:08,492 INFO L226 Difference]: Without dead ends: 546500 [2025-03-16 19:41:08,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:41:08,645 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 1680 mSDsluCounter, 2607 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1680 SdHoareTripleChecker+Valid, 3426 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:41:08,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1680 Valid, 3426 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:41:09,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546500 states. [2025-03-16 19:41:13,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546500 to 451560.