./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 92f84e18d7f713cb4a67277cb892c6222831b93652f8c37aad43582713426f96 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:11:04,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:11:04,400 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:11:04,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:11:04,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:11:04,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:11:04,434 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:11:04,434 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:11:04,434 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:11:04,435 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:11:04,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:11:04,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:11:04,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:11:04,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:11:04,436 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:11:04,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:11:04,436 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:11:04,437 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:11:04,437 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:11:04,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:11:04,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:11:04,437 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:11:04,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:11:04,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:11:04,437 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:11:04,437 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:11:04,437 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:11:04,438 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:11:04,438 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:11:04,438 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:11:04,438 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:11:04,438 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:11:04,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:11:04,439 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:11:04,439 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:11:04,439 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:11:04,439 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:11:04,439 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:11:04,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:11:04,439 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:11:04,439 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:11:04,439 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:11:04,439 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:11:04,439 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 -> 92f84e18d7f713cb4a67277cb892c6222831b93652f8c37aad43582713426f96 [2025-03-03 15:11:04,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:11:04,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:11:04,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:11:04,695 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:11:04,695 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:11:04,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2025-03-03 15:11:05,798 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce97ca55e/504e936497bc4c3f9500f6a0692712ec/FLAG574e0c8ef [2025-03-03 15:11:06,119 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:11:06,120 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2025-03-03 15:11:06,134 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce97ca55e/504e936497bc4c3f9500f6a0692712ec/FLAG574e0c8ef [2025-03-03 15:11:06,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce97ca55e/504e936497bc4c3f9500f6a0692712ec [2025-03-03 15:11:06,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:11:06,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:11:06,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:11:06,373 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:11:06,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:11:06,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:11:06" (1/1) ... [2025-03-03 15:11:06,377 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@368dfe1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:06, skipping insertion in model container [2025-03-03 15:11:06,377 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:11:06" (1/1) ... [2025-03-03 15:11:06,403 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:11:06,544 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[7545,7558] [2025-03-03 15:11:06,562 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[10452,10465] [2025-03-03 15:11:06,566 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[11543,11556] [2025-03-03 15:11:06,572 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[12149,12162] [2025-03-03 15:11:06,579 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[13568,13581] [2025-03-03 15:11:06,581 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14174,14187] [2025-03-03 15:11:06,584 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15145,15158] [2025-03-03 15:11:06,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:11:06,619 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:11:06,665 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[7545,7558] [2025-03-03 15:11:06,672 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[10452,10465] [2025-03-03 15:11:06,675 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[11543,11556] [2025-03-03 15:11:06,676 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[12149,12162] [2025-03-03 15:11:06,679 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[13568,13581] [2025-03-03 15:11:06,681 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14174,14187] [2025-03-03 15:11:06,683 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15145,15158] [2025-03-03 15:11:06,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:11:06,712 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:11:06,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:06 WrapperNode [2025-03-03 15:11:06,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:11:06,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:11:06,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:11:06,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:11:06,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:06" (1/1) ... [2025-03-03 15:11:06,725 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:06" (1/1) ... [2025-03-03 15:11:06,756 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1106 [2025-03-03 15:11:06,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:11:06,757 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:11:06,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:11:06,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:11:06,763 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:06" (1/1) ... [2025-03-03 15:11:06,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:06" (1/1) ... [2025-03-03 15:11:06,766 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:06" (1/1) ... [2025-03-03 15:11:06,786 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:11:06,786 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:06" (1/1) ... [2025-03-03 15:11:06,786 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:06" (1/1) ... [2025-03-03 15:11:06,806 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:06" (1/1) ... [2025-03-03 15:11:06,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:06" (1/1) ... [2025-03-03 15:11:06,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:06" (1/1) ... [2025-03-03 15:11:06,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:06" (1/1) ... [2025-03-03 15:11:06,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:11:06,816 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:11:06,816 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:11:06,816 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:11:06,817 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:06" (1/1) ... [2025-03-03 15:11:06,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:11:06,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:11:06,851 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:11:06,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:11:06,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:11:06,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:11:06,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:11:06,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:11:06,983 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:11:06,988 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:11:07,785 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L729: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-03 15:11:07,786 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L267: havoc main_~node3__m3~1#1; [2025-03-03 15:11:07,786 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L169: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-03 15:11:07,786 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L236: havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-03 15:11:07,786 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1227: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-03-03 15:11:07,786 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L468: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:11:07,786 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1559: havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2025-03-03 15:11:07,786 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L404: havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-03 15:11:07,786 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L339: havoc main_~node2__m2~2#1; [2025-03-03 15:11:07,787 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L836: havoc main_~node2__m2~3#1; [2025-03-03 15:11:07,787 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L938: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-03-03 15:11:07,787 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L641: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-03 15:11:07,787 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1269: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-03-03 15:11:07,787 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1601: havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~15#1; [2025-03-03 15:11:07,787 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1403: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1; [2025-03-03 15:11:07,787 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1337: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-03-03 15:11:07,787 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L776: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-03 15:11:07,787 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1669: havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~16#1; [2025-03-03 15:11:07,787 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L513: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:11:07,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1043: havoc main_~check__tmp~9#1; [2025-03-03 15:11:07,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L152: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:11:07,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L252: havoc main_~node2__m2~1#1; [2025-03-03 15:11:07,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-03 15:11:07,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1013: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-03 15:11:07,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L981: havoc main_~node3__m3~5#1; [2025-03-03 15:11:07,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L354: havoc main_~node3__m3~2#1; [2025-03-03 15:11:07,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1445: havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~13#1; [2025-03-03 15:11:07,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1181: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-03-03 15:11:07,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L851: havoc main_~node3__m3~4#1; [2025-03-03 15:11:07,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L323: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-03 15:11:07,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1513: havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~14#1; [2025-03-03 15:11:07,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L689: havoc main_~node3__m3~3#1; [2025-03-03 15:11:07,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L559: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:11:07,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1386: havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2025-03-03 15:11:07,789 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L891: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-03 15:11:07,830 INFO L? ?]: Removed 178 outVars from TransFormulas that were not future-live. [2025-03-03 15:11:07,830 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:11:07,839 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:11:07,840 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:11:07,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:11:07 BoogieIcfgContainer [2025-03-03 15:11:07,840 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:11:07,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:11:07,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:11:07,844 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:11:07,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:11:06" (1/3) ... [2025-03-03 15:11:07,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1840f46f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:11:07, skipping insertion in model container [2025-03-03 15:11:07,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:06" (2/3) ... [2025-03-03 15:11:07,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1840f46f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:11:07, skipping insertion in model container [2025-03-03 15:11:07,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:11:07" (3/3) ... [2025-03-03 15:11:07,846 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2025-03-03 15:11:07,854 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:11:07,860 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c that has 1 procedures, 207 locations, 1 initial locations, 0 loop locations, and 7 error locations. [2025-03-03 15:11:07,901 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:11:07,910 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;@2afb7ee6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:11:07,910 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-03 15:11:07,914 INFO L276 IsEmpty]: Start isEmpty. Operand has 207 states, 199 states have (on average 1.8241206030150754) internal successors, (363), 206 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:07,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 15:11:07,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:07,921 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] [2025-03-03 15:11:07,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:07,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:07,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1471971337, now seen corresponding path program 1 times [2025-03-03 15:11:07,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:07,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659027766] [2025-03-03 15:11:07,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:07,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:07,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 15:11:08,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 15:11:08,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:08,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:08,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:08,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:08,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659027766] [2025-03-03 15:11:08,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659027766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:08,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:08,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:11:08,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663375776] [2025-03-03 15:11:08,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:08,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:11:08,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:08,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:11:08,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:11:08,377 INFO L87 Difference]: Start difference. First operand has 207 states, 199 states have (on average 1.8241206030150754) internal successors, (363), 206 states have internal predecessors, (363), 0 states have call successors, (0), 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 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:08,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:08,607 INFO L93 Difference]: Finished difference Result 423 states and 706 transitions. [2025-03-03 15:11:08,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:11:08,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-03 15:11:08,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:08,616 INFO L225 Difference]: With dead ends: 423 [2025-03-03 15:11:08,616 INFO L226 Difference]: Without dead ends: 259 [2025-03-03 15:11:08,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:11:08,623 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 1113 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:08,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 311 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:11:08,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-03 15:11:08,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 235. [2025-03-03 15:11:08,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 228 states have (on average 1.3421052631578947) internal successors, (306), 234 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:08,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 306 transitions. [2025-03-03 15:11:08,653 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 306 transitions. Word has length 47 [2025-03-03 15:11:08,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:08,653 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 306 transitions. [2025-03-03 15:11:08,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:08,654 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 306 transitions. [2025-03-03 15:11:08,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 15:11:08,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:08,655 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:08,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:11:08,655 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:08,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:08,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1803525020, now seen corresponding path program 1 times [2025-03-03 15:11:08,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:08,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520857134] [2025-03-03 15:11:08,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:08,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:08,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 15:11:08,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 15:11:08,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:08,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:08,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:08,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:08,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520857134] [2025-03-03 15:11:08,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520857134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:08,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:08,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:11:08,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073933805] [2025-03-03 15:11:08,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:08,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:11:08,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:08,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:11:08,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:11:08,820 INFO L87 Difference]: Start difference. First operand 235 states and 306 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:08,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:08,942 INFO L93 Difference]: Finished difference Result 418 states and 557 transitions. [2025-03-03 15:11:08,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:11:08,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-03 15:11:08,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:08,944 INFO L225 Difference]: With dead ends: 418 [2025-03-03 15:11:08,944 INFO L226 Difference]: Without dead ends: 222 [2025-03-03 15:11:08,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:11:08,945 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 560 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:08,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 131 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:11:08,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-03 15:11:08,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2025-03-03 15:11:08,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 215 states have (on average 1.344186046511628) internal successors, (289), 221 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:08,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 289 transitions. [2025-03-03 15:11:08,957 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 289 transitions. Word has length 48 [2025-03-03 15:11:08,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:08,957 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 289 transitions. [2025-03-03 15:11:08,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:08,957 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 289 transitions. [2025-03-03 15:11:08,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 15:11:08,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:08,958 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:08,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:11:08,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:08,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:08,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1778591775, now seen corresponding path program 1 times [2025-03-03 15:11:08,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:08,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689717877] [2025-03-03 15:11:08,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:08,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:08,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 15:11:08,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 15:11:08,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:08,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:09,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:09,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:09,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689717877] [2025-03-03 15:11:09,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689717877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:09,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:09,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:11:09,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099958839] [2025-03-03 15:11:09,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:09,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:11:09,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:09,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:11:09,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:11:09,096 INFO L87 Difference]: Start difference. First operand 222 states and 289 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:09,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:09,205 INFO L93 Difference]: Finished difference Result 405 states and 538 transitions. [2025-03-03 15:11:09,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:11:09,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-03 15:11:09,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:09,206 INFO L225 Difference]: With dead ends: 405 [2025-03-03 15:11:09,209 INFO L226 Difference]: Without dead ends: 217 [2025-03-03 15:11:09,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:11:09,211 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 526 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:09,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 128 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:11:09,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-03 15:11:09,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-03-03 15:11:09,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 210 states have (on average 1.338095238095238) internal successors, (281), 216 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:09,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 281 transitions. [2025-03-03 15:11:09,220 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 281 transitions. Word has length 49 [2025-03-03 15:11:09,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:09,221 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 281 transitions. [2025-03-03 15:11:09,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:09,221 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 281 transitions. [2025-03-03 15:11:09,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 15:11:09,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:09,226 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:09,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:11:09,226 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:09,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:09,226 INFO L85 PathProgramCache]: Analyzing trace with hash -380560756, now seen corresponding path program 1 times [2025-03-03 15:11:09,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:09,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674132637] [2025-03-03 15:11:09,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:09,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:09,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 15:11:09,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 15:11:09,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:09,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:09,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:09,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:09,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674132637] [2025-03-03 15:11:09,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674132637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:09,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:09,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:11:09,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251258826] [2025-03-03 15:11:09,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:09,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:11:09,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:09,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:11:09,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:11:09,556 INFO L87 Difference]: Start difference. First operand 217 states and 281 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:09,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:09,955 INFO L93 Difference]: Finished difference Result 449 states and 604 transitions. [2025-03-03 15:11:09,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:11:09,955 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-03 15:11:09,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:09,956 INFO L225 Difference]: With dead ends: 449 [2025-03-03 15:11:09,956 INFO L226 Difference]: Without dead ends: 348 [2025-03-03 15:11:09,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:11:09,957 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 754 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:09,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 703 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:11:09,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-03-03 15:11:09,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 217. [2025-03-03 15:11:09,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 210 states have (on average 1.3333333333333333) internal successors, (280), 216 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:09,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 280 transitions. [2025-03-03 15:11:09,975 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 280 transitions. Word has length 50 [2025-03-03 15:11:09,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:09,976 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 280 transitions. [2025-03-03 15:11:09,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:09,976 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 280 transitions. [2025-03-03 15:11:09,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 15:11:09,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:09,978 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:09,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:11:09,978 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:09,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:09,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1680390286, now seen corresponding path program 1 times [2025-03-03 15:11:09,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:09,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557542830] [2025-03-03 15:11:09,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:09,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:09,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 15:11:10,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 15:11:10,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:10,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:10,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:10,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:10,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557542830] [2025-03-03 15:11:10,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557542830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:10,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:10,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:11:10,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426440434] [2025-03-03 15:11:10,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:10,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:11:10,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:10,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:11:10,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:11:10,265 INFO L87 Difference]: Start difference. First operand 217 states and 280 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:10,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:10,611 INFO L93 Difference]: Finished difference Result 360 states and 471 transitions. [2025-03-03 15:11:10,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:11:10,612 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-03 15:11:10,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:10,613 INFO L225 Difference]: With dead ends: 360 [2025-03-03 15:11:10,613 INFO L226 Difference]: Without dead ends: 355 [2025-03-03 15:11:10,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:11:10,614 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 857 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:10,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 669 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:11:10,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-03 15:11:10,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 217. [2025-03-03 15:11:10,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 210 states have (on average 1.3285714285714285) internal successors, (279), 216 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:10,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 279 transitions. [2025-03-03 15:11:10,620 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 279 transitions. Word has length 50 [2025-03-03 15:11:10,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:10,620 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 279 transitions. [2025-03-03 15:11:10,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:10,620 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 279 transitions. [2025-03-03 15:11:10,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 15:11:10,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:10,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] [2025-03-03 15:11:10,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:11:10,621 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:10,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:10,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1010743158, now seen corresponding path program 1 times [2025-03-03 15:11:10,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:10,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476854213] [2025-03-03 15:11:10,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:10,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:10,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 15:11:10,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 15:11:10,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:10,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:10,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:10,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:10,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476854213] [2025-03-03 15:11:10,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476854213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:10,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:10,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:11:10,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382089698] [2025-03-03 15:11:10,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:10,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:11:10,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:10,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:11:10,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:11:10,824 INFO L87 Difference]: Start difference. First operand 217 states and 279 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:11,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:11,042 INFO L93 Difference]: Finished difference Result 461 states and 610 transitions. [2025-03-03 15:11:11,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:11:11,042 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-03 15:11:11,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:11,043 INFO L225 Difference]: With dead ends: 461 [2025-03-03 15:11:11,043 INFO L226 Difference]: Without dead ends: 337 [2025-03-03 15:11:11,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:11:11,044 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 971 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:11,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 389 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:11:11,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-03 15:11:11,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 217. [2025-03-03 15:11:11,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 210 states have (on average 1.3238095238095238) internal successors, (278), 216 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:11,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 278 transitions. [2025-03-03 15:11:11,050 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 278 transitions. Word has length 50 [2025-03-03 15:11:11,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:11,050 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 278 transitions. [2025-03-03 15:11:11,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:11,051 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 278 transitions. [2025-03-03 15:11:11,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 15:11:11,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:11,051 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:11,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:11:11,051 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:11,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:11,052 INFO L85 PathProgramCache]: Analyzing trace with hash -746342518, now seen corresponding path program 1 times [2025-03-03 15:11:11,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:11,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212707605] [2025-03-03 15:11:11,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:11,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:11,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 15:11:11,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 15:11:11,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:11,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:11,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:11,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:11,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212707605] [2025-03-03 15:11:11,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212707605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:11,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:11,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:11:11,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677493654] [2025-03-03 15:11:11,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:11,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:11:11,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:11,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:11:11,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:11:11,494 INFO L87 Difference]: Start difference. First operand 217 states and 278 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:12,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:12,005 INFO L93 Difference]: Finished difference Result 437 states and 587 transitions. [2025-03-03 15:11:12,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:11:12,006 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-03 15:11:12,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:12,007 INFO L225 Difference]: With dead ends: 437 [2025-03-03 15:11:12,007 INFO L226 Difference]: Without dead ends: 421 [2025-03-03 15:11:12,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:11:12,008 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 725 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:12,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 1678 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:11:12,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-03 15:11:12,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 201. [2025-03-03 15:11:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 196 states have (on average 1.3214285714285714) internal successors, (259), 200 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:12,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 259 transitions. [2025-03-03 15:11:12,017 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 259 transitions. Word has length 52 [2025-03-03 15:11:12,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:12,018 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 259 transitions. [2025-03-03 15:11:12,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:12,018 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 259 transitions. [2025-03-03 15:11:12,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 15:11:12,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:12,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:12,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:11:12,019 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:12,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:12,019 INFO L85 PathProgramCache]: Analyzing trace with hash 631287948, now seen corresponding path program 1 times [2025-03-03 15:11:12,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:12,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4262221] [2025-03-03 15:11:12,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:12,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:12,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 15:11:12,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 15:11:12,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:12,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:12,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:12,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:12,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4262221] [2025-03-03 15:11:12,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4262221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:12,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:12,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:11:12,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605195232] [2025-03-03 15:11:12,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:12,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:11:12,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:12,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:11:12,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:11:12,376 INFO L87 Difference]: Start difference. First operand 201 states and 259 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:12,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:12,661 INFO L93 Difference]: Finished difference Result 383 states and 525 transitions. [2025-03-03 15:11:12,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:11:12,661 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-03 15:11:12,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:12,662 INFO L225 Difference]: With dead ends: 383 [2025-03-03 15:11:12,662 INFO L226 Difference]: Without dead ends: 266 [2025-03-03 15:11:12,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:11:12,663 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 611 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:12,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 528 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:11:12,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-03 15:11:12,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 168. [2025-03-03 15:11:12,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 166 states have (on average 1.3253012048192772) internal successors, (220), 167 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:12,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 220 transitions. [2025-03-03 15:11:12,670 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 220 transitions. Word has length 52 [2025-03-03 15:11:12,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:12,670 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 220 transitions. [2025-03-03 15:11:12,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:12,671 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 220 transitions. [2025-03-03 15:11:12,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 15:11:12,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:12,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:12,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:11:12,672 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:12,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:12,672 INFO L85 PathProgramCache]: Analyzing trace with hash 890010117, now seen corresponding path program 1 times [2025-03-03 15:11:12,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:12,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153516306] [2025-03-03 15:11:12,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:12,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:12,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 15:11:12,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 15:11:12,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:12,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:12,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:12,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153516306] [2025-03-03 15:11:12,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153516306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:12,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:12,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:11:12,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33599491] [2025-03-03 15:11:12,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:12,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:11:12,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:12,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:11:12,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:11:12,818 INFO L87 Difference]: Start difference. First operand 168 states and 220 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:13,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:13,012 INFO L93 Difference]: Finished difference Result 285 states and 384 transitions. [2025-03-03 15:11:13,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:11:13,013 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-03 15:11:13,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:13,013 INFO L225 Difference]: With dead ends: 285 [2025-03-03 15:11:13,013 INFO L226 Difference]: Without dead ends: 171 [2025-03-03 15:11:13,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:11:13,014 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 185 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:13,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 319 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:11:13,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-03 15:11:13,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2025-03-03 15:11:13,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 166 states have (on average 1.3132530120481927) internal successors, (218), 167 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:13,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 218 transitions. [2025-03-03 15:11:13,019 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 218 transitions. Word has length 53 [2025-03-03 15:11:13,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:13,019 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 218 transitions. [2025-03-03 15:11:13,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:13,019 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 218 transitions. [2025-03-03 15:11:13,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 15:11:13,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:13,020 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:13,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:11:13,020 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:13,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:13,022 INFO L85 PathProgramCache]: Analyzing trace with hash 403604581, now seen corresponding path program 1 times [2025-03-03 15:11:13,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:13,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112798160] [2025-03-03 15:11:13,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:13,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:13,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 15:11:13,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 15:11:13,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:13,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:13,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:13,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:13,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112798160] [2025-03-03 15:11:13,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112798160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:13,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:13,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:11:13,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508042910] [2025-03-03 15:11:13,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:13,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:11:13,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:13,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:11:13,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:11:13,426 INFO L87 Difference]: Start difference. First operand 168 states and 218 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:13,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:13,832 INFO L93 Difference]: Finished difference Result 278 states and 376 transitions. [2025-03-03 15:11:13,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:11:13,832 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-03 15:11:13,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:13,833 INFO L225 Difference]: With dead ends: 278 [2025-03-03 15:11:13,834 INFO L226 Difference]: Without dead ends: 272 [2025-03-03 15:11:13,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:11:13,835 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 459 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:13,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 955 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:11:13,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-03 15:11:13,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 162. [2025-03-03 15:11:13,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.31055900621118) internal successors, (211), 161 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:13,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 211 transitions. [2025-03-03 15:11:13,843 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 211 transitions. Word has length 55 [2025-03-03 15:11:13,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:13,844 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 211 transitions. [2025-03-03 15:11:13,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:13,844 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 211 transitions. [2025-03-03 15:11:13,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 15:11:13,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:13,846 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] [2025-03-03 15:11:13,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:11:13,847 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:13,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:13,847 INFO L85 PathProgramCache]: Analyzing trace with hash -222439869, now seen corresponding path program 1 times [2025-03-03 15:11:13,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:13,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206192596] [2025-03-03 15:11:13,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:13,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:13,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 15:11:13,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 15:11:13,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:13,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:13,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:13,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:13,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206192596] [2025-03-03 15:11:13,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206192596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:13,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:13,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:11:13,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603371257] [2025-03-03 15:11:13,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:13,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:11:13,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:13,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:11:13,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:11:13,932 INFO L87 Difference]: Start difference. First operand 162 states and 211 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:13,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:13,998 INFO L93 Difference]: Finished difference Result 666 states and 967 transitions. [2025-03-03 15:11:13,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:11:13,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2025-03-03 15:11:13,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:14,000 INFO L225 Difference]: With dead ends: 666 [2025-03-03 15:11:14,000 INFO L226 Difference]: Without dead ends: 582 [2025-03-03 15:11:14,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:11:14,001 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 486 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:14,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 608 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:14,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-03-03 15:11:14,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 244. [2025-03-03 15:11:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.3662551440329218) internal successors, (332), 243 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 332 transitions. [2025-03-03 15:11:14,008 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 332 transitions. Word has length 73 [2025-03-03 15:11:14,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:14,008 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 332 transitions. [2025-03-03 15:11:14,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:14,010 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 332 transitions. [2025-03-03 15:11:14,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:11:14,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:14,011 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] [2025-03-03 15:11:14,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:11:14,012 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:14,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:14,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1225296391, now seen corresponding path program 1 times [2025-03-03 15:11:14,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:14,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235004176] [2025-03-03 15:11:14,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:14,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:14,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:11:14,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:11:14,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:14,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:14,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:14,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:14,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235004176] [2025-03-03 15:11:14,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235004176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:14,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:14,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:11:14,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338798587] [2025-03-03 15:11:14,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:14,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:11:14,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:14,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:11:14,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:11:14,101 INFO L87 Difference]: Start difference. First operand 244 states and 332 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:14,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:14,146 INFO L93 Difference]: Finished difference Result 826 states and 1195 transitions. [2025-03-03 15:11:14,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:11:14,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-03 15:11:14,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:14,148 INFO L225 Difference]: With dead ends: 826 [2025-03-03 15:11:14,148 INFO L226 Difference]: Without dead ends: 660 [2025-03-03 15:11:14,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:11:14,149 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 284 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:14,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 424 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:14,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-03-03 15:11:14,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 408. [2025-03-03 15:11:14,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 1.4152334152334152) internal successors, (576), 407 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:14,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 576 transitions. [2025-03-03 15:11:14,157 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 576 transitions. Word has length 75 [2025-03-03 15:11:14,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:14,158 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 576 transitions. [2025-03-03 15:11:14,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:14,158 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 576 transitions. [2025-03-03 15:11:14,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:11:14,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:14,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:14,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:11:14,159 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:14,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:14,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1357339335, now seen corresponding path program 1 times [2025-03-03 15:11:14,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:14,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528225860] [2025-03-03 15:11:14,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:14,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:14,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:11:14,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:11:14,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:14,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:14,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:14,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528225860] [2025-03-03 15:11:14,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528225860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:14,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:14,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:11:14,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675734783] [2025-03-03 15:11:14,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:14,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:11:14,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:14,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:11:14,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:11:14,232 INFO L87 Difference]: Start difference. First operand 408 states and 576 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:14,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:14,284 INFO L93 Difference]: Finished difference Result 990 states and 1439 transitions. [2025-03-03 15:11:14,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:11:14,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-03 15:11:14,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:14,287 INFO L225 Difference]: With dead ends: 990 [2025-03-03 15:11:14,287 INFO L226 Difference]: Without dead ends: 824 [2025-03-03 15:11:14,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:11:14,288 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 293 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:14,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 440 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:14,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2025-03-03 15:11:14,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 654. [2025-03-03 15:11:14,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 653 states have (on average 1.44104134762634) internal successors, (941), 653 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:14,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 941 transitions. [2025-03-03 15:11:14,300 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 941 transitions. Word has length 75 [2025-03-03 15:11:14,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:14,300 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 941 transitions. [2025-03-03 15:11:14,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:14,300 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 941 transitions. [2025-03-03 15:11:14,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:11:14,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:14,301 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:14,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:11:14,301 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:14,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:14,302 INFO L85 PathProgramCache]: Analyzing trace with hash -2106947750, now seen corresponding path program 1 times [2025-03-03 15:11:14,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:14,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255678285] [2025-03-03 15:11:14,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:14,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:14,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:11:14,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:11:14,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:14,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:14,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:14,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:14,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255678285] [2025-03-03 15:11:14,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255678285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:14,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:14,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:11:14,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12140243] [2025-03-03 15:11:14,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:14,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:11:14,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:14,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:11:14,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:14,340 INFO L87 Difference]: Start difference. First operand 654 states and 941 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:14,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:14,363 INFO L93 Difference]: Finished difference Result 1716 states and 2495 transitions. [2025-03-03 15:11:14,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:11:14,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-03 15:11:14,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:14,366 INFO L225 Difference]: With dead ends: 1716 [2025-03-03 15:11:14,367 INFO L226 Difference]: Without dead ends: 1140 [2025-03-03 15:11:14,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:14,368 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 51 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:14,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 286 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:14,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2025-03-03 15:11:14,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1138. [2025-03-03 15:11:14,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 1137 states have (on average 1.4160070360598065) internal successors, (1610), 1137 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:14,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1610 transitions. [2025-03-03 15:11:14,389 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1610 transitions. Word has length 75 [2025-03-03 15:11:14,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:14,389 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1610 transitions. [2025-03-03 15:11:14,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:14,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1610 transitions. [2025-03-03 15:11:14,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:11:14,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:14,390 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] [2025-03-03 15:11:14,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:11:14,390 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:14,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:14,391 INFO L85 PathProgramCache]: Analyzing trace with hash -2070930431, now seen corresponding path program 1 times [2025-03-03 15:11:14,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:14,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589423757] [2025-03-03 15:11:14,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:14,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:14,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:11:14,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:11:14,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:14,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:14,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:14,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:14,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589423757] [2025-03-03 15:11:14,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589423757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:14,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:14,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:11:14,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989331962] [2025-03-03 15:11:14,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:14,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:11:14,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:14,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:11:14,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:14,434 INFO L87 Difference]: Start difference. First operand 1138 states and 1610 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:14,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:14,459 INFO L93 Difference]: Finished difference Result 2200 states and 3136 transitions. [2025-03-03 15:11:14,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:11:14,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-03 15:11:14,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:14,463 INFO L225 Difference]: With dead ends: 2200 [2025-03-03 15:11:14,463 INFO L226 Difference]: Without dead ends: 1140 [2025-03-03 15:11:14,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:14,465 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 51 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:14,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 207 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:14,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2025-03-03 15:11:14,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1138. [2025-03-03 15:11:14,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 1137 states have (on average 1.4089709762532983) internal successors, (1602), 1137 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:14,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1602 transitions. [2025-03-03 15:11:14,497 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1602 transitions. Word has length 75 [2025-03-03 15:11:14,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:14,498 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1602 transitions. [2025-03-03 15:11:14,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:14,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1602 transitions. [2025-03-03 15:11:14,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:11:14,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:14,499 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] [2025-03-03 15:11:14,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:11:14,499 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:14,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:14,499 INFO L85 PathProgramCache]: Analyzing trace with hash -790865305, now seen corresponding path program 1 times [2025-03-03 15:11:14,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:14,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282117165] [2025-03-03 15:11:14,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:14,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:14,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:11:14,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:11:14,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:14,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:14,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:14,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:14,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282117165] [2025-03-03 15:11:14,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282117165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:14,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:14,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:11:14,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447709963] [2025-03-03 15:11:14,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:14,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:11:14,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:14,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:11:14,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:11:14,576 INFO L87 Difference]: Start difference. First operand 1138 states and 1602 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:14,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:14,635 INFO L93 Difference]: Finished difference Result 2052 states and 2914 transitions. [2025-03-03 15:11:14,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:11:14,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-03 15:11:14,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:14,641 INFO L225 Difference]: With dead ends: 2052 [2025-03-03 15:11:14,641 INFO L226 Difference]: Without dead ends: 1748 [2025-03-03 15:11:14,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:11:14,643 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 286 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:14,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 467 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:14,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2025-03-03 15:11:14,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1440. [2025-03-03 15:11:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 1439 states have (on average 1.4134815844336344) internal successors, (2034), 1439 states have internal predecessors, (2034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:14,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 2034 transitions. [2025-03-03 15:11:14,672 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 2034 transitions. Word has length 75 [2025-03-03 15:11:14,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:14,672 INFO L471 AbstractCegarLoop]: Abstraction has 1440 states and 2034 transitions. [2025-03-03 15:11:14,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:14,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 2034 transitions. [2025-03-03 15:11:14,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 15:11:14,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:14,673 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] [2025-03-03 15:11:14,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:11:14,673 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:14,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:14,674 INFO L85 PathProgramCache]: Analyzing trace with hash -743075544, now seen corresponding path program 1 times [2025-03-03 15:11:14,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:14,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82601965] [2025-03-03 15:11:14,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:14,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:14,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 15:11:14,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 15:11:14,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:14,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:14,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:14,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:14,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82601965] [2025-03-03 15:11:14,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82601965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:14,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:14,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:11:14,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863021904] [2025-03-03 15:11:14,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:14,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:11:14,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:14,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:11:14,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:14,747 INFO L87 Difference]: Start difference. First operand 1440 states and 2034 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:14,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:14,771 INFO L93 Difference]: Finished difference Result 3678 states and 5210 transitions. [2025-03-03 15:11:14,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:11:14,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-03 15:11:14,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:14,778 INFO L225 Difference]: With dead ends: 3678 [2025-03-03 15:11:14,778 INFO L226 Difference]: Without dead ends: 2316 [2025-03-03 15:11:14,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:14,781 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 60 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:14,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 268 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:14,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2025-03-03 15:11:14,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 2170. [2025-03-03 15:11:14,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 2169 states have (on average 1.3951129552789303) internal successors, (3026), 2169 states have internal predecessors, (3026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:14,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3026 transitions. [2025-03-03 15:11:14,820 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3026 transitions. Word has length 76 [2025-03-03 15:11:14,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:14,820 INFO L471 AbstractCegarLoop]: Abstraction has 2170 states and 3026 transitions. [2025-03-03 15:11:14,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:14,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3026 transitions. [2025-03-03 15:11:14,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:11:14,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:14,821 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] [2025-03-03 15:11:14,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:11:14,822 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:14,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:14,822 INFO L85 PathProgramCache]: Analyzing trace with hash 637285384, now seen corresponding path program 1 times [2025-03-03 15:11:14,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:14,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354207920] [2025-03-03 15:11:14,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:14,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:14,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:11:14,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:11:14,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:14,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:14,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:14,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:14,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354207920] [2025-03-03 15:11:14,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354207920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:14,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:14,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:11:14,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265305755] [2025-03-03 15:11:14,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:14,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:11:14,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:14,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:11:14,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:14,864 INFO L87 Difference]: Start difference. First operand 2170 states and 3026 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:14,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:14,892 INFO L93 Difference]: Finished difference Result 4346 states and 6083 transitions. [2025-03-03 15:11:14,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:11:14,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 15:11:14,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:14,899 INFO L225 Difference]: With dead ends: 4346 [2025-03-03 15:11:14,899 INFO L226 Difference]: Without dead ends: 2254 [2025-03-03 15:11:14,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:14,902 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 69 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:14,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 199 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:14,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2025-03-03 15:11:14,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 2252. [2025-03-03 15:11:14,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2252 states, 2251 states have (on average 1.3784984451354954) internal successors, (3103), 2251 states have internal predecessors, (3103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:14,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 3103 transitions. [2025-03-03 15:11:14,953 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 3103 transitions. Word has length 77 [2025-03-03 15:11:14,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:14,954 INFO L471 AbstractCegarLoop]: Abstraction has 2252 states and 3103 transitions. [2025-03-03 15:11:14,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:14,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 3103 transitions. [2025-03-03 15:11:14,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:11:14,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:14,955 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:14,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:11:14,955 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:14,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:14,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1635611585, now seen corresponding path program 1 times [2025-03-03 15:11:14,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:14,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956661612] [2025-03-03 15:11:14,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:14,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:14,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:11:14,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:11:14,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:14,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:15,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:15,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:15,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956661612] [2025-03-03 15:11:15,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956661612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:15,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:15,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:11:15,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395846389] [2025-03-03 15:11:15,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:15,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:11:15,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:15,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:11:15,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:15,043 INFO L87 Difference]: Start difference. First operand 2252 states and 3103 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:15,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:15,079 INFO L93 Difference]: Finished difference Result 6376 states and 8747 transitions. [2025-03-03 15:11:15,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:11:15,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 15:11:15,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:15,092 INFO L225 Difference]: With dead ends: 6376 [2025-03-03 15:11:15,092 INFO L226 Difference]: Without dead ends: 4202 [2025-03-03 15:11:15,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:15,096 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 53 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:15,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 263 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:15,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4202 states. [2025-03-03 15:11:15,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4202 to 3976. [2025-03-03 15:11:15,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3976 states, 3975 states have (on average 1.3564779874213837) internal successors, (5392), 3975 states have internal predecessors, (5392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:15,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3976 states to 3976 states and 5392 transitions. [2025-03-03 15:11:15,167 INFO L78 Accepts]: Start accepts. Automaton has 3976 states and 5392 transitions. Word has length 77 [2025-03-03 15:11:15,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:15,168 INFO L471 AbstractCegarLoop]: Abstraction has 3976 states and 5392 transitions. [2025-03-03 15:11:15,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:15,168 INFO L276 IsEmpty]: Start isEmpty. Operand 3976 states and 5392 transitions. [2025-03-03 15:11:15,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 15:11:15,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:15,168 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] [2025-03-03 15:11:15,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:11:15,169 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:15,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:15,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1730295410, now seen corresponding path program 1 times [2025-03-03 15:11:15,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:15,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924370438] [2025-03-03 15:11:15,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:15,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:15,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:11:15,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:11:15,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:15,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:15,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:15,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:15,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924370438] [2025-03-03 15:11:15,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924370438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:15,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:15,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:11:15,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311563326] [2025-03-03 15:11:15,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:15,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:11:15,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:15,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:11:15,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:15,238 INFO L87 Difference]: Start difference. First operand 3976 states and 5392 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:15,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:15,285 INFO L93 Difference]: Finished difference Result 11324 states and 15222 transitions. [2025-03-03 15:11:15,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:11:15,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-03 15:11:15,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:15,306 INFO L225 Difference]: With dead ends: 11324 [2025-03-03 15:11:15,306 INFO L226 Difference]: Without dead ends: 7426 [2025-03-03 15:11:15,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:15,312 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 43 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:15,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 262 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:15,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7426 states. [2025-03-03 15:11:15,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7426 to 6976. [2025-03-03 15:11:15,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6976 states, 6975 states have (on average 1.3250179211469535) internal successors, (9242), 6975 states have internal predecessors, (9242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:15,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6976 states to 6976 states and 9242 transitions. [2025-03-03 15:11:15,446 INFO L78 Accepts]: Start accepts. Automaton has 6976 states and 9242 transitions. Word has length 78 [2025-03-03 15:11:15,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:15,446 INFO L471 AbstractCegarLoop]: Abstraction has 6976 states and 9242 transitions. [2025-03-03 15:11:15,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:15,446 INFO L276 IsEmpty]: Start isEmpty. Operand 6976 states and 9242 transitions. [2025-03-03 15:11:15,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:11:15,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:15,447 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] [2025-03-03 15:11:15,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:11:15,447 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:15,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:15,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1767254158, now seen corresponding path program 1 times [2025-03-03 15:11:15,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:15,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192124320] [2025-03-03 15:11:15,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:15,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:15,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:11:15,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:11:15,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:15,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:15,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:15,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:15,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192124320] [2025-03-03 15:11:15,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192124320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:15,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:15,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:11:15,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640381700] [2025-03-03 15:11:15,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:15,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:11:15,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:15,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:11:15,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:11:15,610 INFO L87 Difference]: Start difference. First operand 6976 states and 9242 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:15,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:15,653 INFO L93 Difference]: Finished difference Result 7170 states and 9499 transitions. [2025-03-03 15:11:15,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:11:15,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-03 15:11:15,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:15,673 INFO L225 Difference]: With dead ends: 7170 [2025-03-03 15:11:15,674 INFO L226 Difference]: Without dead ends: 7168 [2025-03-03 15:11:15,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:11:15,677 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:15,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 598 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:15,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7168 states. [2025-03-03 15:11:15,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7168 to 7168. [2025-03-03 15:11:15,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7168 states, 7167 states have (on average 1.30514859773964) internal successors, (9354), 7167 states have internal predecessors, (9354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:15,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7168 states to 7168 states and 9354 transitions. [2025-03-03 15:11:15,817 INFO L78 Accepts]: Start accepts. Automaton has 7168 states and 9354 transitions. Word has length 79 [2025-03-03 15:11:15,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:15,818 INFO L471 AbstractCegarLoop]: Abstraction has 7168 states and 9354 transitions. [2025-03-03 15:11:15,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:15,818 INFO L276 IsEmpty]: Start isEmpty. Operand 7168 states and 9354 transitions. [2025-03-03 15:11:15,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:11:15,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:15,820 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:11:15,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:11:15,820 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:15,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:15,820 INFO L85 PathProgramCache]: Analyzing trace with hash 270198173, now seen corresponding path program 1 times [2025-03-03 15:11:15,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:15,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945924779] [2025-03-03 15:11:15,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:15,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:15,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:11:15,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:11:15,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:15,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:16,021 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:16,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:16,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945924779] [2025-03-03 15:11:16,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945924779] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:11:16,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84377917] [2025-03-03 15:11:16,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:16,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:11:16,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:11:16,025 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:11:16,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:11:16,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:11:16,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:11:16,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:16,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:16,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 15:11:16,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:11:16,778 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:16,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:11:17,905 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:17,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84377917] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:11:17,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:11:17,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 25 [2025-03-03 15:11:17,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541625023] [2025-03-03 15:11:17,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:11:17,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 15:11:17,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:17,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 15:11:17,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2025-03-03 15:11:17,907 INFO L87 Difference]: Start difference. First operand 7168 states and 9354 transitions. Second operand has 26 states, 26 states have (on average 9.76923076923077) internal successors, (254), 25 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:19,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:19,356 INFO L93 Difference]: Finished difference Result 36464 states and 47313 transitions. [2025-03-03 15:11:19,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-03 15:11:19,357 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.76923076923077) internal successors, (254), 25 states have internal predecessors, (254), 0 states have call successors, (0), 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 101 [2025-03-03 15:11:19,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:19,403 INFO L225 Difference]: With dead ends: 36464 [2025-03-03 15:11:19,404 INFO L226 Difference]: Without dead ends: 29374 [2025-03-03 15:11:19,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=893, Invalid=3013, Unknown=0, NotChecked=0, Total=3906 [2025-03-03 15:11:19,421 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 1661 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1661 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:19,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1661 Valid, 961 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:11:19,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29374 states. [2025-03-03 15:11:19,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29374 to 15318. [2025-03-03 15:11:19,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15318 states, 15317 states have (on average 1.2968596983743552) internal successors, (19864), 15317 states have internal predecessors, (19864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:19,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15318 states to 15318 states and 19864 transitions. [2025-03-03 15:11:19,724 INFO L78 Accepts]: Start accepts. Automaton has 15318 states and 19864 transitions. Word has length 101 [2025-03-03 15:11:19,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:19,724 INFO L471 AbstractCegarLoop]: Abstraction has 15318 states and 19864 transitions. [2025-03-03 15:11:19,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.76923076923077) internal successors, (254), 25 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:19,724 INFO L276 IsEmpty]: Start isEmpty. Operand 15318 states and 19864 transitions. [2025-03-03 15:11:19,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:11:19,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:19,727 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:11:19,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 15:11:19,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-03 15:11:19,928 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:19,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:19,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1295251566, now seen corresponding path program 1 times [2025-03-03 15:11:19,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:19,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998621660] [2025-03-03 15:11:19,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:19,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:19,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:11:19,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:11:19,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:19,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:19,978 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 15:11:19,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:19,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998621660] [2025-03-03 15:11:19,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998621660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:19,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:19,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:11:19,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208372161] [2025-03-03 15:11:19,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:19,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:11:19,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:19,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:11:19,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:19,979 INFO L87 Difference]: Start difference. First operand 15318 states and 19864 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:20,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:20,089 INFO L93 Difference]: Finished difference Result 29272 states and 38141 transitions. [2025-03-03 15:11:20,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:11:20,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 102 [2025-03-03 15:11:20,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:20,110 INFO L225 Difference]: With dead ends: 29272 [2025-03-03 15:11:20,111 INFO L226 Difference]: Without dead ends: 14046 [2025-03-03 15:11:20,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:20,124 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 83 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:20,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 103 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:20,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14046 states. [2025-03-03 15:11:20,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14046 to 14046. [2025-03-03 15:11:20,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14046 states, 14045 states have (on average 1.2924172303310786) internal successors, (18152), 14045 states have internal predecessors, (18152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14046 states to 14046 states and 18152 transitions. [2025-03-03 15:11:20,286 INFO L78 Accepts]: Start accepts. Automaton has 14046 states and 18152 transitions. Word has length 102 [2025-03-03 15:11:20,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:20,286 INFO L471 AbstractCegarLoop]: Abstraction has 14046 states and 18152 transitions. [2025-03-03 15:11:20,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:20,286 INFO L276 IsEmpty]: Start isEmpty. Operand 14046 states and 18152 transitions. [2025-03-03 15:11:20,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:11:20,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:20,289 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:20,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:11:20,289 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:20,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:20,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1885771850, now seen corresponding path program 1 times [2025-03-03 15:11:20,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:20,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556567795] [2025-03-03 15:11:20,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:20,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:20,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:11:20,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:11:20,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:20,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:20,632 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 15:11:20,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:20,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556567795] [2025-03-03 15:11:20,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556567795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:20,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:20,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:11:20,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262656698] [2025-03-03 15:11:20,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:20,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:11:20,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:20,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:11:20,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:11:20,634 INFO L87 Difference]: Start difference. First operand 14046 states and 18152 transitions. Second operand has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:21,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:21,175 INFO L93 Difference]: Finished difference Result 46874 states and 60092 transitions. [2025-03-03 15:11:21,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:11:21,176 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 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 102 [2025-03-03 15:11:21,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:21,226 INFO L225 Difference]: With dead ends: 46874 [2025-03-03 15:11:21,226 INFO L226 Difference]: Without dead ends: 32908 [2025-03-03 15:11:21,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:11:21,245 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 1086 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:21,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 523 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:11:21,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32908 states. [2025-03-03 15:11:21,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32908 to 14054. [2025-03-03 15:11:21,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14054 states, 14053 states have (on average 1.2922507649612183) internal successors, (18160), 14053 states have internal predecessors, (18160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:21,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14054 states to 14054 states and 18160 transitions. [2025-03-03 15:11:21,529 INFO L78 Accepts]: Start accepts. Automaton has 14054 states and 18160 transitions. Word has length 102 [2025-03-03 15:11:21,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:21,529 INFO L471 AbstractCegarLoop]: Abstraction has 14054 states and 18160 transitions. [2025-03-03 15:11:21,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:21,530 INFO L276 IsEmpty]: Start isEmpty. Operand 14054 states and 18160 transitions. [2025-03-03 15:11:21,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 15:11:21,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:21,532 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:11:21,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:11:21,533 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:21,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:21,533 INFO L85 PathProgramCache]: Analyzing trace with hash -708755619, now seen corresponding path program 1 times [2025-03-03 15:11:21,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:21,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053244692] [2025-03-03 15:11:21,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:21,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:21,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 15:11:21,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 15:11:21,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:21,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:22,035 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:22,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:22,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053244692] [2025-03-03 15:11:22,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053244692] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:11:22,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044329222] [2025-03-03 15:11:22,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:22,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:11:22,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:11:22,038 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:11:22,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:11:22,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 15:11:22,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 15:11:22,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:22,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:22,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 15:11:22,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:11:22,384 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 15:11:22,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:11:23,002 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 15:11:23,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044329222] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:11:23,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:11:23,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6, 7] total 25 [2025-03-03 15:11:23,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147277108] [2025-03-03 15:11:23,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:11:23,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 15:11:23,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:23,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 15:11:23,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:11:23,004 INFO L87 Difference]: Start difference. First operand 14054 states and 18160 transitions. Second operand has 25 states, 25 states have (on average 11.64) internal successors, (291), 25 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:30,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:30,869 INFO L93 Difference]: Finished difference Result 100873 states and 131735 transitions. [2025-03-03 15:11:30,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2025-03-03 15:11:30,869 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 11.64) internal successors, (291), 25 states have internal predecessors, (291), 0 states have call successors, (0), 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 103 [2025-03-03 15:11:30,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:30,975 INFO L225 Difference]: With dead ends: 100873 [2025-03-03 15:11:30,975 INFO L226 Difference]: Without dead ends: 86919 [2025-03-03 15:11:31,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24076 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5541, Invalid=51819, Unknown=0, NotChecked=0, Total=57360 [2025-03-03 15:11:31,110 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 6643 mSDsluCounter, 3449 mSDsCounter, 0 mSdLazyCounter, 6788 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6643 SdHoareTripleChecker+Valid, 3738 SdHoareTripleChecker+Invalid, 6914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 6788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:31,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6643 Valid, 3738 Invalid, 6914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 6788 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 15:11:31,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86919 states. [2025-03-03 15:11:31,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86919 to 71490. [2025-03-03 15:11:31,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71490 states, 71489 states have (on average 1.3050958888780093) internal successors, (93300), 71489 states have internal predecessors, (93300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:31,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71490 states to 71490 states and 93300 transitions. [2025-03-03 15:11:31,911 INFO L78 Accepts]: Start accepts. Automaton has 71490 states and 93300 transitions. Word has length 103 [2025-03-03 15:11:31,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:31,911 INFO L471 AbstractCegarLoop]: Abstraction has 71490 states and 93300 transitions. [2025-03-03 15:11:31,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 11.64) internal successors, (291), 25 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:31,912 INFO L276 IsEmpty]: Start isEmpty. Operand 71490 states and 93300 transitions. [2025-03-03 15:11:31,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 15:11:31,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:31,915 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:31,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 15:11:32,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-03 15:11:32,116 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:32,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:32,117 INFO L85 PathProgramCache]: Analyzing trace with hash 167439618, now seen corresponding path program 1 times [2025-03-03 15:11:32,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:32,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321901824] [2025-03-03 15:11:32,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:32,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:32,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 15:11:32,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 15:11:32,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:32,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:32,374 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 15:11:32,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:32,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321901824] [2025-03-03 15:11:32,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321901824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:32,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:32,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:11:32,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533553385] [2025-03-03 15:11:32,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:32,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:11:32,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:32,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:11:32,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:11:32,376 INFO L87 Difference]: Start difference. First operand 71490 states and 93300 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:32,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:32,962 INFO L93 Difference]: Finished difference Result 197536 states and 257206 transitions. [2025-03-03 15:11:32,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:11:32,962 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 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 103 [2025-03-03 15:11:32,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:33,389 INFO L225 Difference]: With dead ends: 197536 [2025-03-03 15:11:33,389 INFO L226 Difference]: Without dead ends: 145508 [2025-03-03 15:11:33,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:11:33,446 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 488 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:33,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 564 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:11:33,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145508 states. [2025-03-03 15:11:34,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145508 to 71482. [2025-03-03 15:11:34,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71482 states, 71481 states have (on average 1.3051020550915629) internal successors, (93290), 71481 states have internal predecessors, (93290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:34,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71482 states to 71482 states and 93290 transitions. [2025-03-03 15:11:34,497 INFO L78 Accepts]: Start accepts. Automaton has 71482 states and 93290 transitions. Word has length 103 [2025-03-03 15:11:34,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:34,497 INFO L471 AbstractCegarLoop]: Abstraction has 71482 states and 93290 transitions. [2025-03-03 15:11:34,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:34,497 INFO L276 IsEmpty]: Start isEmpty. Operand 71482 states and 93290 transitions. [2025-03-03 15:11:34,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 15:11:34,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:34,501 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:34,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:11:34,501 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:34,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:34,501 INFO L85 PathProgramCache]: Analyzing trace with hash -21805674, now seen corresponding path program 1 times [2025-03-03 15:11:34,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:34,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381126309] [2025-03-03 15:11:34,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:34,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:34,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 15:11:34,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 15:11:34,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:34,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:35,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:35,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381126309] [2025-03-03 15:11:35,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381126309] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:11:35,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843349453] [2025-03-03 15:11:35,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:35,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:11:35,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:11:35,034 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:11:35,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 15:11:35,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 15:11:35,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 15:11:35,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:35,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:35,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 15:11:35,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:11:37,257 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:37,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:11:39,138 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:39,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843349453] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:11:39,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:11:39,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 42 [2025-03-03 15:11:39,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156616475] [2025-03-03 15:11:39,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:11:39,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-03 15:11:39,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:39,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-03 15:11:39,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1566, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 15:11:39,150 INFO L87 Difference]: Start difference. First operand 71482 states and 93290 transitions. Second operand has 42 states, 42 states have (on average 6.690476190476191) internal successors, (281), 42 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:40,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:40,932 INFO L93 Difference]: Finished difference Result 228354 states and 298419 transitions. [2025-03-03 15:11:40,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 15:11:40,933 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 6.690476190476191) internal successors, (281), 42 states have internal predecessors, (281), 0 states have call successors, (0), 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 104 [2025-03-03 15:11:40,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:41,129 INFO L225 Difference]: With dead ends: 228354 [2025-03-03 15:11:41,129 INFO L226 Difference]: Without dead ends: 159392 [2025-03-03 15:11:41,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=379, Invalid=3043, Unknown=0, NotChecked=0, Total=3422 [2025-03-03 15:11:41,204 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 579 mSDsluCounter, 3064 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 3219 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:41,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 3219 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:11:41,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159392 states. [2025-03-03 15:11:42,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159392 to 128579. [2025-03-03 15:11:42,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128579 states, 128578 states have (on average 1.3037611410972327) internal successors, (167635), 128578 states have internal predecessors, (167635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:42,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128579 states to 128579 states and 167635 transitions. [2025-03-03 15:11:42,768 INFO L78 Accepts]: Start accepts. Automaton has 128579 states and 167635 transitions. Word has length 104 [2025-03-03 15:11:42,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:42,769 INFO L471 AbstractCegarLoop]: Abstraction has 128579 states and 167635 transitions. [2025-03-03 15:11:42,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 6.690476190476191) internal successors, (281), 42 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:42,769 INFO L276 IsEmpty]: Start isEmpty. Operand 128579 states and 167635 transitions. [2025-03-03 15:11:42,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 15:11:42,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:42,772 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:42,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 15:11:42,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:11:42,973 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:42,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:42,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1836795211, now seen corresponding path program 1 times [2025-03-03 15:11:42,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:42,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074781690] [2025-03-03 15:11:42,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:42,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:42,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 15:11:42,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 15:11:42,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:42,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:43,552 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:43,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:43,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074781690] [2025-03-03 15:11:43,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074781690] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:11:43,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007599749] [2025-03-03 15:11:43,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:43,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:11:43,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:11:43,555 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:11:43,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 15:11:43,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 15:11:43,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 15:11:43,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:43,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:43,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-03 15:11:43,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:11:45,189 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:45,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:11:46,448 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:46,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007599749] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:11:46,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:11:46,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21, 19] total 51 [2025-03-03 15:11:46,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431997440] [2025-03-03 15:11:46,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:11:46,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-03 15:11:46,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:46,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-03 15:11:46,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=2290, Unknown=0, NotChecked=0, Total=2550 [2025-03-03 15:11:46,451 INFO L87 Difference]: Start difference. First operand 128579 states and 167635 transitions. Second operand has 51 states, 51 states have (on average 5.372549019607843) internal successors, (274), 51 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:52,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:52,829 INFO L93 Difference]: Finished difference Result 353585 states and 459570 transitions. [2025-03-03 15:11:52,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-03-03 15:11:52,830 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 5.372549019607843) internal successors, (274), 51 states have internal predecessors, (274), 0 states have call successors, (0), 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 105 [2025-03-03 15:11:52,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:53,419 INFO L225 Difference]: With dead ends: 353585 [2025-03-03 15:11:53,420 INFO L226 Difference]: Without dead ends: 301712 [2025-03-03 15:11:53,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 173 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3065 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1534, Invalid=10676, Unknown=0, NotChecked=0, Total=12210 [2025-03-03 15:11:53,603 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 2828 mSDsluCounter, 7887 mSDsCounter, 0 mSdLazyCounter, 5148 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2828 SdHoareTripleChecker+Valid, 8198 SdHoareTripleChecker+Invalid, 5186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 5148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:53,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2828 Valid, 8198 Invalid, 5186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 5148 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 15:11:53,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301712 states. [2025-03-03 15:11:55,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301712 to 175602. [2025-03-03 15:11:55,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175602 states, 175601 states have (on average 1.3018946361353296) internal successors, (228614), 175601 states have internal predecessors, (228614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:56,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175602 states to 175602 states and 228614 transitions. [2025-03-03 15:11:56,172 INFO L78 Accepts]: Start accepts. Automaton has 175602 states and 228614 transitions. Word has length 105 [2025-03-03 15:11:56,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:56,172 INFO L471 AbstractCegarLoop]: Abstraction has 175602 states and 228614 transitions. [2025-03-03 15:11:56,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 5.372549019607843) internal successors, (274), 51 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:56,173 INFO L276 IsEmpty]: Start isEmpty. Operand 175602 states and 228614 transitions. [2025-03-03 15:11:56,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 15:11:56,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:56,175 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:56,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 15:11:56,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-03 15:11:56,376 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:56,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:56,377 INFO L85 PathProgramCache]: Analyzing trace with hash 146213577, now seen corresponding path program 1 times [2025-03-03 15:11:56,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:56,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871885774] [2025-03-03 15:11:56,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:56,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:56,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 15:11:56,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 15:11:56,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:56,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:56,632 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:56,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:56,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871885774] [2025-03-03 15:11:56,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871885774] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:11:56,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509611908] [2025-03-03 15:11:56,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:56,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:11:56,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:11:56,635 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:11:56,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 15:11:56,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 15:11:56,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 15:11:56,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:56,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:56,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 15:11:56,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:11:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:57,135 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:11:57,584 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:57,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509611908] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:11:57,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:11:57,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 28 [2025-03-03 15:11:57,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108520592] [2025-03-03 15:11:57,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:11:57,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 15:11:57,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:57,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 15:11:57,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:11:57,586 INFO L87 Difference]: Start difference. First operand 175602 states and 228614 transitions. Second operand has 28 states, 28 states have (on average 10.142857142857142) internal successors, (284), 28 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:03,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:03,176 INFO L93 Difference]: Finished difference Result 398889 states and 513275 transitions. [2025-03-03 15:12:03,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2025-03-03 15:12:03,176 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 10.142857142857142) internal successors, (284), 28 states have internal predecessors, (284), 0 states have call successors, (0), 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 105 [2025-03-03 15:12:03,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:03,768 INFO L225 Difference]: With dead ends: 398889 [2025-03-03 15:12:03,768 INFO L226 Difference]: Without dead ends: 275898 [2025-03-03 15:12:03,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8329 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3813, Invalid=20367, Unknown=0, NotChecked=0, Total=24180 [2025-03-03 15:12:03,841 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 2240 mSDsluCounter, 2730 mSDsCounter, 0 mSdLazyCounter, 2941 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2240 SdHoareTripleChecker+Valid, 2891 SdHoareTripleChecker+Invalid, 3005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:03,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2240 Valid, 2891 Invalid, 3005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2941 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 15:12:04,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275898 states. [2025-03-03 15:12:05,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275898 to 183908. [2025-03-03 15:12:05,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183908 states, 183907 states have (on average 1.2840185528555195) internal successors, (236140), 183907 states have internal predecessors, (236140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:06,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183908 states to 183908 states and 236140 transitions. [2025-03-03 15:12:06,191 INFO L78 Accepts]: Start accepts. Automaton has 183908 states and 236140 transitions. Word has length 105 [2025-03-03 15:12:06,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:06,192 INFO L471 AbstractCegarLoop]: Abstraction has 183908 states and 236140 transitions. [2025-03-03 15:12:06,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.142857142857142) internal successors, (284), 28 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:06,192 INFO L276 IsEmpty]: Start isEmpty. Operand 183908 states and 236140 transitions. [2025-03-03 15:12:06,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 15:12:06,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:06,195 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:12:06,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 15:12:06,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-03 15:12:06,396 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:12:06,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:06,396 INFO L85 PathProgramCache]: Analyzing trace with hash -923475806, now seen corresponding path program 1 times [2025-03-03 15:12:06,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:06,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794500255] [2025-03-03 15:12:06,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:06,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:06,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 15:12:06,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 15:12:06,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:06,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:07,073 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:07,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:07,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794500255] [2025-03-03 15:12:07,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794500255] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:12:07,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278557657] [2025-03-03 15:12:07,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:07,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:12:07,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:12:07,076 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:12:07,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 15:12:07,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 15:12:07,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 15:12:07,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:07,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:07,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 15:12:07,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:12:07,737 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:07,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:12:08,372 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:08,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278557657] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:12:08,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:12:08,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2025-03-03 15:12:08,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714633282] [2025-03-03 15:12:08,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:12:08,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 15:12:08,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:08,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 15:12:08,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2025-03-03 15:12:08,374 INFO L87 Difference]: Start difference. First operand 183908 states and 236140 transitions. Second operand has 26 states, 26 states have (on average 9.153846153846153) internal successors, (238), 25 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:09,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:09,624 INFO L93 Difference]: Finished difference Result 292353 states and 375128 transitions. [2025-03-03 15:12:09,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 15:12:09,625 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.153846153846153) internal successors, (238), 25 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-03-03 15:12:09,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:09,895 INFO L225 Difference]: With dead ends: 292353 [2025-03-03 15:12:09,895 INFO L226 Difference]: Without dead ends: 208246 [2025-03-03 15:12:09,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=353, Invalid=1287, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 15:12:09,961 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 883 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:09,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 1208 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:12:10,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208246 states. [2025-03-03 15:12:11,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208246 to 179556. [2025-03-03 15:12:11,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179556 states, 179555 states have (on average 1.2811840383169502) internal successors, (230043), 179555 states have internal predecessors, (230043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:12,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179556 states to 179556 states and 230043 transitions. [2025-03-03 15:12:12,088 INFO L78 Accepts]: Start accepts. Automaton has 179556 states and 230043 transitions. Word has length 105 [2025-03-03 15:12:12,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:12,088 INFO L471 AbstractCegarLoop]: Abstraction has 179556 states and 230043 transitions. [2025-03-03 15:12:12,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.153846153846153) internal successors, (238), 25 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:12,089 INFO L276 IsEmpty]: Start isEmpty. Operand 179556 states and 230043 transitions. [2025-03-03 15:12:12,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 15:12:12,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:12,091 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:12:12,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 15:12:12,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:12:12,291 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:12:12,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:12,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1618148148, now seen corresponding path program 1 times [2025-03-03 15:12:12,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:12,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202498975] [2025-03-03 15:12:12,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:12,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:12,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 15:12:12,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 15:12:12,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:12,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:12,581 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:12,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:12,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202498975] [2025-03-03 15:12:12,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202498975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:12,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:12,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:12:12,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105297634] [2025-03-03 15:12:12,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:12,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:12:12,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:12,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:12:12,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:12:12,582 INFO L87 Difference]: Start difference. First operand 179556 states and 230043 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:13,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:13,045 INFO L93 Difference]: Finished difference Result 289914 states and 371439 transitions. [2025-03-03 15:12:13,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:12:13,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2025-03-03 15:12:13,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:13,154 INFO L225 Difference]: With dead ends: 289914 [2025-03-03 15:12:13,154 INFO L226 Difference]: Without dead ends: 110483 [2025-03-03 15:12:13,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:12:13,237 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 51 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:13,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 238 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:12:13,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110483 states. [2025-03-03 15:12:14,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110483 to 101936. [2025-03-03 15:12:14,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101936 states, 101935 states have (on average 1.2706430568499534) internal successors, (129523), 101935 states have internal predecessors, (129523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:14,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101936 states to 101936 states and 129523 transitions. [2025-03-03 15:12:14,448 INFO L78 Accepts]: Start accepts. Automaton has 101936 states and 129523 transitions. Word has length 106 [2025-03-03 15:12:14,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:14,448 INFO L471 AbstractCegarLoop]: Abstraction has 101936 states and 129523 transitions. [2025-03-03 15:12:14,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:14,448 INFO L276 IsEmpty]: Start isEmpty. Operand 101936 states and 129523 transitions. [2025-03-03 15:12:14,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 15:12:14,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:14,450 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:12:14,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:12:14,450 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:12:14,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:14,451 INFO L85 PathProgramCache]: Analyzing trace with hash -649949132, now seen corresponding path program 1 times [2025-03-03 15:12:14,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:14,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976732] [2025-03-03 15:12:14,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:14,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:14,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 15:12:14,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 15:12:14,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:14,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:15,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:15,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:15,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976732] [2025-03-03 15:12:15,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:12:15,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066720763] [2025-03-03 15:12:15,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:15,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:12:15,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:12:15,157 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:12:15,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 15:12:15,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 15:12:15,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 15:12:15,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:15,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:15,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 15:12:15,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:12:15,839 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:15,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:12:16,368 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:16,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066720763] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:12:16,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:12:16,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 11] total 37 [2025-03-03 15:12:16,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726259830] [2025-03-03 15:12:16,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:12:16,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-03 15:12:16,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:16,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-03 15:12:16,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1232, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 15:12:16,370 INFO L87 Difference]: Start difference. First operand 101936 states and 129523 transitions. Second operand has 37 states, 37 states have (on average 8.08108108108108) internal successors, (299), 37 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:19,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:19,623 INFO L93 Difference]: Finished difference Result 400671 states and 512173 transitions. [2025-03-03 15:12:19,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-03-03 15:12:19,624 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 8.08108108108108) internal successors, (299), 37 states have internal predecessors, (299), 0 states have call successors, (0), 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 106 [2025-03-03 15:12:19,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:20,253 INFO L225 Difference]: With dead ends: 400671 [2025-03-03 15:12:20,253 INFO L226 Difference]: Without dead ends: 345603 [2025-03-03 15:12:20,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1512, Invalid=8190, Unknown=0, NotChecked=0, Total=9702 [2025-03-03 15:12:20,297 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 2168 mSDsluCounter, 4861 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2168 SdHoareTripleChecker+Valid, 5072 SdHoareTripleChecker+Invalid, 2653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:20,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2168 Valid, 5072 Invalid, 2653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2630 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:12:20,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345603 states. [2025-03-03 15:12:22,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345603 to 182330. [2025-03-03 15:12:23,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182330 states, 182329 states have (on average 1.2813266128811105) internal successors, (233623), 182329 states have internal predecessors, (233623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:23,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182330 states to 182330 states and 233623 transitions. [2025-03-03 15:12:23,203 INFO L78 Accepts]: Start accepts. Automaton has 182330 states and 233623 transitions. Word has length 106 [2025-03-03 15:12:23,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:23,203 INFO L471 AbstractCegarLoop]: Abstraction has 182330 states and 233623 transitions. [2025-03-03 15:12:23,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 8.08108108108108) internal successors, (299), 37 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:23,203 INFO L276 IsEmpty]: Start isEmpty. Operand 182330 states and 233623 transitions. [2025-03-03 15:12:23,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 15:12:23,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:23,205 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:12:23,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 15:12:23,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:12:23,406 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:12:23,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:23,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1047291856, now seen corresponding path program 1 times [2025-03-03 15:12:23,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:23,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826724965] [2025-03-03 15:12:23,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:23,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:23,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 15:12:23,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 15:12:23,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:23,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:23,739 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:23,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:23,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826724965] [2025-03-03 15:12:23,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826724965] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:12:23,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733228054] [2025-03-03 15:12:23,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:23,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:12:23,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:12:23,743 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:12:23,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 15:12:23,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 15:12:23,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 15:12:23,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:23,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:23,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 15:12:23,891 INFO L279 TraceCheckSpWp]: Computing forward predicates...