./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 e2fb8bed 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-?-e2fb8be-m [2025-03-08 06:22:10,131 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:22:10,187 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:22:10,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:22:10,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:22:10,212 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:22:10,213 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:22:10,214 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:22:10,214 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:22:10,214 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:22:10,215 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:22:10,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:22:10,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:22:10,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:22:10,216 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:22:10,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:22:10,216 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:22:10,216 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:22:10,216 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:22:10,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:22:10,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:22:10,217 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:22:10,217 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:22:10,217 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:22:10,217 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:22:10,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:22:10,217 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:22:10,217 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:22:10,217 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:22:10,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:22:10,217 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:22:10,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:22:10,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:22:10,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:22:10,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:22:10,218 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:22:10,218 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:22:10,218 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:22:10,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:22:10,218 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:22:10,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:22:10,219 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:22:10,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:22:10,219 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-08 06:22:10,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:22:10,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:22:10,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:22:10,454 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:22:10,454 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:22:10,455 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-08 06:22:11,615 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79a7169a4/373850419e3c437e8c48e2af5ad401e1/FLAGef50f85af [2025-03-08 06:22:11,903 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:22:11,906 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-08 06:22:11,918 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79a7169a4/373850419e3c437e8c48e2af5ad401e1/FLAGef50f85af [2025-03-08 06:22:12,181 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79a7169a4/373850419e3c437e8c48e2af5ad401e1 [2025-03-08 06:22:12,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:22:12,184 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:22:12,185 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:22:12,185 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:22:12,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:22:12,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:22:12" (1/1) ... [2025-03-08 06:22:12,189 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c9801bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:12, skipping insertion in model container [2025-03-08 06:22:12,189 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:22:12" (1/1) ... [2025-03-08 06:22:12,220 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:22:12,402 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-08 06:22:12,421 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-08 06:22:12,428 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-08 06:22:12,433 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-08 06:22:12,441 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-08 06:22:12,447 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-08 06:22:12,454 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-08 06:22:12,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:22:12,499 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:22:12,549 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-08 06:22:12,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[10452,10465] [2025-03-08 06:22:12,573 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-08 06:22:12,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[12149,12162] [2025-03-08 06:22:12,583 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-08 06:22:12,593 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-08 06:22:12,599 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-08 06:22:12,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:22:12,651 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:22:12,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:12 WrapperNode [2025-03-08 06:22:12,654 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:22:12,655 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:22:12,655 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:22:12,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:22:12,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:12" (1/1) ... [2025-03-08 06:22:12,675 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:12" (1/1) ... [2025-03-08 06:22:12,718 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1106 [2025-03-08 06:22:12,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:22:12,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:22:12,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:22:12,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:22:12,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:12" (1/1) ... [2025-03-08 06:22:12,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:12" (1/1) ... [2025-03-08 06:22:12,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:12" (1/1) ... [2025-03-08 06:22:12,752 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-08 06:22:12,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:12" (1/1) ... [2025-03-08 06:22:12,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:12" (1/1) ... [2025-03-08 06:22:12,764 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:12" (1/1) ... [2025-03-08 06:22:12,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:12" (1/1) ... [2025-03-08 06:22:12,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:12" (1/1) ... [2025-03-08 06:22:12,770 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:12" (1/1) ... [2025-03-08 06:22:12,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:22:12,774 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:22:12,774 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:22:12,774 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:22:12,775 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:12" (1/1) ... [2025-03-08 06:22:12,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:22:12,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:22:12,804 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-08 06:22:12,809 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-08 06:22:12,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:22:12,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:22:12,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:22:12,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:22:12,934 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:22:12,936 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:22:13,621 INFO L1307 $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-08 06:22:13,621 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L267: havoc main_~node3__m3~1#1; [2025-03-08 06:22:13,621 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L169: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-08 06:22:13,621 INFO L1307 $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-08 06:22:13,622 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1227: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-03-08 06:22:13,622 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L468: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-08 06:22:13,622 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1559: havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2025-03-08 06:22:13,622 INFO L1307 $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-08 06:22:13,622 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L339: havoc main_~node2__m2~2#1; [2025-03-08 06:22:13,622 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L836: havoc main_~node2__m2~3#1; [2025-03-08 06:22:13,622 INFO L1307 $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-08 06:22:13,622 INFO L1307 $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-08 06:22:13,622 INFO L1307 $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-08 06:22:13,622 INFO L1307 $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-08 06:22:13,622 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1403: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1; [2025-03-08 06:22:13,622 INFO L1307 $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-08 06:22:13,622 INFO L1307 $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-08 06:22:13,622 INFO L1307 $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-08 06:22:13,622 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L513: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-08 06:22:13,622 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1043: havoc main_~check__tmp~9#1; [2025-03-08 06:22:13,622 INFO L1307 $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-08 06:22:13,623 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L252: havoc main_~node2__m2~1#1; [2025-03-08 06:22:13,623 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-08 06:22:13,624 INFO L1307 $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-08 06:22:13,624 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L981: havoc main_~node3__m3~5#1; [2025-03-08 06:22:13,624 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L354: havoc main_~node3__m3~2#1; [2025-03-08 06:22:13,624 INFO L1307 $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-08 06:22:13,624 INFO L1307 $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-08 06:22:13,624 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L851: havoc main_~node3__m3~4#1; [2025-03-08 06:22:13,624 INFO L1307 $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-08 06:22:13,624 INFO L1307 $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-08 06:22:13,624 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L689: havoc main_~node3__m3~3#1; [2025-03-08 06:22:13,624 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L559: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-08 06:22:13,624 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1386: havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2025-03-08 06:22:13,624 INFO L1307 $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-08 06:22:13,665 INFO L? ?]: Removed 178 outVars from TransFormulas that were not future-live. [2025-03-08 06:22:13,665 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:22:13,674 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:22:13,674 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:22:13,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:22:13 BoogieIcfgContainer [2025-03-08 06:22:13,674 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:22:13,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:22:13,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:22:13,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:22:13,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:22:12" (1/3) ... [2025-03-08 06:22:13,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65571bb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:22:13, skipping insertion in model container [2025-03-08 06:22:13,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:12" (2/3) ... [2025-03-08 06:22:13,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65571bb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:22:13, skipping insertion in model container [2025-03-08 06:22:13,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:22:13" (3/3) ... [2025-03-08 06:22:13,683 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2025-03-08 06:22:13,696 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:22:13,699 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-08 06:22:13,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:22:13,766 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;@28acca5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:22:13,767 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-08 06:22:13,770 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-08 06:22:13,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 06:22:13,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:13,776 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-08 06:22:13,776 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-08 06:22:13,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:13,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1471971337, now seen corresponding path program 1 times [2025-03-08 06:22:13,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:13,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187523714] [2025-03-08 06:22:13,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:13,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:13,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 06:22:13,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 06:22:13,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:13,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:14,209 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-08 06:22:14,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:14,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187523714] [2025-03-08 06:22:14,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187523714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:14,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:14,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:22:14,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880177452] [2025-03-08 06:22:14,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:14,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:22:14,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:14,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:22:14,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:22:14,233 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-08 06:22:14,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:14,468 INFO L93 Difference]: Finished difference Result 423 states and 706 transitions. [2025-03-08 06:22:14,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:22:14,471 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-08 06:22:14,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:14,480 INFO L225 Difference]: With dead ends: 423 [2025-03-08 06:22:14,480 INFO L226 Difference]: Without dead ends: 259 [2025-03-08 06:22:14,485 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-08 06:22:14,487 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-08 06:22:14,487 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-08 06:22:14,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-08 06:22:14,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 235. [2025-03-08 06:22:14,520 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-08 06:22:14,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 306 transitions. [2025-03-08 06:22:14,528 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 306 transitions. Word has length 47 [2025-03-08 06:22:14,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:14,528 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 306 transitions. [2025-03-08 06:22:14,528 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-08 06:22:14,528 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 306 transitions. [2025-03-08 06:22:14,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 06:22:14,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:14,529 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-08 06:22:14,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:22:14,530 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-08 06:22:14,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:14,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1803525020, now seen corresponding path program 1 times [2025-03-08 06:22:14,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:14,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308075651] [2025-03-08 06:22:14,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:14,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:14,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 06:22:14,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 06:22:14,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:14,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:14,650 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-08 06:22:14,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:14,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308075651] [2025-03-08 06:22:14,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308075651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:14,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:14,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:22:14,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690876365] [2025-03-08 06:22:14,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:14,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:22:14,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:14,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:22:14,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:22:14,652 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-08 06:22:14,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:14,781 INFO L93 Difference]: Finished difference Result 418 states and 557 transitions. [2025-03-08 06:22:14,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:22:14,782 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-08 06:22:14,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:14,784 INFO L225 Difference]: With dead ends: 418 [2025-03-08 06:22:14,784 INFO L226 Difference]: Without dead ends: 222 [2025-03-08 06:22:14,784 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-08 06:22:14,785 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-08 06:22:14,785 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-08 06:22:14,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-08 06:22:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2025-03-08 06:22:14,795 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-08 06:22:14,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 289 transitions. [2025-03-08 06:22:14,796 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 289 transitions. Word has length 48 [2025-03-08 06:22:14,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:14,796 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 289 transitions. [2025-03-08 06:22:14,796 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-08 06:22:14,796 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 289 transitions. [2025-03-08 06:22:14,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 06:22:14,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:14,797 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-08 06:22:14,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:22:14,797 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-08 06:22:14,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:14,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1778591775, now seen corresponding path program 1 times [2025-03-08 06:22:14,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:14,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678824327] [2025-03-08 06:22:14,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:14,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:14,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 06:22:14,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 06:22:14,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:14,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:14,914 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-08 06:22:14,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:14,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678824327] [2025-03-08 06:22:14,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678824327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:14,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:14,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:22:14,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135198592] [2025-03-08 06:22:14,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:14,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:22:14,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:14,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:22:14,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:22:14,917 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-08 06:22:15,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:15,044 INFO L93 Difference]: Finished difference Result 405 states and 538 transitions. [2025-03-08 06:22:15,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:22:15,047 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-08 06:22:15,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:15,048 INFO L225 Difference]: With dead ends: 405 [2025-03-08 06:22:15,048 INFO L226 Difference]: Without dead ends: 217 [2025-03-08 06:22:15,049 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-08 06:22:15,049 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-08 06:22:15,049 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-08 06:22:15,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-08 06:22:15,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-03-08 06:22:15,055 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-08 06:22:15,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 281 transitions. [2025-03-08 06:22:15,055 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 281 transitions. Word has length 49 [2025-03-08 06:22:15,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:15,056 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 281 transitions. [2025-03-08 06:22:15,056 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-08 06:22:15,056 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 281 transitions. [2025-03-08 06:22:15,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 06:22:15,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:15,057 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-08 06:22:15,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:22:15,057 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-08 06:22:15,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:15,057 INFO L85 PathProgramCache]: Analyzing trace with hash -380560756, now seen corresponding path program 1 times [2025-03-08 06:22:15,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:15,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176362394] [2025-03-08 06:22:15,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:15,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:15,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 06:22:15,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 06:22:15,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:15,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:15,423 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-08 06:22:15,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:15,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176362394] [2025-03-08 06:22:15,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176362394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:15,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:15,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:22:15,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820663574] [2025-03-08 06:22:15,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:15,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:22:15,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:15,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:22:15,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:22:15,426 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-08 06:22:15,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:15,853 INFO L93 Difference]: Finished difference Result 449 states and 604 transitions. [2025-03-08 06:22:15,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:22:15,854 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-08 06:22:15,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:15,855 INFO L225 Difference]: With dead ends: 449 [2025-03-08 06:22:15,856 INFO L226 Difference]: Without dead ends: 348 [2025-03-08 06:22:15,856 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-08 06:22:15,857 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-08 06:22:15,857 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-08 06:22:15,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-03-08 06:22:15,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 217. [2025-03-08 06:22:15,870 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-08 06:22:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 280 transitions. [2025-03-08 06:22:15,871 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 280 transitions. Word has length 50 [2025-03-08 06:22:15,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:15,871 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 280 transitions. [2025-03-08 06:22:15,871 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-08 06:22:15,872 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 280 transitions. [2025-03-08 06:22:15,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 06:22:15,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:15,874 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-08 06:22:15,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:22:15,874 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-08 06:22:15,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:15,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1680390286, now seen corresponding path program 1 times [2025-03-08 06:22:15,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:15,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257809442] [2025-03-08 06:22:15,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:15,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:15,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 06:22:15,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 06:22:15,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:15,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:16,165 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-08 06:22:16,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:16,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257809442] [2025-03-08 06:22:16,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257809442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:16,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:16,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:22:16,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044558284] [2025-03-08 06:22:16,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:16,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:22:16,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:16,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:22:16,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:22:16,168 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-08 06:22:16,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:16,546 INFO L93 Difference]: Finished difference Result 360 states and 471 transitions. [2025-03-08 06:22:16,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:22:16,546 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-08 06:22:16,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:16,548 INFO L225 Difference]: With dead ends: 360 [2025-03-08 06:22:16,548 INFO L226 Difference]: Without dead ends: 355 [2025-03-08 06:22:16,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:22:16,550 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-08 06:22:16,551 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-08 06:22:16,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-08 06:22:16,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 217. [2025-03-08 06:22:16,556 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-08 06:22:16,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 279 transitions. [2025-03-08 06:22:16,557 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 279 transitions. Word has length 50 [2025-03-08 06:22:16,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:16,557 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 279 transitions. [2025-03-08 06:22:16,557 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-08 06:22:16,557 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 279 transitions. [2025-03-08 06:22:16,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 06:22:16,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:16,558 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-08 06:22:16,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:22:16,558 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-08 06:22:16,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:16,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1010743158, now seen corresponding path program 1 times [2025-03-08 06:22:16,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:16,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941158456] [2025-03-08 06:22:16,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:16,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:16,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 06:22:16,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 06:22:16,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:16,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:16,744 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-08 06:22:16,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:16,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941158456] [2025-03-08 06:22:16,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941158456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:16,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:16,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:22:16,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040965553] [2025-03-08 06:22:16,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:16,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:22:16,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:16,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:22:16,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:22:16,745 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-08 06:22:16,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:16,977 INFO L93 Difference]: Finished difference Result 461 states and 610 transitions. [2025-03-08 06:22:16,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:22:16,978 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-08 06:22:16,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:16,980 INFO L225 Difference]: With dead ends: 461 [2025-03-08 06:22:16,980 INFO L226 Difference]: Without dead ends: 337 [2025-03-08 06:22:16,980 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-08 06:22:16,981 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:22:16,981 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.2s Time] [2025-03-08 06:22:16,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-08 06:22:16,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 217. [2025-03-08 06:22:16,989 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-08 06:22:16,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 278 transitions. [2025-03-08 06:22:16,989 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 278 transitions. Word has length 50 [2025-03-08 06:22:16,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:16,990 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 278 transitions. [2025-03-08 06:22:16,990 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-08 06:22:16,990 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 278 transitions. [2025-03-08 06:22:16,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 06:22:16,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:16,990 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-08 06:22:16,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:22:16,990 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-08 06:22:16,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:16,991 INFO L85 PathProgramCache]: Analyzing trace with hash -746342518, now seen corresponding path program 1 times [2025-03-08 06:22:16,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:16,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448836928] [2025-03-08 06:22:16,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:16,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:17,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 06:22:17,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 06:22:17,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:17,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:17,508 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-08 06:22:17,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:17,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448836928] [2025-03-08 06:22:17,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448836928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:17,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:17,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:22:17,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891000109] [2025-03-08 06:22:17,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:17,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:22:17,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:17,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:22:17,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:22:17,509 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-08 06:22:18,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:18,002 INFO L93 Difference]: Finished difference Result 437 states and 587 transitions. [2025-03-08 06:22:18,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:22:18,002 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-08 06:22:18,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:18,004 INFO L225 Difference]: With dead ends: 437 [2025-03-08 06:22:18,004 INFO L226 Difference]: Without dead ends: 421 [2025-03-08 06:22:18,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2025-03-08 06:22:18,005 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:22:18,005 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.2s Time] [2025-03-08 06:22:18,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-08 06:22:18,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 201. [2025-03-08 06:22:18,014 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-08 06:22:18,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 259 transitions. [2025-03-08 06:22:18,015 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 259 transitions. Word has length 52 [2025-03-08 06:22:18,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:18,015 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 259 transitions. [2025-03-08 06:22:18,016 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-08 06:22:18,016 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 259 transitions. [2025-03-08 06:22:18,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 06:22:18,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:18,017 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-08 06:22:18,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:22:18,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-08 06:22:18,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:18,020 INFO L85 PathProgramCache]: Analyzing trace with hash 631287948, now seen corresponding path program 1 times [2025-03-08 06:22:18,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:18,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27569601] [2025-03-08 06:22:18,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:18,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:18,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 06:22:18,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 06:22:18,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:18,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:18,398 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-08 06:22:18,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:18,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27569601] [2025-03-08 06:22:18,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27569601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:18,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:18,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:22:18,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952867568] [2025-03-08 06:22:18,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:18,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:22:18,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:18,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:22:18,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:22:18,399 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-08 06:22:18,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:18,670 INFO L93 Difference]: Finished difference Result 383 states and 525 transitions. [2025-03-08 06:22:18,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:22:18,670 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-08 06:22:18,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:18,671 INFO L225 Difference]: With dead ends: 383 [2025-03-08 06:22:18,671 INFO L226 Difference]: Without dead ends: 266 [2025-03-08 06:22:18,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-03-08 06:22:18,672 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-08 06:22:18,673 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-08 06:22:18,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-08 06:22:18,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 168. [2025-03-08 06:22:18,676 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-08 06:22:18,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 220 transitions. [2025-03-08 06:22:18,680 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 220 transitions. Word has length 52 [2025-03-08 06:22:18,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:18,680 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 220 transitions. [2025-03-08 06:22:18,680 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-08 06:22:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 220 transitions. [2025-03-08 06:22:18,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 06:22:18,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:18,680 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-08 06:22:18,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:22:18,680 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-08 06:22:18,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:18,681 INFO L85 PathProgramCache]: Analyzing trace with hash 890010117, now seen corresponding path program 1 times [2025-03-08 06:22:18,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:18,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017535248] [2025-03-08 06:22:18,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:18,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:18,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 06:22:18,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 06:22:18,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:18,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:18,855 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-08 06:22:18,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:18,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017535248] [2025-03-08 06:22:18,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017535248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:18,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:18,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:22:18,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439878155] [2025-03-08 06:22:18,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:18,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:22:18,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:18,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:22:18,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:22:18,857 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-08 06:22:19,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:19,058 INFO L93 Difference]: Finished difference Result 285 states and 384 transitions. [2025-03-08 06:22:19,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:22:19,059 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-08 06:22:19,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:19,060 INFO L225 Difference]: With dead ends: 285 [2025-03-08 06:22:19,060 INFO L226 Difference]: Without dead ends: 171 [2025-03-08 06:22:19,061 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-08 06:22:19,061 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-08 06:22:19,061 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-08 06:22:19,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-08 06:22:19,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2025-03-08 06:22:19,066 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-08 06:22:19,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 218 transitions. [2025-03-08 06:22:19,067 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 218 transitions. Word has length 53 [2025-03-08 06:22:19,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:19,067 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 218 transitions. [2025-03-08 06:22:19,067 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-08 06:22:19,067 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 218 transitions. [2025-03-08 06:22:19,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 06:22:19,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:19,067 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-08 06:22:19,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:22:19,068 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-08 06:22:19,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:19,068 INFO L85 PathProgramCache]: Analyzing trace with hash 403604581, now seen corresponding path program 1 times [2025-03-08 06:22:19,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:19,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215392143] [2025-03-08 06:22:19,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:19,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:19,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 06:22:19,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 06:22:19,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:19,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:19,457 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-08 06:22:19,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:19,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215392143] [2025-03-08 06:22:19,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215392143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:19,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:19,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 06:22:19,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824108940] [2025-03-08 06:22:19,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:19,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:22:19,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:19,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:22:19,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:22:19,458 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-08 06:22:19,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:19,856 INFO L93 Difference]: Finished difference Result 278 states and 376 transitions. [2025-03-08 06:22:19,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:22:19,857 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-08 06:22:19,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:19,858 INFO L225 Difference]: With dead ends: 278 [2025-03-08 06:22:19,858 INFO L226 Difference]: Without dead ends: 272 [2025-03-08 06:22:19,858 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-08 06:22:19,859 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-08 06:22:19,860 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-08 06:22:19,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-08 06:22:19,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 162. [2025-03-08 06:22:19,864 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-08 06:22:19,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 211 transitions. [2025-03-08 06:22:19,865 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 211 transitions. Word has length 55 [2025-03-08 06:22:19,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:19,865 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 211 transitions. [2025-03-08 06:22:19,865 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-08 06:22:19,865 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 211 transitions. [2025-03-08 06:22:19,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 06:22:19,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:19,866 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-08 06:22:19,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:22:19,866 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-08 06:22:19,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:19,867 INFO L85 PathProgramCache]: Analyzing trace with hash -222439869, now seen corresponding path program 1 times [2025-03-08 06:22:19,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:19,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859036788] [2025-03-08 06:22:19,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:19,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:19,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 06:22:19,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 06:22:19,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:19,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:19,947 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-08 06:22:19,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:19,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859036788] [2025-03-08 06:22:19,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859036788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:19,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:19,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:22:19,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176280400] [2025-03-08 06:22:19,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:19,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:22:19,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:19,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:22:19,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:22:19,949 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-08 06:22:20,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:20,014 INFO L93 Difference]: Finished difference Result 666 states and 967 transitions. [2025-03-08 06:22:20,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:22:20,015 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-08 06:22:20,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:20,017 INFO L225 Difference]: With dead ends: 666 [2025-03-08 06:22:20,017 INFO L226 Difference]: Without dead ends: 582 [2025-03-08 06:22:20,018 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-08 06:22:20,018 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-08 06:22:20,020 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-08 06:22:20,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-03-08 06:22:20,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 244. [2025-03-08 06:22:20,029 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-08 06:22:20,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 332 transitions. [2025-03-08 06:22:20,030 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 332 transitions. Word has length 73 [2025-03-08 06:22:20,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:20,030 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 332 transitions. [2025-03-08 06:22:20,030 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-08 06:22:20,030 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 332 transitions. [2025-03-08 06:22:20,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 06:22:20,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:20,032 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-08 06:22:20,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:22:20,033 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-08 06:22:20,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:20,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1225296391, now seen corresponding path program 1 times [2025-03-08 06:22:20,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:20,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092850996] [2025-03-08 06:22:20,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:20,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:20,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 06:22:20,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 06:22:20,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:20,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:20,119 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-08 06:22:20,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:20,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092850996] [2025-03-08 06:22:20,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092850996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:20,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:20,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:22:20,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854867903] [2025-03-08 06:22:20,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:20,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:22:20,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:20,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:22:20,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:22:20,121 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-08 06:22:20,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:20,182 INFO L93 Difference]: Finished difference Result 826 states and 1195 transitions. [2025-03-08 06:22:20,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:22:20,182 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-08 06:22:20,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:20,185 INFO L225 Difference]: With dead ends: 826 [2025-03-08 06:22:20,185 INFO L226 Difference]: Without dead ends: 660 [2025-03-08 06:22:20,185 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-08 06:22:20,186 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-08 06:22:20,186 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-08 06:22:20,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-03-08 06:22:20,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 408. [2025-03-08 06:22:20,199 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-08 06:22:20,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 576 transitions. [2025-03-08 06:22:20,200 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 576 transitions. Word has length 75 [2025-03-08 06:22:20,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:20,200 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 576 transitions. [2025-03-08 06:22:20,200 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-08 06:22:20,201 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 576 transitions. [2025-03-08 06:22:20,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 06:22:20,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:20,201 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-08 06:22:20,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:22:20,202 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-08 06:22:20,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:20,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1357339335, now seen corresponding path program 1 times [2025-03-08 06:22:20,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:20,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251540592] [2025-03-08 06:22:20,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:20,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:20,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 06:22:20,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 06:22:20,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:20,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:20,327 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-08 06:22:20,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:20,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251540592] [2025-03-08 06:22:20,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251540592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:20,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:20,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:22:20,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752130735] [2025-03-08 06:22:20,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:20,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:22:20,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:20,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:22:20,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:22:20,330 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-08 06:22:20,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:20,398 INFO L93 Difference]: Finished difference Result 990 states and 1439 transitions. [2025-03-08 06:22:20,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:22:20,398 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-08 06:22:20,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:20,401 INFO L225 Difference]: With dead ends: 990 [2025-03-08 06:22:20,401 INFO L226 Difference]: Without dead ends: 824 [2025-03-08 06:22:20,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:22:20,402 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-08 06:22:20,402 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-08 06:22:20,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2025-03-08 06:22:20,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 654. [2025-03-08 06:22:20,415 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-08 06:22:20,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 941 transitions. [2025-03-08 06:22:20,417 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 941 transitions. Word has length 75 [2025-03-08 06:22:20,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:20,418 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 941 transitions. [2025-03-08 06:22:20,418 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-08 06:22:20,418 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 941 transitions. [2025-03-08 06:22:20,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 06:22:20,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:20,420 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-08 06:22:20,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:22:20,421 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-08 06:22:20,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:20,421 INFO L85 PathProgramCache]: Analyzing trace with hash -2106947750, now seen corresponding path program 1 times [2025-03-08 06:22:20,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:20,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882015582] [2025-03-08 06:22:20,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:20,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:20,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 06:22:20,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 06:22:20,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:20,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:20,479 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-08 06:22:20,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:20,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882015582] [2025-03-08 06:22:20,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882015582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:20,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:20,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:22:20,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505651602] [2025-03-08 06:22:20,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:20,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:22:20,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:20,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:22:20,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:22:20,480 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-08 06:22:20,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:20,507 INFO L93 Difference]: Finished difference Result 1716 states and 2495 transitions. [2025-03-08 06:22:20,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:22:20,508 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-08 06:22:20,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:20,512 INFO L225 Difference]: With dead ends: 1716 [2025-03-08 06:22:20,513 INFO L226 Difference]: Without dead ends: 1140 [2025-03-08 06:22:20,513 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-08 06:22:20,514 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-08 06:22:20,515 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-08 06:22:20,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2025-03-08 06:22:20,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1138. [2025-03-08 06:22:20,536 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-08 06:22:20,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1610 transitions. [2025-03-08 06:22:20,541 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1610 transitions. Word has length 75 [2025-03-08 06:22:20,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:20,541 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1610 transitions. [2025-03-08 06:22:20,541 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-08 06:22:20,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1610 transitions. [2025-03-08 06:22:20,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 06:22:20,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:20,545 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-08 06:22:20,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:22:20,545 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-08 06:22:20,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:20,545 INFO L85 PathProgramCache]: Analyzing trace with hash -2070930431, now seen corresponding path program 1 times [2025-03-08 06:22:20,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:20,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851723474] [2025-03-08 06:22:20,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:20,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:20,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 06:22:20,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 06:22:20,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:20,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:20,594 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-08 06:22:20,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:20,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851723474] [2025-03-08 06:22:20,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851723474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:20,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:20,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:22:20,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040264182] [2025-03-08 06:22:20,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:20,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:22:20,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:20,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:22:20,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:22:20,597 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-08 06:22:20,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:20,628 INFO L93 Difference]: Finished difference Result 2200 states and 3136 transitions. [2025-03-08 06:22:20,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:22:20,629 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-08 06:22:20,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:20,632 INFO L225 Difference]: With dead ends: 2200 [2025-03-08 06:22:20,633 INFO L226 Difference]: Without dead ends: 1140 [2025-03-08 06:22:20,634 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-08 06:22:20,634 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-08 06:22:20,634 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-08 06:22:20,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2025-03-08 06:22:20,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1138. [2025-03-08 06:22:20,653 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-08 06:22:20,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1602 transitions. [2025-03-08 06:22:20,656 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1602 transitions. Word has length 75 [2025-03-08 06:22:20,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:20,656 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1602 transitions. [2025-03-08 06:22:20,657 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-08 06:22:20,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1602 transitions. [2025-03-08 06:22:20,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 06:22:20,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:20,658 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-08 06:22:20,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:22:20,658 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-08 06:22:20,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:20,658 INFO L85 PathProgramCache]: Analyzing trace with hash -790865305, now seen corresponding path program 1 times [2025-03-08 06:22:20,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:20,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891876031] [2025-03-08 06:22:20,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:20,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:20,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 06:22:20,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 06:22:20,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:20,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:20,738 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-08 06:22:20,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:20,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891876031] [2025-03-08 06:22:20,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891876031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:20,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:20,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:22:20,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149108063] [2025-03-08 06:22:20,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:20,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:22:20,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:20,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:22:20,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:22:20,740 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-08 06:22:20,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:20,804 INFO L93 Difference]: Finished difference Result 2052 states and 2914 transitions. [2025-03-08 06:22:20,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:22:20,805 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-08 06:22:20,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:20,810 INFO L225 Difference]: With dead ends: 2052 [2025-03-08 06:22:20,811 INFO L226 Difference]: Without dead ends: 1748 [2025-03-08 06:22:20,812 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-08 06:22:20,812 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-08 06:22:20,813 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-08 06:22:20,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2025-03-08 06:22:20,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1440. [2025-03-08 06:22:20,840 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-08 06:22:20,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 2034 transitions. [2025-03-08 06:22:20,844 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 2034 transitions. Word has length 75 [2025-03-08 06:22:20,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:20,845 INFO L471 AbstractCegarLoop]: Abstraction has 1440 states and 2034 transitions. [2025-03-08 06:22:20,845 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-08 06:22:20,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 2034 transitions. [2025-03-08 06:22:20,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 06:22:20,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:20,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, 1, 1, 1] [2025-03-08 06:22:20,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:22:20,846 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-08 06:22:20,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:20,847 INFO L85 PathProgramCache]: Analyzing trace with hash -743075544, now seen corresponding path program 1 times [2025-03-08 06:22:20,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:20,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032806043] [2025-03-08 06:22:20,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:20,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:20,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 06:22:20,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 06:22:20,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:20,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:20,932 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-08 06:22:20,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:20,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032806043] [2025-03-08 06:22:20,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032806043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:20,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:20,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:22:20,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193400574] [2025-03-08 06:22:20,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:20,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:22:20,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:20,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:22:20,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:22:20,934 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-08 06:22:20,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:20,959 INFO L93 Difference]: Finished difference Result 3678 states and 5210 transitions. [2025-03-08 06:22:20,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:22:20,960 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-08 06:22:20,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:20,966 INFO L225 Difference]: With dead ends: 3678 [2025-03-08 06:22:20,967 INFO L226 Difference]: Without dead ends: 2316 [2025-03-08 06:22:20,969 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-08 06:22:20,969 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-08 06:22:20,969 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-08 06:22:20,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2025-03-08 06:22:21,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 2170. [2025-03-08 06:22:21,005 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-08 06:22:21,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3026 transitions. [2025-03-08 06:22:21,011 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3026 transitions. Word has length 76 [2025-03-08 06:22:21,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:21,011 INFO L471 AbstractCegarLoop]: Abstraction has 2170 states and 3026 transitions. [2025-03-08 06:22:21,011 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-08 06:22:21,012 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3026 transitions. [2025-03-08 06:22:21,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:22:21,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:21,012 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-08 06:22:21,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:22:21,012 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-08 06:22:21,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:21,013 INFO L85 PathProgramCache]: Analyzing trace with hash 637285384, now seen corresponding path program 1 times [2025-03-08 06:22:21,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:21,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200254086] [2025-03-08 06:22:21,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:21,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:21,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:22:21,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:22:21,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:21,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:21,055 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-08 06:22:21,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:21,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200254086] [2025-03-08 06:22:21,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200254086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:21,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:21,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:22:21,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906012655] [2025-03-08 06:22:21,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:21,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:22:21,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:21,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:22:21,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:22:21,057 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-08 06:22:21,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:21,091 INFO L93 Difference]: Finished difference Result 4346 states and 6083 transitions. [2025-03-08 06:22:21,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:22:21,092 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-08 06:22:21,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:21,099 INFO L225 Difference]: With dead ends: 4346 [2025-03-08 06:22:21,099 INFO L226 Difference]: Without dead ends: 2254 [2025-03-08 06:22:21,101 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-08 06:22:21,101 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-08 06:22:21,101 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-08 06:22:21,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2025-03-08 06:22:21,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 2252. [2025-03-08 06:22:21,135 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-08 06:22:21,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 3103 transitions. [2025-03-08 06:22:21,142 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 3103 transitions. Word has length 77 [2025-03-08 06:22:21,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:21,142 INFO L471 AbstractCegarLoop]: Abstraction has 2252 states and 3103 transitions. [2025-03-08 06:22:21,142 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-08 06:22:21,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 3103 transitions. [2025-03-08 06:22:21,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:22:21,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:21,143 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-08 06:22:21,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:22:21,144 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-08 06:22:21,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:21,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1635611585, now seen corresponding path program 1 times [2025-03-08 06:22:21,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:21,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397091203] [2025-03-08 06:22:21,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:21,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:21,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:22:21,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:22:21,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:21,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:21,216 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-08 06:22:21,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:21,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397091203] [2025-03-08 06:22:21,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397091203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:21,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:21,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:22:21,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319158063] [2025-03-08 06:22:21,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:21,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:22:21,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:21,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:22:21,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:22:21,218 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-08 06:22:21,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:21,256 INFO L93 Difference]: Finished difference Result 6376 states and 8747 transitions. [2025-03-08 06:22:21,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:22:21,257 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-08 06:22:21,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:21,268 INFO L225 Difference]: With dead ends: 6376 [2025-03-08 06:22:21,268 INFO L226 Difference]: Without dead ends: 4202 [2025-03-08 06:22:21,271 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-08 06:22:21,272 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-08 06:22:21,272 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-08 06:22:21,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4202 states. [2025-03-08 06:22:21,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4202 to 3976. [2025-03-08 06:22:21,329 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-08 06:22:21,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3976 states to 3976 states and 5392 transitions. [2025-03-08 06:22:21,340 INFO L78 Accepts]: Start accepts. Automaton has 3976 states and 5392 transitions. Word has length 77 [2025-03-08 06:22:21,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:21,341 INFO L471 AbstractCegarLoop]: Abstraction has 3976 states and 5392 transitions. [2025-03-08 06:22:21,341 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-08 06:22:21,341 INFO L276 IsEmpty]: Start isEmpty. Operand 3976 states and 5392 transitions. [2025-03-08 06:22:21,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 06:22:21,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:21,342 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-08 06:22:21,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:22:21,342 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-08 06:22:21,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:21,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1730295410, now seen corresponding path program 1 times [2025-03-08 06:22:21,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:21,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353875877] [2025-03-08 06:22:21,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:21,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:21,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:22:21,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:22:21,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:21,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:21,436 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-08 06:22:21,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:21,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353875877] [2025-03-08 06:22:21,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353875877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:21,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:21,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:22:21,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966635140] [2025-03-08 06:22:21,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:21,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:22:21,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:21,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:22:21,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:22:21,438 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-08 06:22:21,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:21,485 INFO L93 Difference]: Finished difference Result 11324 states and 15222 transitions. [2025-03-08 06:22:21,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:22:21,485 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-08 06:22:21,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:21,507 INFO L225 Difference]: With dead ends: 11324 [2025-03-08 06:22:21,507 INFO L226 Difference]: Without dead ends: 7426 [2025-03-08 06:22:21,513 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-08 06:22:21,514 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-08 06:22:21,514 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-08 06:22:21,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7426 states. [2025-03-08 06:22:21,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7426 to 6976. [2025-03-08 06:22:21,626 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-08 06:22:21,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6976 states to 6976 states and 9242 transitions. [2025-03-08 06:22:21,650 INFO L78 Accepts]: Start accepts. Automaton has 6976 states and 9242 transitions. Word has length 78 [2025-03-08 06:22:21,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:21,650 INFO L471 AbstractCegarLoop]: Abstraction has 6976 states and 9242 transitions. [2025-03-08 06:22:21,650 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-08 06:22:21,651 INFO L276 IsEmpty]: Start isEmpty. Operand 6976 states and 9242 transitions. [2025-03-08 06:22:21,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 06:22:21,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:21,651 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-08 06:22:21,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 06:22:21,651 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-08 06:22:21,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:21,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1767254158, now seen corresponding path program 1 times [2025-03-08 06:22:21,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:21,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509767596] [2025-03-08 06:22:21,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:21,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:21,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 06:22:21,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 06:22:21,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:21,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:21,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:22:21,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:21,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509767596] [2025-03-08 06:22:21,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509767596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:21,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:21,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:22:21,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192639971] [2025-03-08 06:22:21,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:21,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:22:21,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:21,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:22:21,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:22:21,825 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-08 06:22:21,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:21,871 INFO L93 Difference]: Finished difference Result 7170 states and 9499 transitions. [2025-03-08 06:22:21,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:22:21,871 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-08 06:22:21,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:21,896 INFO L225 Difference]: With dead ends: 7170 [2025-03-08 06:22:21,896 INFO L226 Difference]: Without dead ends: 7168 [2025-03-08 06:22:21,898 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-08 06:22:21,899 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-08 06:22:21,899 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-08 06:22:21,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7168 states. [2025-03-08 06:22:22,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7168 to 7168. [2025-03-08 06:22:22,019 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-08 06:22:22,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7168 states to 7168 states and 9354 transitions. [2025-03-08 06:22:22,042 INFO L78 Accepts]: Start accepts. Automaton has 7168 states and 9354 transitions. Word has length 79 [2025-03-08 06:22:22,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:22,042 INFO L471 AbstractCegarLoop]: Abstraction has 7168 states and 9354 transitions. [2025-03-08 06:22:22,043 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-08 06:22:22,043 INFO L276 IsEmpty]: Start isEmpty. Operand 7168 states and 9354 transitions. [2025-03-08 06:22:22,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 06:22:22,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:22,045 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-08 06:22:22,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 06:22:22,045 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-08 06:22:22,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:22,046 INFO L85 PathProgramCache]: Analyzing trace with hash 270198173, now seen corresponding path program 1 times [2025-03-08 06:22:22,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:22,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543457165] [2025-03-08 06:22:22,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:22,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:22,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 06:22:22,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 06:22:22,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:22,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:22,257 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-08 06:22:22,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:22,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543457165] [2025-03-08 06:22:22,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543457165] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:22:22,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058181386] [2025-03-08 06:22:22,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:22,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:22:22,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:22:22,260 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-08 06:22:22,261 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-08 06:22:22,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 06:22:22,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 06:22:22,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:22,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:22,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 06:22:22,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:22:23,149 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-08 06:22:23,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:22:24,160 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-08 06:22:24,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058181386] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:22:24,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:22:24,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 25 [2025-03-08 06:22:24,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809128996] [2025-03-08 06:22:24,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:22:24,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 06:22:24,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:24,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 06:22:24,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2025-03-08 06:22:24,163 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-08 06:22:25,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:25,601 INFO L93 Difference]: Finished difference Result 36464 states and 47313 transitions. [2025-03-08 06:22:25,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-08 06:22:25,603 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-08 06:22:25,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:25,654 INFO L225 Difference]: With dead ends: 36464 [2025-03-08 06:22:25,654 INFO L226 Difference]: Without dead ends: 29374 [2025-03-08 06:22:25,673 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-08 06:22:25,675 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.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:22:25,675 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.5s Time] [2025-03-08 06:22:25,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29374 states. [2025-03-08 06:22:25,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29374 to 15318. [2025-03-08 06:22:25,974 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-08 06:22:26,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15318 states to 15318 states and 19864 transitions. [2025-03-08 06:22:26,006 INFO L78 Accepts]: Start accepts. Automaton has 15318 states and 19864 transitions. Word has length 101 [2025-03-08 06:22:26,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:26,006 INFO L471 AbstractCegarLoop]: Abstraction has 15318 states and 19864 transitions. [2025-03-08 06:22:26,007 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-08 06:22:26,007 INFO L276 IsEmpty]: Start isEmpty. Operand 15318 states and 19864 transitions. [2025-03-08 06:22:26,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 06:22:26,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:26,010 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-08 06:22:26,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 06:22:26,211 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-08 06:22:26,211 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-08 06:22:26,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:26,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1295251566, now seen corresponding path program 1 times [2025-03-08 06:22:26,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:26,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067673411] [2025-03-08 06:22:26,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:26,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:26,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 06:22:26,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 06:22:26,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:26,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:26,260 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-08 06:22:26,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:26,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067673411] [2025-03-08 06:22:26,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067673411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:26,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:26,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:22:26,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42716157] [2025-03-08 06:22:26,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:26,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:22:26,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:26,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:22:26,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:22:26,262 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-08 06:22:26,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:26,401 INFO L93 Difference]: Finished difference Result 29272 states and 38141 transitions. [2025-03-08 06:22:26,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:22:26,405 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-08 06:22:26,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:26,431 INFO L225 Difference]: With dead ends: 29272 [2025-03-08 06:22:26,431 INFO L226 Difference]: Without dead ends: 14046 [2025-03-08 06:22:26,445 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-08 06:22:26,446 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-08 06:22:26,446 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-08 06:22:26,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14046 states. [2025-03-08 06:22:26,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14046 to 14046. [2025-03-08 06:22:26,636 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-08 06:22:26,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14046 states to 14046 states and 18152 transitions. [2025-03-08 06:22:26,660 INFO L78 Accepts]: Start accepts. Automaton has 14046 states and 18152 transitions. Word has length 102 [2025-03-08 06:22:26,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:26,660 INFO L471 AbstractCegarLoop]: Abstraction has 14046 states and 18152 transitions. [2025-03-08 06:22:26,660 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-08 06:22:26,660 INFO L276 IsEmpty]: Start isEmpty. Operand 14046 states and 18152 transitions. [2025-03-08 06:22:26,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 06:22:26,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:26,663 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-08 06:22:26,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 06:22:26,664 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-08 06:22:26,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:26,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1885771850, now seen corresponding path program 1 times [2025-03-08 06:22:26,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:26,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904539977] [2025-03-08 06:22:26,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:26,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:26,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 06:22:26,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 06:22:26,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:26,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:27,004 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-08 06:22:27,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:27,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904539977] [2025-03-08 06:22:27,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904539977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:27,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:27,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:22:27,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849413597] [2025-03-08 06:22:27,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:27,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:22:27,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:27,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:22:27,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:22:27,006 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-08 06:22:27,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:27,564 INFO L93 Difference]: Finished difference Result 46874 states and 60092 transitions. [2025-03-08 06:22:27,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:22:27,565 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-08 06:22:27,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:27,610 INFO L225 Difference]: With dead ends: 46874 [2025-03-08 06:22:27,610 INFO L226 Difference]: Without dead ends: 32908 [2025-03-08 06:22:27,627 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-08 06:22:27,628 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:22:27,628 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.3s Time] [2025-03-08 06:22:27,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32908 states. [2025-03-08 06:22:27,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32908 to 14054. [2025-03-08 06:22:27,941 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-08 06:22:27,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14054 states to 14054 states and 18160 transitions. [2025-03-08 06:22:27,966 INFO L78 Accepts]: Start accepts. Automaton has 14054 states and 18160 transitions. Word has length 102 [2025-03-08 06:22:27,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:27,966 INFO L471 AbstractCegarLoop]: Abstraction has 14054 states and 18160 transitions. [2025-03-08 06:22:27,966 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-08 06:22:27,966 INFO L276 IsEmpty]: Start isEmpty. Operand 14054 states and 18160 transitions. [2025-03-08 06:22:27,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 06:22:27,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:27,969 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-08 06:22:27,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 06:22:27,970 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-08 06:22:27,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:27,970 INFO L85 PathProgramCache]: Analyzing trace with hash -708755619, now seen corresponding path program 1 times [2025-03-08 06:22:27,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:27,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709670402] [2025-03-08 06:22:27,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:27,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:27,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 06:22:28,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 06:22:28,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:28,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:28,517 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-08 06:22:28,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:28,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709670402] [2025-03-08 06:22:28,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709670402] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:22:28,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59573892] [2025-03-08 06:22:28,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:28,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:22:28,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:22:28,521 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-08 06:22:28,523 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-08 06:22:28,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 06:22:28,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 06:22:28,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:28,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:28,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 06:22:28,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:22:28,860 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-08 06:22:28,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:22:29,464 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-08 06:22:29,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59573892] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:22:29,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:22:29,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6, 7] total 25 [2025-03-08 06:22:29,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129265076] [2025-03-08 06:22:29,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:22:29,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 06:22:29,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:29,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 06:22:29,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:22:29,467 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-08 06:22:37,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:37,873 INFO L93 Difference]: Finished difference Result 100873 states and 131735 transitions. [2025-03-08 06:22:37,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2025-03-08 06:22:37,873 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-08 06:22:37,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:37,986 INFO L225 Difference]: With dead ends: 100873 [2025-03-08 06:22:37,986 INFO L226 Difference]: Without dead ends: 86919 [2025-03-08 06:22:38,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24076 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5541, Invalid=51819, Unknown=0, NotChecked=0, Total=57360 [2025-03-08 06:22:38,018 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 6643 mSDsluCounter, 3449 mSDsCounter, 0 mSdLazyCounter, 6788 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:22:38,018 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.6s Time] [2025-03-08 06:22:38,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86919 states. [2025-03-08 06:22:38,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86919 to 71490. [2025-03-08 06:22:38,951 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-08 06:22:39,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71490 states to 71490 states and 93300 transitions. [2025-03-08 06:22:39,067 INFO L78 Accepts]: Start accepts. Automaton has 71490 states and 93300 transitions. Word has length 103 [2025-03-08 06:22:39,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:39,067 INFO L471 AbstractCegarLoop]: Abstraction has 71490 states and 93300 transitions. [2025-03-08 06:22:39,068 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-08 06:22:39,068 INFO L276 IsEmpty]: Start isEmpty. Operand 71490 states and 93300 transitions. [2025-03-08 06:22:39,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 06:22:39,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:39,071 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-08 06:22:39,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 06:22:39,276 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-08 06:22:39,276 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-08 06:22:39,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:39,277 INFO L85 PathProgramCache]: Analyzing trace with hash 167439618, now seen corresponding path program 1 times [2025-03-08 06:22:39,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:39,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224600590] [2025-03-08 06:22:39,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:39,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:39,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 06:22:39,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 06:22:39,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:39,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:39,487 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-08 06:22:39,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:39,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224600590] [2025-03-08 06:22:39,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224600590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:39,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:39,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:22:39,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856040921] [2025-03-08 06:22:39,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:39,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:22:39,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:39,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:22:39,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:22:39,489 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-08 06:22:40,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:40,405 INFO L93 Difference]: Finished difference Result 197536 states and 257206 transitions. [2025-03-08 06:22:40,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:22:40,408 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-08 06:22:40,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:40,590 INFO L225 Difference]: With dead ends: 197536 [2025-03-08 06:22:40,590 INFO L226 Difference]: Without dead ends: 145508 [2025-03-08 06:22:40,623 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-08 06:22:40,624 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-08 06:22:40,624 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-08 06:22:40,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145508 states. [2025-03-08 06:22:41,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145508 to 71482. [2025-03-08 06:22:41,731 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-08 06:22:41,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71482 states to 71482 states and 93290 transitions. [2025-03-08 06:22:41,813 INFO L78 Accepts]: Start accepts. Automaton has 71482 states and 93290 transitions. Word has length 103 [2025-03-08 06:22:41,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:41,813 INFO L471 AbstractCegarLoop]: Abstraction has 71482 states and 93290 transitions. [2025-03-08 06:22:41,813 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-08 06:22:41,813 INFO L276 IsEmpty]: Start isEmpty. Operand 71482 states and 93290 transitions. [2025-03-08 06:22:41,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 06:22:41,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:41,816 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-08 06:22:41,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 06:22:41,816 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-08 06:22:41,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:41,817 INFO L85 PathProgramCache]: Analyzing trace with hash -21805674, now seen corresponding path program 1 times [2025-03-08 06:22:41,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:41,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370353830] [2025-03-08 06:22:41,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:41,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:41,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 06:22:41,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 06:22:41,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:41,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:42,470 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-08 06:22:42,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:42,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370353830] [2025-03-08 06:22:42,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370353830] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:22:42,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781849493] [2025-03-08 06:22:42,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:42,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:22:42,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:22:42,473 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-08 06:22:42,475 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-08 06:22:42,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 06:22:42,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 06:22:42,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:42,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:42,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 06:22:42,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:22:44,783 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-08 06:22:44,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:22:47,079 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-08 06:22:47,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781849493] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:22:47,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:22:47,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 42 [2025-03-08 06:22:47,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028344267] [2025-03-08 06:22:47,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:22:47,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-08 06:22:47,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:47,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-08 06:22:47,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1566, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 06:22:47,081 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-08 06:22:49,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:49,100 INFO L93 Difference]: Finished difference Result 228354 states and 298419 transitions. [2025-03-08 06:22:49,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 06:22:49,100 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-08 06:22:49,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:49,298 INFO L225 Difference]: With dead ends: 228354 [2025-03-08 06:22:49,298 INFO L226 Difference]: Without dead ends: 159392 [2025-03-08 06:22:49,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=379, Invalid=3043, Unknown=0, NotChecked=0, Total=3422 [2025-03-08 06:22:49,375 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 579 mSDsluCounter, 3064 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:22:49,375 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.9s Time] [2025-03-08 06:22:49,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159392 states. [2025-03-08 06:22:50,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159392 to 128579. [2025-03-08 06:22:50,993 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-08 06:22:51,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128579 states to 128579 states and 167635 transitions. [2025-03-08 06:22:51,198 INFO L78 Accepts]: Start accepts. Automaton has 128579 states and 167635 transitions. Word has length 104 [2025-03-08 06:22:51,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:51,198 INFO L471 AbstractCegarLoop]: Abstraction has 128579 states and 167635 transitions. [2025-03-08 06:22:51,199 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-08 06:22:51,199 INFO L276 IsEmpty]: Start isEmpty. Operand 128579 states and 167635 transitions. [2025-03-08 06:22:51,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 06:22:51,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:51,203 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-08 06:22:51,210 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-08 06:22:51,403 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-08 06:22:51,403 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-08 06:22:51,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:51,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1836795211, now seen corresponding path program 1 times [2025-03-08 06:22:51,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:51,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298518147] [2025-03-08 06:22:51,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:51,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:51,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 06:22:51,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 06:22:51,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:51,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:52,080 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-08 06:22:52,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:52,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298518147] [2025-03-08 06:22:52,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298518147] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:22:52,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33855339] [2025-03-08 06:22:52,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:52,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:22:52,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:22:52,083 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-08 06:22:52,086 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-08 06:22:52,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 06:22:52,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 06:22:52,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:52,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:52,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-08 06:22:52,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:22:53,520 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-08 06:22:53,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:22:54,907 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-08 06:22:54,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33855339] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:22:54,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:22:54,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21, 19] total 51 [2025-03-08 06:22:54,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528984829] [2025-03-08 06:22:54,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:22:54,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-08 06:22:54,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:54,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-08 06:22:54,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=2290, Unknown=0, NotChecked=0, Total=2550 [2025-03-08 06:22:54,909 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-08 06:23:01,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:01,931 INFO L93 Difference]: Finished difference Result 353585 states and 459570 transitions. [2025-03-08 06:23:01,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-03-08 06:23:01,932 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-08 06:23:01,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:02,305 INFO L225 Difference]: With dead ends: 353585 [2025-03-08 06:23:02,306 INFO L226 Difference]: Without dead ends: 301712 [2025-03-08 06:23:02,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 173 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3065 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1534, Invalid=10676, Unknown=0, NotChecked=0, Total=12210 [2025-03-08 06:23:02,382 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 2828 mSDsluCounter, 7887 mSDsCounter, 0 mSdLazyCounter, 5148 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:02,383 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.4s Time] [2025-03-08 06:23:02,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301712 states. [2025-03-08 06:23:04,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301712 to 175602. [2025-03-08 06:23:05,131 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-08 06:23:05,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175602 states to 175602 states and 228614 transitions. [2025-03-08 06:23:05,346 INFO L78 Accepts]: Start accepts. Automaton has 175602 states and 228614 transitions. Word has length 105 [2025-03-08 06:23:05,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:05,346 INFO L471 AbstractCegarLoop]: Abstraction has 175602 states and 228614 transitions. [2025-03-08 06:23:05,347 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-08 06:23:05,347 INFO L276 IsEmpty]: Start isEmpty. Operand 175602 states and 228614 transitions. [2025-03-08 06:23:05,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 06:23:05,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:05,350 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-08 06:23:05,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 06:23:05,550 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-08 06:23:05,550 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-08 06:23:05,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:05,551 INFO L85 PathProgramCache]: Analyzing trace with hash 146213577, now seen corresponding path program 1 times [2025-03-08 06:23:05,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:05,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469227778] [2025-03-08 06:23:05,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:05,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:05,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 06:23:05,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 06:23:05,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:05,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:06,190 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-08 06:23:06,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:06,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469227778] [2025-03-08 06:23:06,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469227778] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:23:06,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347731786] [2025-03-08 06:23:06,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:06,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:23:06,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:23:06,193 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-08 06:23:06,195 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-08 06:23:06,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 06:23:06,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 06:23:06,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:06,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:06,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 06:23:06,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:23:06,790 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-08 06:23:06,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:23:07,212 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-08 06:23:07,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347731786] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:23:07,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:23:07,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 28 [2025-03-08 06:23:07,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248459131] [2025-03-08 06:23:07,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:23:07,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 06:23:07,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:07,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 06:23:07,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:23:07,213 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-08 06:23:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:12,564 INFO L93 Difference]: Finished difference Result 398889 states and 513275 transitions. [2025-03-08 06:23:12,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2025-03-08 06:23:12,565 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-08 06:23:12,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:12,966 INFO L225 Difference]: With dead ends: 398889 [2025-03-08 06:23:12,966 INFO L226 Difference]: Without dead ends: 275898 [2025-03-08 06:23:13,097 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-08 06:23:13,098 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 2240 mSDsluCounter, 2730 mSDsCounter, 0 mSdLazyCounter, 2941 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:13,098 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.1s Time] [2025-03-08 06:23:13,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275898 states. [2025-03-08 06:23:15,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275898 to 183908. [2025-03-08 06:23:15,646 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-08 06:23:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183908 states to 183908 states and 236140 transitions. [2025-03-08 06:23:15,857 INFO L78 Accepts]: Start accepts. Automaton has 183908 states and 236140 transitions. Word has length 105 [2025-03-08 06:23:15,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:15,857 INFO L471 AbstractCegarLoop]: Abstraction has 183908 states and 236140 transitions. [2025-03-08 06:23:15,857 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-08 06:23:15,857 INFO L276 IsEmpty]: Start isEmpty. Operand 183908 states and 236140 transitions. [2025-03-08 06:23:15,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 06:23:15,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:15,860 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-08 06:23:15,867 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-08 06:23:16,060 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-08 06:23:16,061 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-08 06:23:16,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:16,061 INFO L85 PathProgramCache]: Analyzing trace with hash -923475806, now seen corresponding path program 1 times [2025-03-08 06:23:16,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:16,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927221167] [2025-03-08 06:23:16,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:16,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:16,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 06:23:16,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 06:23:16,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:16,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:16,731 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-08 06:23:16,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:16,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927221167] [2025-03-08 06:23:16,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927221167] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:23:16,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561030579] [2025-03-08 06:23:16,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:16,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:23:16,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:23:16,733 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-08 06:23:16,735 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-08 06:23:16,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 06:23:16,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 06:23:16,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:16,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:16,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 06:23:16,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:23:17,433 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-08 06:23:17,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:23:18,245 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-08 06:23:18,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561030579] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:23:18,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:23:18,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2025-03-08 06:23:18,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874987011] [2025-03-08 06:23:18,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:23:18,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 06:23:18,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:18,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 06:23:18,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2025-03-08 06:23:18,246 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-08 06:23:19,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:19,538 INFO L93 Difference]: Finished difference Result 292353 states and 375128 transitions. [2025-03-08 06:23:19,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 06:23:19,538 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-08 06:23:19,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:19,803 INFO L225 Difference]: With dead ends: 292353 [2025-03-08 06:23:19,803 INFO L226 Difference]: Without dead ends: 208246 [2025-03-08 06:23:19,872 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-08 06:23:19,875 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-08 06:23:19,875 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-08 06:23:19,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208246 states. [2025-03-08 06:23:21,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208246 to 179556. [2025-03-08 06:23:21,624 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-08 06:23:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179556 states to 179556 states and 230043 transitions. [2025-03-08 06:23:21,821 INFO L78 Accepts]: Start accepts. Automaton has 179556 states and 230043 transitions. Word has length 105 [2025-03-08 06:23:21,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:21,821 INFO L471 AbstractCegarLoop]: Abstraction has 179556 states and 230043 transitions. [2025-03-08 06:23:21,821 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-08 06:23:21,822 INFO L276 IsEmpty]: Start isEmpty. Operand 179556 states and 230043 transitions. [2025-03-08 06:23:21,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 06:23:21,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:21,824 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-08 06:23:21,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 06:23:22,025 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-08 06:23:22,025 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-08 06:23:22,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:22,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1618148148, now seen corresponding path program 1 times [2025-03-08 06:23:22,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:22,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067085624] [2025-03-08 06:23:22,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:22,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:22,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 06:23:22,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 06:23:22,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:22,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:22,080 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-08 06:23:22,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:22,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067085624] [2025-03-08 06:23:22,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067085624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:22,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:22,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:23:22,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616509146] [2025-03-08 06:23:22,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:22,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:23:22,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:22,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:23:22,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:23:22,081 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-08 06:23:22,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:22,889 INFO L93 Difference]: Finished difference Result 289914 states and 371439 transitions. [2025-03-08 06:23:22,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:23:22,890 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-08 06:23:22,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:23,011 INFO L225 Difference]: With dead ends: 289914 [2025-03-08 06:23:23,011 INFO L226 Difference]: Without dead ends: 110483 [2025-03-08 06:23:23,074 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-08 06:23:23,074 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-08 06:23:23,075 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-08 06:23:23,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110483 states. [2025-03-08 06:23:24,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110483 to 101936. [2025-03-08 06:23:24,132 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-08 06:23:24,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101936 states to 101936 states and 129523 transitions. [2025-03-08 06:23:24,491 INFO L78 Accepts]: Start accepts. Automaton has 101936 states and 129523 transitions. Word has length 106 [2025-03-08 06:23:24,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:24,491 INFO L471 AbstractCegarLoop]: Abstraction has 101936 states and 129523 transitions. [2025-03-08 06:23:24,492 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-08 06:23:24,492 INFO L276 IsEmpty]: Start isEmpty. Operand 101936 states and 129523 transitions. [2025-03-08 06:23:24,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 06:23:24,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:24,493 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-08 06:23:24,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 06:23:24,493 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-08 06:23:24,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:24,493 INFO L85 PathProgramCache]: Analyzing trace with hash -649949132, now seen corresponding path program 1 times [2025-03-08 06:23:24,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:24,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949264189] [2025-03-08 06:23:24,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:24,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:24,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 06:23:24,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 06:23:24,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:24,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:24,931 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-08 06:23:24,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:24,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949264189] [2025-03-08 06:23:24,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949264189] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:23:24,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785518999] [2025-03-08 06:23:24,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:24,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:23:24,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:23:24,934 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-08 06:23:24,934 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-08 06:23:25,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 06:23:25,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 06:23:25,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:25,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:25,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 06:23:25,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:23:25,711 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-08 06:23:25,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:23:26,219 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-08 06:23:26,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785518999] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:23:26,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:23:26,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 11] total 37 [2025-03-08 06:23:26,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617361517] [2025-03-08 06:23:26,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:23:26,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-08 06:23:26,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:26,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-08 06:23:26,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1232, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 06:23:26,220 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)