./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash afa96f494675daaffb7cf8ecfbe30f06e1bb06b9219ecf3df6181ac4e4f076f6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:06:51,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:06:51,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:06:51,792 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:06:51,792 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:06:51,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:06:51,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:06:51,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:06:51,809 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:06:51,809 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:06:51,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:06:51,810 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:06:51,810 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:06:51,810 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:06:51,810 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:06:51,810 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:06:51,810 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:06:51,810 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:06:51,810 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:06:51,810 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:06:51,810 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:06:51,810 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:06:51,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:06:51,810 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:06:51,810 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:06:51,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:06:51,810 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:06:51,811 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:06:51,811 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:06:51,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:06:51,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:06:51,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:06:51,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:06:51,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:06:51,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:06:51,811 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:06:51,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:06:51,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:06:51,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:06:51,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:06:51,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:06:51,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:06:51,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:06:51,811 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 -> afa96f494675daaffb7cf8ecfbe30f06e1bb06b9219ecf3df6181ac4e4f076f6 [2025-03-03 15:06:52,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:06:52,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:06:52,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:06:52,049 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:06:52,050 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:06:52,050 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-03-03 15:06:53,177 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2251cc35/2377a8ce3eb34b1bac885e9d99b33a05/FLAG4df0343a1 [2025-03-03 15:06:53,641 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:06:53,642 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-03-03 15:06:53,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2251cc35/2377a8ce3eb34b1bac885e9d99b33a05/FLAG4df0343a1 [2025-03-03 15:06:53,686 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2251cc35/2377a8ce3eb34b1bac885e9d99b33a05 [2025-03-03 15:06:53,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:06:53,690 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:06:53,691 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:06:53,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:06:53,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:06:53,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:06:53" (1/1) ... [2025-03-03 15:06:53,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@506781f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:53, skipping insertion in model container [2025-03-03 15:06:53,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:06:53" (1/1) ... [2025-03-03 15:06:53,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:06:54,013 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[12460,12473] [2025-03-03 15:06:54,041 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[19746,19759] [2025-03-03 15:06:54,054 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[22098,22111] [2025-03-03 15:06:54,058 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23218,23231] [2025-03-03 15:06:54,079 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[26768,26781] [2025-03-03 15:06:54,082 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[27891,27904] [2025-03-03 15:06:54,093 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[30206,30219] [2025-03-03 15:06:54,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:06:54,372 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:06:54,414 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[12460,12473] [2025-03-03 15:06:54,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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[19746,19759] [2025-03-03 15:06:54,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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[22098,22111] [2025-03-03 15:06:54,435 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23218,23231] [2025-03-03 15:06:54,440 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[26768,26781] [2025-03-03 15:06:54,442 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[27891,27904] [2025-03-03 15:06:54,445 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[30206,30219] [2025-03-03 15:06:54,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:06:54,609 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:06:54,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:54 WrapperNode [2025-03-03 15:06:54,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:06:54,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:06:54,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:06:54,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:06:54,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:54" (1/1) ... [2025-03-03 15:06:54,645 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:54" (1/1) ... [2025-03-03 15:06:54,785 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 7679 [2025-03-03 15:06:54,786 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:06:54,787 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:06:54,787 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:06:54,787 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:06:54,794 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:54" (1/1) ... [2025-03-03 15:06:54,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:54" (1/1) ... [2025-03-03 15:06:54,815 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:54" (1/1) ... [2025-03-03 15:06:54,867 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:06:54,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:54" (1/1) ... [2025-03-03 15:06:54,867 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:54" (1/1) ... [2025-03-03 15:06:54,910 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:54" (1/1) ... [2025-03-03 15:06:54,920 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:54" (1/1) ... [2025-03-03 15:06:54,933 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:54" (1/1) ... [2025-03-03 15:06:54,949 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:54" (1/1) ... [2025-03-03 15:06:54,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:06:54,971 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:06:54,972 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:06:54,972 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:06:54,972 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:54" (1/1) ... [2025-03-03 15:06:54,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:06:54,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:06:54,997 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:06:55,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:06:55,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:06:55,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:06:55,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:06:55,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:06:55,274 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:06:55,275 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:06:57,815 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8955: havoc main_~main____CPAchecker_TMP_0~106#1;havoc main_~__tmp_113~0#1, main_~assert__arg~112#1;havoc main_~check__tmp~116#1; [2025-03-03 15:06:57,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L367: havoc main_~node3__m3~0#1; [2025-03-03 15:06:57,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8295: havoc main_~main____CPAchecker_TMP_0~97#1;havoc main_~__tmp_104~0#1, main_~assert__arg~103#1;havoc main_~check__tmp~107#1; [2025-03-03 15:06:57,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4464: havoc main_~main____CPAchecker_TMP_0~39#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~49#1; [2025-03-03 15:06:57,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4069: havoc main_~node4__m4~16#1; [2025-03-03 15:06:57,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5919: havoc main_~main____CPAchecker_TMP_0~61#1;havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~71#1; [2025-03-03 15:06:57,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11072: havoc main_~main____CPAchecker_TMP_0~138#1;havoc main_~__tmp_145~0#1, main_~assert__arg~144#1;havoc main_~check__tmp~148#1; [2025-03-03 15:06:57,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9751: havoc main_~main____CPAchecker_TMP_0~118#1;havoc main_~__tmp_125~0#1, main_~assert__arg~124#1;havoc main_~check__tmp~128#1; [2025-03-03 15:06:57,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3277: havoc main_~node3__m3~6#1; [2025-03-03 15:06:57,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7109: havoc main_~main____CPAchecker_TMP_0~79#1;havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~89#1; [2025-03-03 15:06:57,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6317: havoc main_~main____CPAchecker_TMP_0~67#1;havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~77#1; [2025-03-03 15:06:57,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8036: havoc main_~main____CPAchecker_TMP_0~93#1;havoc main_~__tmp_100~0#1, main_~assert__arg~99#1;havoc main_~check__tmp~103#1; [2025-03-03 15:06:57,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6715: havoc main_~main____CPAchecker_TMP_0~73#1;havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~83#1; [2025-03-03 15:06:57,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1298: havoc main_~node3__m3~3#1; [2025-03-03 15:06:57,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8434: havoc main_~main____CPAchecker_TMP_0~99#1;havoc main_~__tmp_106~0#1, main_~assert__arg~105#1;havoc main_~check__tmp~109#1; [2025-03-03 15:06:57,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3810: havoc main_~node4__m4~15#1;havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-03-03 15:06:57,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3018: havoc main_~node4__m4~12#1; [2025-03-03 15:06:57,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6850: havoc main_~main____CPAchecker_TMP_0~75#1;havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~85#1; [2025-03-03 15:06:57,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8700: havoc main_~main____CPAchecker_TMP_0~102#1;havoc main_~__tmp_109~0#1, main_~assert__arg~108#1;havoc main_~check__tmp~112#1; [2025-03-03 15:06:57,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6058: havoc main_~main____CPAchecker_TMP_0~63#1;havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~73#1; [2025-03-03 15:06:57,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L377: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:06:57,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5135: havoc main_~node4__m4~20#1; [2025-03-03 15:06:57,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5664: havoc main_~main____CPAchecker_TMP_0~57#1;havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~67#1; [2025-03-03 15:06:57,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10817: havoc main_~main____CPAchecker_TMP_0~134#1;havoc main_~__tmp_141~0#1, main_~assert__arg~140#1;havoc main_~check__tmp~144#1; [2025-03-03 15:06:57,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4343: havoc main_~node3__m3~7#1;havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-03 15:06:57,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8175: havoc main_~main____CPAchecker_TMP_0~95#1;havoc main_~__tmp_102~0#1, main_~assert__arg~101#1;havoc main_~check__tmp~105#1; [2025-03-03 15:06:57,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4079: havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-03-03 15:06:57,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3551: havoc main_~node4__m4~14#1; [2025-03-03 15:06:57,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3287: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-03 15:06:57,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2759: havoc main_~node4__m4~11#1;havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-03 15:06:57,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5799: havoc main_~main____CPAchecker_TMP_0~59#1;havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~69#1; [2025-03-03 15:06:57,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7781: havoc main_~main____CPAchecker_TMP_0~89#1;havoc main_~__tmp_96~0#1, main_~assert__arg~95#1;havoc main_~check__tmp~99#1; [2025-03-03 15:06:57,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5403: havoc main_~node2__m2~4#1; [2025-03-03 15:06:57,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4876: havoc main_~node4__m4~19#1;havoc main_~node3____CPAchecker_TMP_1~3#1; [2025-03-03 15:06:57,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1970: havoc main_~node3__m3~5#1; [2025-03-03 15:06:57,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3820: havoc main_~node4____CPAchecker_TMP_0~7#1; [2025-03-03 15:06:57,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7916: havoc main_~main____CPAchecker_TMP_0~91#1;havoc main_~__tmp_98~0#1, main_~assert__arg~97#1;havoc main_~check__tmp~101#1; [2025-03-03 15:06:57,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6595: havoc main_~main____CPAchecker_TMP_0~71#1;havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~81#1; [2025-03-03 15:06:57,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3028: havoc main_~node4____CPAchecker_TMP_0~4#1; [2025-03-03 15:06:57,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2500: havoc main_~node4__m4~10#1; [2025-03-03 15:06:57,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L386: havoc main_~node4__m4~0#1; [2025-03-03 15:06:57,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1179: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-03 15:06:57,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L915: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-03 15:06:57,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5145: havoc main_~node4____CPAchecker_TMP_0~12#1; [2025-03-03 15:06:57,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L653: havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-03 15:06:57,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4617: havoc main_~node4__m4~18#1; [2025-03-03 15:06:57,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3296: havoc main_~node4__m4~13#1; [2025-03-03 15:06:57,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4353: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-03 15:06:57,818 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3561: havoc main_~node4____CPAchecker_TMP_0~6#1; [2025-03-03 15:06:57,818 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1315: havoc main_~node4__m4~4#1; [2025-03-03 15:06:57,818 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2769: havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-03-03 15:06:57,818 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5544: havoc main_~main____CPAchecker_TMP_0~55#1;havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~65#1; [2025-03-03 15:06:57,818 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5413: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-03 15:06:57,818 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1846: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-03-03 15:06:57,818 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4886: havoc main_~node4____CPAchecker_TMP_0~11#1; [2025-03-03 15:06:57,818 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10700: havoc main_~main____CPAchecker_TMP_0~133#1;havoc main_~__tmp_140~0#1, main_~assert__arg~139#1;havoc main_~check__tmp~143#1; [2025-03-03 15:06:57,818 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7661: havoc main_~main____CPAchecker_TMP_0~87#1;havoc main_~__tmp_94~0#1, main_~assert__arg~93#1;havoc main_~check__tmp~97#1; [2025-03-03 15:06:57,818 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1716: havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-03-03 15:06:57,818 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7266: havoc main_~node4__m4~28#1; [2025-03-03 15:06:57,818 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2510: havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-03-03 15:06:57,818 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1453: havoc main_~node4__m4~5#1; [2025-03-03 15:06:57,818 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6474: havoc main_~node3__m3~9#1; [2025-03-03 15:06:57,818 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L396: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-03 15:06:57,818 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4362: havoc main_~node4__m4~17#1; [2025-03-03 15:06:57,818 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4627: havoc main_~node4____CPAchecker_TMP_0~10#1; [2025-03-03 15:06:57,818 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3306: havoc main_~node4____CPAchecker_TMP_0~5#1; [2025-03-03 15:06:57,818 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4231: havoc main_~main____CPAchecker_TMP_0~36#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~46#1;havoc main_~node4____CPAchecker_TMP_1~8#1; [2025-03-03 15:06:57,818 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10441: havoc main_~main____CPAchecker_TMP_0~129#1;havoc main_~__tmp_136~0#1, main_~assert__arg~135#1;havoc main_~check__tmp~139#1; [2025-03-03 15:06:57,818 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9649: havoc main_~main____CPAchecker_TMP_0~117#1;havoc main_~__tmp_124~0#1, main_~assert__arg~123#1;havoc main_~check__tmp~127#1; [2025-03-03 15:06:57,818 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7007: havoc main_~node4__m4~27#1;havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-03-03 15:06:57,819 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6215: havoc main_~node4__m4~24#1; [2025-03-03 15:06:57,819 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1987: havoc main_~node4__m4~8#1; [2025-03-03 15:06:57,819 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5423: havoc main_~node3__m3~8#1; [2025-03-03 15:06:57,819 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11766: havoc main_~main____CPAchecker_TMP_0~149#1;havoc main_~__tmp_156~0#1, main_~assert__arg~155#1;havoc main_~check__tmp~159#1; [2025-03-03 15:06:57,820 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8332: havoc main_~node4__m4~32#1; [2025-03-03 15:06:57,820 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3972: havoc main_~main____CPAchecker_TMP_0~32#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~42#1;havoc main_~node4____CPAchecker_TMP_1~7#1; [2025-03-03 15:06:57,820 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10182: havoc main_~main____CPAchecker_TMP_0~125#1;havoc main_~__tmp_132~0#1, main_~assert__arg~131#1;havoc main_~check__tmp~135#1; [2025-03-03 15:06:57,820 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L801: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:06:57,820 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7540: havoc main_~node3__m3~10#1;havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-03-03 15:06:57,821 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3180: havoc main_~main____CPAchecker_TMP_0~20#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~30#1;havoc main_~node4____CPAchecker_TMP_1~4#1; [2025-03-03 15:06:57,821 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7276: havoc main_~node4____CPAchecker_TMP_0~20#1; [2025-03-03 15:06:57,821 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9390: havoc main_~main____CPAchecker_TMP_0~113#1;havoc main_~__tmp_120~0#1, main_~assert__arg~119#1;havoc main_~check__tmp~123#1; [2025-03-03 15:06:57,821 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6748: havoc main_~node4__m4~26#1; [2025-03-03 15:06:57,821 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10580: havoc main_~main____CPAchecker_TMP_0~131#1;havoc main_~__tmp_138~0#1, main_~assert__arg~137#1;havoc main_~check__tmp~141#1; [2025-03-03 15:06:57,821 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6484: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-03-03 15:06:57,821 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5956: havoc main_~node4__m4~23#1;havoc main_~node3____CPAchecker_TMP_1~4#1; [2025-03-03 15:06:57,821 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11507: havoc main_~main____CPAchecker_TMP_0~145#1;havoc main_~__tmp_152~0#1, main_~assert__arg~151#1;havoc main_~check__tmp~155#1; [2025-03-03 15:06:57,821 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4372: havoc main_~node4____CPAchecker_TMP_0~9#1; [2025-03-03 15:06:57,821 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5297: havoc main_~main____CPAchecker_TMP_0~52#1;havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~62#1;havoc main_~node4____CPAchecker_TMP_1~12#1; [2025-03-03 15:06:57,821 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8073: havoc main_~node4__m4~31#1;havoc main_~node3____CPAchecker_TMP_1~6#1; [2025-03-03 15:06:57,821 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3713: havoc main_~main____CPAchecker_TMP_0~28#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~38#1;havoc main_~node4____CPAchecker_TMP_1~6#1; [2025-03-03 15:06:57,822 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9131: havoc main_~main____CPAchecker_TMP_0~109#1;havoc main_~__tmp_116~0#1, main_~assert__arg~115#1;havoc main_~check__tmp~119#1; [2025-03-03 15:06:57,822 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2921: havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~26#1;havoc main_~node4____CPAchecker_TMP_1~3#1; [2025-03-03 15:06:57,822 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7017: havoc main_~node4____CPAchecker_TMP_0~19#1; [2025-03-03 15:06:57,822 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6225: havoc main_~node4____CPAchecker_TMP_0~16#1; [2025-03-03 15:06:57,822 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10321: havoc main_~main____CPAchecker_TMP_0~127#1;havoc main_~__tmp_134~0#1, main_~assert__arg~133#1;havoc main_~check__tmp~137#1; [2025-03-03 15:06:57,822 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L544: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-03 15:06:57,822 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5697: havoc main_~node4__m4~22#1; [2025-03-03 15:06:57,822 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5433: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-03 15:06:57,822 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9529: havoc main_~main____CPAchecker_TMP_0~115#1;havoc main_~__tmp_122~0#1, main_~assert__arg~121#1;havoc main_~check__tmp~125#1; [2025-03-03 15:06:57,822 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5038: havoc main_~main____CPAchecker_TMP_0~48#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~58#1;havoc main_~node4____CPAchecker_TMP_1~11#1; [2025-03-03 15:06:57,822 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11248: havoc main_~main____CPAchecker_TMP_0~141#1;havoc main_~__tmp_148~0#1, main_~assert__arg~147#1;havoc main_~check__tmp~151#1; [2025-03-03 15:06:57,822 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9927: havoc main_~main____CPAchecker_TMP_0~121#1;havoc main_~__tmp_128~0#1, main_~assert__arg~127#1;havoc main_~check__tmp~131#1; [2025-03-03 15:06:57,822 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8342: havoc main_~node4____CPAchecker_TMP_0~24#1; [2025-03-03 15:06:57,822 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7814: havoc main_~node4__m4~30#1; [2025-03-03 15:06:57,822 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7550: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-03-03 15:06:57,822 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11646: havoc main_~main____CPAchecker_TMP_0~147#1;havoc main_~__tmp_154~0#1, main_~assert__arg~153#1;havoc main_~check__tmp~157#1; [2025-03-03 15:06:57,822 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6493: havoc main_~node4__m4~25#1; [2025-03-03 15:06:57,822 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4115: havoc main_~main____CPAchecker_TMP_0~34#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~44#1; [2025-03-03 15:06:57,823 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6758: havoc main_~node4____CPAchecker_TMP_0~18#1; [2025-03-03 15:06:57,823 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2662: havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1;havoc main_~node4____CPAchecker_TMP_1~2#1; [2025-03-03 15:06:57,823 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5966: havoc main_~node4____CPAchecker_TMP_0~15#1; [2025-03-03 15:06:57,823 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10062: havoc main_~main____CPAchecker_TMP_0~123#1;havoc main_~__tmp_130~0#1, main_~assert__arg~129#1;havoc main_~check__tmp~133#1; [2025-03-03 15:06:57,823 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9270: havoc main_~main____CPAchecker_TMP_0~111#1;havoc main_~__tmp_118~0#1, main_~assert__arg~117#1;havoc main_~check__tmp~121#1; [2025-03-03 15:06:57,823 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4779: havoc main_~main____CPAchecker_TMP_0~44#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~54#1;havoc main_~node4____CPAchecker_TMP_1~10#1; [2025-03-03 15:06:57,823 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3458: havoc main_~main____CPAchecker_TMP_0~24#1;havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~34#1;havoc main_~node4____CPAchecker_TMP_1~5#1; [2025-03-03 15:06:57,823 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8083: havoc main_~node4____CPAchecker_TMP_0~23#1; [2025-03-03 15:06:57,823 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8876: havoc main_~main____CPAchecker_TMP_0~105#1;havoc main_~__tmp_112~0#1, main_~assert__arg~111#1;havoc main_~check__tmp~115#1; [2025-03-03 15:06:57,823 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11387: havoc main_~main____CPAchecker_TMP_0~143#1;havoc main_~__tmp_150~0#1, main_~assert__arg~149#1;havoc main_~check__tmp~153#1; [2025-03-03 15:06:57,823 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3856: havoc main_~main____CPAchecker_TMP_0~30#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~40#1; [2025-03-03 15:06:57,823 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5442: havoc main_~node4__m4~21#1; [2025-03-03 15:06:57,823 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3064: havoc main_~main____CPAchecker_TMP_0~18#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~28#1; [2025-03-03 15:06:57,823 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5707: havoc main_~node4____CPAchecker_TMP_0~14#1; [2025-03-03 15:06:57,823 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9011: havoc main_~main____CPAchecker_TMP_0~107#1;havoc main_~__tmp_114~0#1, main_~assert__arg~113#1;havoc main_~check__tmp~117#1; [2025-03-03 15:06:57,823 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10993: havoc main_~main____CPAchecker_TMP_0~137#1;havoc main_~__tmp_144~0#1, main_~assert__arg~143#1;havoc main_~check__tmp~147#1; [2025-03-03 15:06:57,823 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8615: havoc main_~node2__m2~5#1;havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-03-03 15:06:57,823 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7559: havoc main_~node4__m4~29#1; [2025-03-03 15:06:57,823 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1085: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-03 15:06:57,823 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5181: havoc main_~main____CPAchecker_TMP_0~50#1;havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~60#1; [2025-03-03 15:06:57,823 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7824: havoc main_~node4____CPAchecker_TMP_0~22#1; [2025-03-03 15:06:57,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6503: havoc main_~node4____CPAchecker_TMP_0~17#1; [2025-03-03 15:06:57,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2407: havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1;havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-03 15:06:57,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7428: havoc main_~main____CPAchecker_TMP_0~84#1;havoc main_~__tmp_91~0#1, main_~assert__arg~90#1;havoc main_~check__tmp~94#1;havoc main_~node4____CPAchecker_TMP_1~20#1; [2025-03-03 15:06:57,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1879: havoc main_~check__tmp~13#1; [2025-03-03 15:06:57,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11128: havoc main_~main____CPAchecker_TMP_0~139#1;havoc main_~__tmp_146~0#1, main_~assert__arg~145#1;havoc main_~check__tmp~149#1; [2025-03-03 15:06:57,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3597: havoc main_~main____CPAchecker_TMP_0~26#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~36#1; [2025-03-03 15:06:57,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9807: havoc main_~main____CPAchecker_TMP_0~119#1;havoc main_~__tmp_126~0#1, main_~assert__arg~125#1;havoc main_~check__tmp~129#1; [2025-03-03 15:06:57,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2805: havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~24#1; [2025-03-03 15:06:57,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4524: havoc main_~main____CPAchecker_TMP_0~40#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~50#1;havoc main_~node4____CPAchecker_TMP_1~9#1; [2025-03-03 15:06:57,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4922: havoc main_~main____CPAchecker_TMP_0~46#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~56#1; [2025-03-03 15:06:57,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1223: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-03 15:06:57,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7169: havoc main_~main____CPAchecker_TMP_0~80#1;havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~90#1;havoc main_~node4____CPAchecker_TMP_1~19#1; [2025-03-03 15:06:57,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L563: havoc main_~node2__m2~2#1; [2025-03-03 15:06:57,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5452: havoc main_~node4____CPAchecker_TMP_0~13#1; [2025-03-03 15:06:57,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6377: havoc main_~main____CPAchecker_TMP_0~68#1;havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~78#1;havoc main_~node4____CPAchecker_TMP_1~16#1; [2025-03-03 15:06:57,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8756: havoc main_~main____CPAchecker_TMP_0~103#1;havoc main_~__tmp_110~0#1, main_~assert__arg~109#1;havoc main_~check__tmp~113#1; [2025-03-03 15:06:57,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2546: havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1; [2025-03-03 15:06:57,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1489: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-03 15:06:57,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L829: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-03 15:06:57,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8625: havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-03-03 15:06:57,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1359: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-03 15:06:57,825 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7569: havoc main_~node4____CPAchecker_TMP_0~21#1; [2025-03-03 15:06:57,825 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8494: havoc main_~main____CPAchecker_TMP_0~100#1;havoc main_~__tmp_107~0#1, main_~assert__arg~106#1;havoc main_~check__tmp~110#1;havoc main_~node4____CPAchecker_TMP_1~24#1; [2025-03-03 15:06:57,825 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4663: havoc main_~main____CPAchecker_TMP_0~42#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~52#1; [2025-03-03 15:06:57,826 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10873: havoc main_~main____CPAchecker_TMP_0~135#1;havoc main_~__tmp_142~0#1, main_~assert__arg~141#1;havoc main_~check__tmp~145#1; [2025-03-03 15:06:57,826 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3342: havoc main_~main____CPAchecker_TMP_0~22#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~32#1; [2025-03-03 15:06:57,826 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6910: havoc main_~main____CPAchecker_TMP_0~76#1;havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~86#1;havoc main_~node4____CPAchecker_TMP_1~18#1; [2025-03-03 15:06:57,826 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10478: havoc main_~node4__m4~40#1; [2025-03-03 15:06:57,826 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6118: havoc main_~main____CPAchecker_TMP_0~64#1;havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~74#1;havoc main_~node4____CPAchecker_TMP_1~15#1; [2025-03-03 15:06:57,826 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9686: havoc main_~node3__m3~12#1; [2025-03-03 15:06:57,826 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2023: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2025-03-03 15:06:57,826 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1760: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-03-03 15:06:57,826 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8235: havoc main_~main____CPAchecker_TMP_0~96#1;havoc main_~__tmp_103~0#1, main_~assert__arg~102#1;havoc main_~check__tmp~106#1;havoc main_~node4____CPAchecker_TMP_1~23#1; [2025-03-03 15:06:57,826 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L440: havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-03 15:06:57,826 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7312: havoc main_~main____CPAchecker_TMP_0~82#1;havoc main_~__tmp_89~0#1, main_~assert__arg~88#1;havoc main_~check__tmp~92#1; [2025-03-03 15:06:57,826 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10219: havoc main_~node4__m4~39#1;havoc main_~node3____CPAchecker_TMP_1~8#1; [2025-03-03 15:06:57,826 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5859: havoc main_~main____CPAchecker_TMP_0~60#1;havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~70#1;havoc main_~node4____CPAchecker_TMP_1~14#1; [2025-03-03 15:06:57,826 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9427: havoc main_~node4__m4~36#1; [2025-03-03 15:06:57,826 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8635: havoc main_~node3__m3~11#1; [2025-03-03 15:06:57,827 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4408: havoc main_~main____CPAchecker_TMP_0~38#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~48#1; [2025-03-03 15:06:57,827 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7976: havoc main_~main____CPAchecker_TMP_0~92#1;havoc main_~__tmp_99~0#1, main_~assert__arg~98#1;havoc main_~check__tmp~102#1;havoc main_~node4____CPAchecker_TMP_1~22#1; [2025-03-03 15:06:57,827 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6655: havoc main_~main____CPAchecker_TMP_0~72#1;havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~82#1;havoc main_~node4____CPAchecker_TMP_1~17#1; [2025-03-03 15:06:57,827 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11544: havoc main_~node4__m4~44#1; [2025-03-03 15:06:57,827 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L974: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:06:57,827 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10752: havoc main_~node3__m3~13#1;havoc main_~node2____CPAchecker_TMP_1~3#1; [2025-03-03 15:06:57,827 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10488: havoc main_~node4____CPAchecker_TMP_0~32#1; [2025-03-03 15:06:57,827 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7053: havoc main_~main____CPAchecker_TMP_0~78#1;havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~88#1; [2025-03-03 15:06:57,827 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9960: havoc main_~node4__m4~38#1; [2025-03-03 15:06:57,827 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9696: havoc main_~node3____CPAchecker_TMP_0~8#1; [2025-03-03 15:06:57,827 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6261: havoc main_~main____CPAchecker_TMP_0~66#1;havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~76#1; [2025-03-03 15:06:57,827 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9168: havoc main_~node4__m4~35#1;havoc main_~node3____CPAchecker_TMP_1~7#1; [2025-03-03 15:06:57,827 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1638: havoc main_~node2__m2~3#1; [2025-03-03 15:06:57,827 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L581: havoc main_~node3__m3~2#1; [2025-03-03 15:06:57,827 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8378: havoc main_~main____CPAchecker_TMP_0~98#1;havoc main_~__tmp_105~0#1, main_~assert__arg~104#1;havoc main_~check__tmp~108#1; [2025-03-03 15:06:57,827 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11285: havoc main_~node4__m4~43#1;havoc main_~node3____CPAchecker_TMP_1~9#1; [2025-03-03 15:06:57,827 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L715: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-03 15:06:57,827 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5604: havoc main_~main____CPAchecker_TMP_0~56#1;havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~66#1;havoc main_~node4____CPAchecker_TMP_1~13#1; [2025-03-03 15:06:57,827 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10229: havoc main_~node4____CPAchecker_TMP_0~31#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6794: havoc main_~main____CPAchecker_TMP_0~74#1;havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~84#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9437: havoc main_~node4____CPAchecker_TMP_0~28#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6002: havoc main_~main____CPAchecker_TMP_0~62#1;havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~72#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8909: havoc main_~node4__m4~34#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8645: havoc main_~node3____CPAchecker_TMP_0~7#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7721: havoc main_~main____CPAchecker_TMP_0~88#1;havoc main_~__tmp_95~0#1, main_~assert__arg~94#1;havoc main_~check__tmp~98#1;havoc main_~node4____CPAchecker_TMP_1~21#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11554: havoc main_~node4____CPAchecker_TMP_0~36#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8119: havoc main_~main____CPAchecker_TMP_0~94#1;havoc main_~__tmp_101~0#1, main_~assert__arg~100#1;havoc main_~check__tmp~104#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11026: havoc main_~node4__m4~42#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10762: havoc main_~node3____CPAchecker_TMP_0~9#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9705: havoc main_~node4__m4~37#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2174: havoc main_~check__tmp~16#1;havoc main_~node4__m4~9#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9970: havoc main_~node4____CPAchecker_TMP_0~30#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9178: havoc main_~node4____CPAchecker_TMP_0~27#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5743: havoc main_~main____CPAchecker_TMP_0~58#1;havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~68#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L458: havoc main_~node2__m2~1#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L327: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4291: havoc main_~main____CPAchecker_TMP_0~37#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~47#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11295: havoc main_~node4____CPAchecker_TMP_0~35#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7860: havoc main_~main____CPAchecker_TMP_0~90#1;havoc main_~__tmp_97~0#1, main_~assert__arg~96#1;havoc main_~check__tmp~100#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6539: havoc main_~main____CPAchecker_TMP_0~70#1;havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~80#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8654: havoc main_~node4__m4~33#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8919: havoc main_~node4____CPAchecker_TMP_0~26#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4032: havoc main_~main____CPAchecker_TMP_0~33#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~43#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10771: havoc main_~node4__m4~41#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1522: havoc main_~check__tmp~9#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3240: havoc main_~main____CPAchecker_TMP_0~21#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~31#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11036: havoc main_~node4____CPAchecker_TMP_0~34#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1655: havoc main_~node3__m3~4#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9715: havoc main_~node4____CPAchecker_TMP_0~29#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10640: havoc main_~main____CPAchecker_TMP_0~132#1;havoc main_~__tmp_139~0#1, main_~assert__arg~138#1;havoc main_~check__tmp~142#1;havoc main_~node4____CPAchecker_TMP_1~32#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L599: havoc main_~node4__m4~2#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5488: havoc main_~main____CPAchecker_TMP_0~54#1;havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~64#1; [2025-03-03 15:06:57,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5357: havoc main_~main____CPAchecker_TMP_0~53#1;havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~63#1; [2025-03-03 15:06:57,829 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L337: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:06:57,829 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3773: havoc main_~main____CPAchecker_TMP_0~29#1;havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~39#1; [2025-03-03 15:06:57,829 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7605: havoc main_~main____CPAchecker_TMP_0~86#1;havoc main_~__tmp_93~0#1, main_~assert__arg~92#1;havoc main_~check__tmp~96#1; [2025-03-03 15:06:57,829 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2056: havoc main_~check__tmp~15#1; [2025-03-03 15:06:57,829 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2981: havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~27#1; [2025-03-03 15:06:57,829 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10381: havoc main_~main____CPAchecker_TMP_0~128#1;havoc main_~__tmp_135~0#1, main_~assert__arg~134#1;havoc main_~check__tmp~138#1;havoc main_~node4____CPAchecker_TMP_1~31#1; [2025-03-03 15:06:57,829 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4171: havoc main_~main____CPAchecker_TMP_0~35#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~45#1; [2025-03-03 15:06:57,830 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9589: havoc main_~main____CPAchecker_TMP_0~116#1;havoc main_~__tmp_123~0#1, main_~assert__arg~122#1;havoc main_~check__tmp~126#1;havoc main_~node4____CPAchecker_TMP_1~28#1; [2025-03-03 15:06:57,830 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8664: havoc main_~node4____CPAchecker_TMP_0~25#1; [2025-03-03 15:06:57,830 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5098: havoc main_~main____CPAchecker_TMP_0~49#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~59#1; [2025-03-03 15:06:57,830 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-03 15:06:57,830 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1135: havoc main_~node4__m4~3#1; [2025-03-03 15:06:57,830 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10781: havoc main_~node4____CPAchecker_TMP_0~33#1; [2025-03-03 15:06:57,832 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11706: havoc main_~main____CPAchecker_TMP_0~148#1;havoc main_~__tmp_155~0#1, main_~assert__arg~154#1;havoc main_~check__tmp~158#1;havoc main_~node4____CPAchecker_TMP_1~36#1; [2025-03-03 15:06:57,832 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L475: havoc main_~node3__m3~1#1; [2025-03-03 15:06:57,832 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2722: havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~23#1; [2025-03-03 15:06:57,832 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10122: havoc main_~main____CPAchecker_TMP_0~124#1;havoc main_~__tmp_131~0#1, main_~assert__arg~130#1;havoc main_~check__tmp~134#1;havoc main_~node4____CPAchecker_TMP_1~30#1; [2025-03-03 15:06:57,832 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3912: havoc main_~main____CPAchecker_TMP_0~31#1;havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~41#1; [2025-03-03 15:06:57,832 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9330: havoc main_~main____CPAchecker_TMP_0~112#1;havoc main_~__tmp_119~0#1, main_~assert__arg~118#1;havoc main_~check__tmp~122#1;havoc main_~node4____CPAchecker_TMP_1~27#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3120: havoc main_~main____CPAchecker_TMP_0~19#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~29#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1403: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4839: havoc main_~main____CPAchecker_TMP_0~45#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~55#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L743: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3518: havoc main_~main____CPAchecker_TMP_0~25#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~35#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L347: havoc main_~node2__m2~0#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5237: havoc main_~main____CPAchecker_TMP_0~51#1;havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~61#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11447: havoc main_~main____CPAchecker_TMP_0~144#1;havoc main_~__tmp_151~0#1, main_~assert__arg~150#1;havoc main_~check__tmp~154#1;havoc main_~node4____CPAchecker_TMP_1~35#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3653: havoc main_~main____CPAchecker_TMP_0~27#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~37#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10524: havoc main_~main____CPAchecker_TMP_0~130#1;havoc main_~__tmp_137~0#1, main_~assert__arg~136#1;havoc main_~check__tmp~140#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2861: havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~25#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9071: havoc main_~main____CPAchecker_TMP_0~108#1;havoc main_~__tmp_115~0#1, main_~assert__arg~114#1;havoc main_~check__tmp~118#1;havoc main_~node4____CPAchecker_TMP_1~26#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1672: havoc main_~node4__m4~6#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2467: havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7488: havoc main_~main____CPAchecker_TMP_0~85#1;havoc main_~__tmp_92~0#1, main_~assert__arg~91#1;havoc main_~check__tmp~95#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11188: havoc main_~main____CPAchecker_TMP_0~140#1;havoc main_~__tmp_147~0#1, main_~assert__arg~146#1;havoc main_~check__tmp~150#1;havoc main_~node4____CPAchecker_TMP_1~34#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4978: havoc main_~main____CPAchecker_TMP_0~47#1;havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~57#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9867: havoc main_~main____CPAchecker_TMP_0~120#1;havoc main_~__tmp_127~0#1, main_~assert__arg~126#1;havoc main_~check__tmp~130#1;havoc main_~node4____CPAchecker_TMP_1~29#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10265: havoc main_~main____CPAchecker_TMP_0~126#1;havoc main_~__tmp_133~0#1, main_~assert__arg~132#1;havoc main_~check__tmp~136#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2602: havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~21#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4584: havoc main_~main____CPAchecker_TMP_0~41#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~51#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9473: havoc main_~main____CPAchecker_TMP_0~114#1;havoc main_~__tmp_121~0#1, main_~assert__arg~120#1;havoc main_~check__tmp~124#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1810: havoc main_~node4__m4~7#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L357: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7229: havoc main_~main____CPAchecker_TMP_0~81#1;havoc main_~__tmp_88~0#1, main_~assert__arg~87#1;havoc main_~check__tmp~91#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L887: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4719: havoc main_~main____CPAchecker_TMP_0~43#1;havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~53#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3398: havoc main_~main____CPAchecker_TMP_0~23#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~33#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11590: havoc main_~main____CPAchecker_TMP_0~146#1;havoc main_~__tmp_153~0#1, main_~assert__arg~152#1;havoc main_~check__tmp~156#1; [2025-03-03 15:06:57,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6437: havoc main_~main____CPAchecker_TMP_0~69#1;havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~79#1; [2025-03-03 15:06:57,834 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L492: havoc main_~node4__m4~1#1; [2025-03-03 15:06:57,834 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8816: havoc main_~main____CPAchecker_TMP_0~104#1;havoc main_~__tmp_111~0#1, main_~assert__arg~110#1;havoc main_~check__tmp~114#1;havoc main_~node4____CPAchecker_TMP_1~25#1; [2025-03-03 15:06:57,834 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10006: havoc main_~main____CPAchecker_TMP_0~122#1;havoc main_~__tmp_129~0#1, main_~assert__arg~128#1;havoc main_~check__tmp~132#1; [2025-03-03 15:06:57,834 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9214: havoc main_~main____CPAchecker_TMP_0~110#1;havoc main_~__tmp_117~0#1, main_~assert__arg~116#1;havoc main_~check__tmp~120#1; [2025-03-03 15:06:57,834 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8554: havoc main_~main____CPAchecker_TMP_0~101#1;havoc main_~__tmp_108~0#1, main_~assert__arg~107#1;havoc main_~check__tmp~111#1; [2025-03-03 15:06:57,834 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10933: havoc main_~main____CPAchecker_TMP_0~136#1;havoc main_~__tmp_143~0#1, main_~assert__arg~142#1;havoc main_~check__tmp~146#1;havoc main_~node4____CPAchecker_TMP_1~33#1; [2025-03-03 15:06:57,834 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6970: havoc main_~main____CPAchecker_TMP_0~77#1;havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~87#1; [2025-03-03 15:06:57,834 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11331: havoc main_~main____CPAchecker_TMP_0~142#1;havoc main_~__tmp_149~0#1, main_~assert__arg~148#1;havoc main_~check__tmp~152#1; [2025-03-03 15:06:57,834 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6178: havoc main_~main____CPAchecker_TMP_0~65#1;havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~75#1; [2025-03-03 15:06:57,834 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2347: havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2025-03-03 15:06:57,834 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7368: havoc main_~main____CPAchecker_TMP_0~83#1;havoc main_~__tmp_90~0#1, main_~assert__arg~89#1;havoc main_~check__tmp~93#1; [2025-03-03 15:06:58,084 INFO L? ?]: Removed 1280 outVars from TransFormulas that were not future-live. [2025-03-03 15:06:58,084 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:06:58,117 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:06:58,121 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:06:58,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:06:58 BoogieIcfgContainer [2025-03-03 15:06:58,121 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:06:58,123 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:06:58,123 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:06:58,129 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:06:58,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:06:53" (1/3) ... [2025-03-03 15:06:58,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b0dbba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:06:58, skipping insertion in model container [2025-03-03 15:06:58,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:54" (2/3) ... [2025-03-03 15:06:58,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b0dbba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:06:58, skipping insertion in model container [2025-03-03 15:06:58,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:06:58" (3/3) ... [2025-03-03 15:06:58,131 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-03-03 15:06:58,143 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:06:58,146 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c that has 1 procedures, 1106 locations, 1 initial locations, 0 loop locations, and 7 error locations. [2025-03-03 15:06:58,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:06:58,231 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;@e9ef83b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:06:58,232 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-03 15:06:58,238 INFO L276 IsEmpty]: Start isEmpty. Operand has 1106 states, 1098 states have (on average 1.8852459016393444) internal successors, (2070), 1105 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:58,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:06:58,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:58,263 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] [2025-03-03 15:06:58,264 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:06:58,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:58,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1718258462, now seen corresponding path program 1 times [2025-03-03 15:06:58,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:58,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302935061] [2025-03-03 15:06:58,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:58,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:58,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:06:58,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:06:58,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:58,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:58,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:58,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:58,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302935061] [2025-03-03 15:06:58,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302935061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:58,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:58,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:58,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377519872] [2025-03-03 15:06:58,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:58,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:58,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:58,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:58,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:58,735 INFO L87 Difference]: Start difference. First operand has 1106 states, 1098 states have (on average 1.8852459016393444) internal successors, (2070), 1105 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:58,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:58,927 INFO L93 Difference]: Finished difference Result 1465 states and 2651 transitions. [2025-03-03 15:06:58,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:58,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-03 15:06:58,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:58,943 INFO L225 Difference]: With dead ends: 1465 [2025-03-03 15:06:58,943 INFO L226 Difference]: Without dead ends: 1288 [2025-03-03 15:06:58,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:58,950 INFO L435 NwaCegarLoop]: 2055 mSDtfsCounter, 969 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 3330 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:58,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 3330 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:06:58,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2025-03-03 15:06:59,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1280. [2025-03-03 15:06:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1273 states have (on average 1.3165750196386488) internal successors, (1676), 1279 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:59,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1676 transitions. [2025-03-03 15:06:59,021 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1676 transitions. Word has length 64 [2025-03-03 15:06:59,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:59,022 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1676 transitions. [2025-03-03 15:06:59,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:59,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1676 transitions. [2025-03-03 15:06:59,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:06:59,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:59,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:59,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:06:59,025 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:06:59,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:59,026 INFO L85 PathProgramCache]: Analyzing trace with hash -639613202, now seen corresponding path program 1 times [2025-03-03 15:06:59,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:59,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199741063] [2025-03-03 15:06:59,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:59,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:59,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:06:59,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:06:59,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:59,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:59,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:59,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:59,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199741063] [2025-03-03 15:06:59,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199741063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:59,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:59,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:06:59,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943745729] [2025-03-03 15:06:59,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:59,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:06:59,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:59,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:06:59,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:06:59,292 INFO L87 Difference]: Start difference. First operand 1280 states and 1676 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:59,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:59,800 INFO L93 Difference]: Finished difference Result 2264 states and 3058 transitions. [2025-03-03 15:06:59,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:06:59,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-03 15:06:59,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:59,805 INFO L225 Difference]: With dead ends: 2264 [2025-03-03 15:06:59,805 INFO L226 Difference]: Without dead ends: 1293 [2025-03-03 15:06:59,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:06:59,810 INFO L435 NwaCegarLoop]: 679 mSDtfsCounter, 3665 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3665 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:59,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3665 Valid, 835 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:06:59,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2025-03-03 15:06:59,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1285. [2025-03-03 15:06:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1278 states have (on average 1.3685446009389672) internal successors, (1749), 1284 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:59,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1749 transitions. [2025-03-03 15:06:59,841 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1749 transitions. Word has length 64 [2025-03-03 15:06:59,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:59,842 INFO L471 AbstractCegarLoop]: Abstraction has 1285 states and 1749 transitions. [2025-03-03 15:06:59,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:59,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1749 transitions. [2025-03-03 15:06:59,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:06:59,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:59,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:59,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:06:59,847 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:06:59,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:59,847 INFO L85 PathProgramCache]: Analyzing trace with hash 788624528, now seen corresponding path program 1 times [2025-03-03 15:06:59,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:59,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299771961] [2025-03-03 15:06:59,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:59,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:59,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:06:59,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:06:59,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:59,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:59,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:59,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:59,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299771961] [2025-03-03 15:06:59,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299771961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:59,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:59,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:59,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946316505] [2025-03-03 15:06:59,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:59,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:59,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:59,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:59,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:59,974 INFO L87 Difference]: Start difference. First operand 1285 states and 1749 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:00,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:00,011 INFO L93 Difference]: Finished difference Result 2777 states and 3883 transitions. [2025-03-03 15:07:00,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:00,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-03 15:07:00,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:00,020 INFO L225 Difference]: With dead ends: 2777 [2025-03-03 15:07:00,021 INFO L226 Difference]: Without dead ends: 2085 [2025-03-03 15:07:00,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:00,023 INFO L435 NwaCegarLoop]: 1422 mSDtfsCounter, 897 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 2140 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:00,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 2140 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:00,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2025-03-03 15:07:00,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 2075. [2025-03-03 15:07:00,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2075 states, 2068 states have (on average 1.375725338491296) internal successors, (2845), 2074 states have internal predecessors, (2845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:00,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 2845 transitions. [2025-03-03 15:07:00,064 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 2845 transitions. Word has length 65 [2025-03-03 15:07:00,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:00,065 INFO L471 AbstractCegarLoop]: Abstraction has 2075 states and 2845 transitions. [2025-03-03 15:07:00,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:00,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 2845 transitions. [2025-03-03 15:07:00,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:07:00,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:00,068 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] [2025-03-03 15:07:00,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:07:00,069 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:00,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:00,069 INFO L85 PathProgramCache]: Analyzing trace with hash 2019045977, now seen corresponding path program 1 times [2025-03-03 15:07:00,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:00,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787789447] [2025-03-03 15:07:00,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:00,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:00,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:07:00,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:07:00,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:00,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:00,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:00,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:00,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787789447] [2025-03-03 15:07:00,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787789447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:00,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:00,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:07:00,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724806462] [2025-03-03 15:07:00,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:00,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:07:00,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:00,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:07:00,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:07:00,270 INFO L87 Difference]: Start difference. First operand 2075 states and 2845 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:00,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:00,770 INFO L93 Difference]: Finished difference Result 3800 states and 5296 transitions. [2025-03-03 15:07:00,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:07:00,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-03 15:07:00,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:00,777 INFO L225 Difference]: With dead ends: 3800 [2025-03-03 15:07:00,777 INFO L226 Difference]: Without dead ends: 2330 [2025-03-03 15:07:00,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:07:00,780 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 3065 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3065 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:00,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3065 Valid, 696 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:07:00,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2025-03-03 15:07:00,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2318. [2025-03-03 15:07:00,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 2311 states have (on average 1.3682388576373865) internal successors, (3162), 2317 states have internal predecessors, (3162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:00,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 3162 transitions. [2025-03-03 15:07:00,824 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 3162 transitions. Word has length 65 [2025-03-03 15:07:00,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:00,824 INFO L471 AbstractCegarLoop]: Abstraction has 2318 states and 3162 transitions. [2025-03-03 15:07:00,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:00,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 3162 transitions. [2025-03-03 15:07:00,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:07:00,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:00,827 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] [2025-03-03 15:07:00,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:07:00,827 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:00,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:00,828 INFO L85 PathProgramCache]: Analyzing trace with hash -794782081, now seen corresponding path program 1 times [2025-03-03 15:07:00,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:00,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956536120] [2025-03-03 15:07:00,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:00,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:00,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:07:00,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:07:00,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:00,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:00,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:00,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:00,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956536120] [2025-03-03 15:07:00,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956536120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:00,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:00,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:07:00,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626692970] [2025-03-03 15:07:00,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:00,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:07:00,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:00,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:07:00,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:07:00,990 INFO L87 Difference]: Start difference. First operand 2318 states and 3162 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:01,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:01,347 INFO L93 Difference]: Finished difference Result 5294 states and 7441 transitions. [2025-03-03 15:07:01,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:07:01,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-03 15:07:01,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:01,357 INFO L225 Difference]: With dead ends: 5294 [2025-03-03 15:07:01,357 INFO L226 Difference]: Without dead ends: 3266 [2025-03-03 15:07:01,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:07:01,362 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 2726 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2726 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:01,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2726 Valid, 647 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:07:01,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2025-03-03 15:07:01,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3258. [2025-03-03 15:07:01,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3258 states, 3251 states have (on average 1.410335281451861) internal successors, (4585), 3257 states have internal predecessors, (4585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:01,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3258 states to 3258 states and 4585 transitions. [2025-03-03 15:07:01,420 INFO L78 Accepts]: Start accepts. Automaton has 3258 states and 4585 transitions. Word has length 65 [2025-03-03 15:07:01,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:01,420 INFO L471 AbstractCegarLoop]: Abstraction has 3258 states and 4585 transitions. [2025-03-03 15:07:01,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:01,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3258 states and 4585 transitions. [2025-03-03 15:07:01,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 15:07:01,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:01,423 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] [2025-03-03 15:07:01,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:07:01,423 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:01,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:01,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1212043705, now seen corresponding path program 1 times [2025-03-03 15:07:01,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:01,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660954754] [2025-03-03 15:07:01,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:01,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:01,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 15:07:01,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 15:07:01,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:01,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:01,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:01,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:01,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660954754] [2025-03-03 15:07:01,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660954754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:01,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:01,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:01,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668711500] [2025-03-03 15:07:01,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:01,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:01,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:01,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:01,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:01,533 INFO L87 Difference]: Start difference. First operand 3258 states and 4585 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:01,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:01,571 INFO L93 Difference]: Finished difference Result 6885 states and 9807 transitions. [2025-03-03 15:07:01,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:01,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-03-03 15:07:01,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:01,583 INFO L225 Difference]: With dead ends: 6885 [2025-03-03 15:07:01,584 INFO L226 Difference]: Without dead ends: 4527 [2025-03-03 15:07:01,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:01,587 INFO L435 NwaCegarLoop]: 964 mSDtfsCounter, 585 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 1532 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:01,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 1532 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:01,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4527 states. [2025-03-03 15:07:01,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4527 to 4507. [2025-03-03 15:07:01,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4507 states, 4500 states have (on average 1.3908888888888888) internal successors, (6259), 4506 states have internal predecessors, (6259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:01,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4507 states to 4507 states and 6259 transitions. [2025-03-03 15:07:01,665 INFO L78 Accepts]: Start accepts. Automaton has 4507 states and 6259 transitions. Word has length 66 [2025-03-03 15:07:01,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:01,665 INFO L471 AbstractCegarLoop]: Abstraction has 4507 states and 6259 transitions. [2025-03-03 15:07:01,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:01,665 INFO L276 IsEmpty]: Start isEmpty. Operand 4507 states and 6259 transitions. [2025-03-03 15:07:01,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:07:01,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:01,668 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] [2025-03-03 15:07:01,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:07:01,668 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:01,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:01,669 INFO L85 PathProgramCache]: Analyzing trace with hash 102780454, now seen corresponding path program 1 times [2025-03-03 15:07:01,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:01,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200688199] [2025-03-03 15:07:01,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:01,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:01,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:07:01,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:07:01,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:01,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:01,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:01,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:01,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200688199] [2025-03-03 15:07:01,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200688199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:01,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:01,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:07:01,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627404988] [2025-03-03 15:07:01,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:01,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:07:01,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:01,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:07:01,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:07:01,815 INFO L87 Difference]: Start difference. First operand 4507 states and 6259 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:02,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:02,151 INFO L93 Difference]: Finished difference Result 11292 states and 15947 transitions. [2025-03-03 15:07:02,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:07:02,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-03-03 15:07:02,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:02,172 INFO L225 Difference]: With dead ends: 11292 [2025-03-03 15:07:02,172 INFO L226 Difference]: Without dead ends: 7222 [2025-03-03 15:07:02,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:07:02,179 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 2416 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2416 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:02,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2416 Valid, 583 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:07:02,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7222 states. [2025-03-03 15:07:02,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7222 to 7214. [2025-03-03 15:07:02,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7214 states, 7207 states have (on average 1.4029415845705564) internal successors, (10111), 7213 states have internal predecessors, (10111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:02,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7214 states to 7214 states and 10111 transitions. [2025-03-03 15:07:02,304 INFO L78 Accepts]: Start accepts. Automaton has 7214 states and 10111 transitions. Word has length 67 [2025-03-03 15:07:02,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:02,304 INFO L471 AbstractCegarLoop]: Abstraction has 7214 states and 10111 transitions. [2025-03-03 15:07:02,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:02,304 INFO L276 IsEmpty]: Start isEmpty. Operand 7214 states and 10111 transitions. [2025-03-03 15:07:02,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:07:02,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:02,308 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] [2025-03-03 15:07:02,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:07:02,308 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:02,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:02,309 INFO L85 PathProgramCache]: Analyzing trace with hash 327520293, now seen corresponding path program 1 times [2025-03-03 15:07:02,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:02,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135342478] [2025-03-03 15:07:02,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:02,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:02,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:07:02,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:07:02,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:02,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:02,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:02,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:02,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135342478] [2025-03-03 15:07:02,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135342478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:02,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:02,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:02,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663745294] [2025-03-03 15:07:02,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:02,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:02,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:02,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:02,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:02,420 INFO L87 Difference]: Start difference. First operand 7214 states and 10111 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:02,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:02,492 INFO L93 Difference]: Finished difference Result 15574 states and 22028 transitions. [2025-03-03 15:07:02,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:02,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-03-03 15:07:02,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:02,523 INFO L225 Difference]: With dead ends: 15574 [2025-03-03 15:07:02,523 INFO L226 Difference]: Without dead ends: 9782 [2025-03-03 15:07:02,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:02,532 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 401 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:02,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1188 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:02,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9782 states. [2025-03-03 15:07:02,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9782 to 9738. [2025-03-03 15:07:02,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9738 states, 9731 states have (on average 1.3830027746377556) internal successors, (13458), 9737 states have internal predecessors, (13458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:02,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9738 states to 9738 states and 13458 transitions. [2025-03-03 15:07:02,669 INFO L78 Accepts]: Start accepts. Automaton has 9738 states and 13458 transitions. Word has length 67 [2025-03-03 15:07:02,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:02,669 INFO L471 AbstractCegarLoop]: Abstraction has 9738 states and 13458 transitions. [2025-03-03 15:07:02,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:02,670 INFO L276 IsEmpty]: Start isEmpty. Operand 9738 states and 13458 transitions. [2025-03-03 15:07:02,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:07:02,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:02,677 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] [2025-03-03 15:07:02,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:07:02,677 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:02,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:02,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1709772015, now seen corresponding path program 1 times [2025-03-03 15:07:02,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:02,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531694461] [2025-03-03 15:07:02,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:02,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:02,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:07:02,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:07:02,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:02,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:02,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:02,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:02,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531694461] [2025-03-03 15:07:02,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531694461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:02,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:02,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:07:02,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533554948] [2025-03-03 15:07:02,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:02,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:07:02,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:02,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:07:02,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:07:02,843 INFO L87 Difference]: Start difference. First operand 9738 states and 13458 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:03,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:03,430 INFO L93 Difference]: Finished difference Result 27452 states and 38510 transitions. [2025-03-03 15:07:03,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:07:03,431 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-03-03 15:07:03,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:03,467 INFO L225 Difference]: With dead ends: 27452 [2025-03-03 15:07:03,467 INFO L226 Difference]: Without dead ends: 23801 [2025-03-03 15:07:03,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:07:03,476 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 3231 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3231 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:03,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3231 Valid, 1122 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:07:03,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23801 states. [2025-03-03 15:07:03,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23801 to 9806. [2025-03-03 15:07:03,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9806 states, 9799 states have (on average 1.3823859577507909) internal successors, (13546), 9805 states have internal predecessors, (13546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:03,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9806 states to 9806 states and 13546 transitions. [2025-03-03 15:07:03,673 INFO L78 Accepts]: Start accepts. Automaton has 9806 states and 13546 transitions. Word has length 68 [2025-03-03 15:07:03,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:03,674 INFO L471 AbstractCegarLoop]: Abstraction has 9806 states and 13546 transitions. [2025-03-03 15:07:03,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:03,674 INFO L276 IsEmpty]: Start isEmpty. Operand 9806 states and 13546 transitions. [2025-03-03 15:07:03,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:07:03,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:03,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:07:03,680 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:03,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:03,680 INFO L85 PathProgramCache]: Analyzing trace with hash -19122361, now seen corresponding path program 1 times [2025-03-03 15:07:03,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:03,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394751908] [2025-03-03 15:07:03,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:03,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:03,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:07:03,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:07:03,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:03,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:03,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:03,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:03,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394751908] [2025-03-03 15:07:03,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394751908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:03,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:03,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:07:03,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397455860] [2025-03-03 15:07:03,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:03,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:07:03,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:03,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:07:03,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:07:03,813 INFO L87 Difference]: Start difference. First operand 9806 states and 13546 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:04,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:04,407 INFO L93 Difference]: Finished difference Result 26125 states and 36562 transitions. [2025-03-03 15:07:04,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:07:04,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-03-03 15:07:04,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:04,444 INFO L225 Difference]: With dead ends: 26125 [2025-03-03 15:07:04,444 INFO L226 Difference]: Without dead ends: 21483 [2025-03-03 15:07:04,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:07:04,455 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 3135 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3135 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:04,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3135 Valid, 1104 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:07:04,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21483 states. [2025-03-03 15:07:04,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21483 to 9962. [2025-03-03 15:07:04,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9962 states, 9955 states have (on average 1.381416373681567) internal successors, (13752), 9961 states have internal predecessors, (13752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:04,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9962 states to 9962 states and 13752 transitions. [2025-03-03 15:07:04,656 INFO L78 Accepts]: Start accepts. Automaton has 9962 states and 13752 transitions. Word has length 68 [2025-03-03 15:07:04,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:04,656 INFO L471 AbstractCegarLoop]: Abstraction has 9962 states and 13752 transitions. [2025-03-03 15:07:04,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand 9962 states and 13752 transitions. [2025-03-03 15:07:04,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:07:04,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:04,663 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] [2025-03-03 15:07:04,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:07:04,663 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:04,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:04,664 INFO L85 PathProgramCache]: Analyzing trace with hash 285260238, now seen corresponding path program 1 times [2025-03-03 15:07:04,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:04,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158649935] [2025-03-03 15:07:04,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:04,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:04,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:07:04,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:07:04,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:04,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:04,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:04,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:04,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158649935] [2025-03-03 15:07:04,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158649935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:04,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:04,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:07:04,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032929059] [2025-03-03 15:07:04,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:04,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:07:04,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:04,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:07:04,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:07:04,805 INFO L87 Difference]: Start difference. First operand 9962 states and 13752 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:05,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:05,261 INFO L93 Difference]: Finished difference Result 21274 states and 29550 transitions. [2025-03-03 15:07:05,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:07:05,262 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-03-03 15:07:05,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:05,286 INFO L225 Difference]: With dead ends: 21274 [2025-03-03 15:07:05,287 INFO L226 Difference]: Without dead ends: 16532 [2025-03-03 15:07:05,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:07:05,296 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 2887 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2887 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:05,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2887 Valid, 1060 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:07:05,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16532 states. [2025-03-03 15:07:05,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16532 to 9997. [2025-03-03 15:07:05,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9997 states, 9990 states have (on average 1.3810810810810812) internal successors, (13797), 9996 states have internal predecessors, (13797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:05,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9997 states to 9997 states and 13797 transitions. [2025-03-03 15:07:05,475 INFO L78 Accepts]: Start accepts. Automaton has 9997 states and 13797 transitions. Word has length 68 [2025-03-03 15:07:05,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:05,476 INFO L471 AbstractCegarLoop]: Abstraction has 9997 states and 13797 transitions. [2025-03-03 15:07:05,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 9997 states and 13797 transitions. [2025-03-03 15:07:05,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:07:05,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:05,482 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] [2025-03-03 15:07:05,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:07:05,482 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:05,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:05,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1432095475, now seen corresponding path program 1 times [2025-03-03 15:07:05,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:05,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555255372] [2025-03-03 15:07:05,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:05,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:05,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:07:05,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:07:05,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:05,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:05,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:05,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:05,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555255372] [2025-03-03 15:07:05,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555255372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:05,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:05,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:07:05,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781247666] [2025-03-03 15:07:05,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:05,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:07:05,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:05,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:07:05,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:07:05,625 INFO L87 Difference]: Start difference. First operand 9997 states and 13797 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:06,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:06,159 INFO L93 Difference]: Finished difference Result 23606 states and 32903 transitions. [2025-03-03 15:07:06,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:07:06,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-03-03 15:07:06,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:06,189 INFO L225 Difference]: With dead ends: 23606 [2025-03-03 15:07:06,189 INFO L226 Difference]: Without dead ends: 19330 [2025-03-03 15:07:06,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:07:06,199 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 3058 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3058 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:06,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3058 Valid, 1085 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:07:06,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19330 states. [2025-03-03 15:07:06,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19330 to 10068. [2025-03-03 15:07:06,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10068 states, 10061 states have (on average 1.3811748335155551) internal successors, (13896), 10067 states have internal predecessors, (13896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:06,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10068 states to 10068 states and 13896 transitions. [2025-03-03 15:07:06,373 INFO L78 Accepts]: Start accepts. Automaton has 10068 states and 13896 transitions. Word has length 68 [2025-03-03 15:07:06,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:06,373 INFO L471 AbstractCegarLoop]: Abstraction has 10068 states and 13896 transitions. [2025-03-03 15:07:06,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:06,373 INFO L276 IsEmpty]: Start isEmpty. Operand 10068 states and 13896 transitions. [2025-03-03 15:07:06,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:07:06,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:06,380 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] [2025-03-03 15:07:06,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:07:06,380 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:06,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:06,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1962422874, now seen corresponding path program 1 times [2025-03-03 15:07:06,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:06,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135442186] [2025-03-03 15:07:06,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:06,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:06,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:07:06,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:07:06,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:06,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:06,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:06,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:06,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135442186] [2025-03-03 15:07:06,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135442186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:06,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:06,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:07:06,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512358700] [2025-03-03 15:07:06,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:06,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:07:06,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:06,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:07:06,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:07:06,668 INFO L87 Difference]: Start difference. First operand 10068 states and 13896 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:07,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:07,240 INFO L93 Difference]: Finished difference Result 21513 states and 30145 transitions. [2025-03-03 15:07:07,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:07:07,241 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-03 15:07:07,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:07,258 INFO L225 Difference]: With dead ends: 21513 [2025-03-03 15:07:07,258 INFO L226 Difference]: Without dead ends: 14380 [2025-03-03 15:07:07,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:07:07,268 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 2843 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2843 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:07,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2843 Valid, 1561 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:07:07,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14380 states. [2025-03-03 15:07:07,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14380 to 9762. [2025-03-03 15:07:07,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9762 states, 9755 states have (on average 1.380112762685802) internal successors, (13463), 9761 states have internal predecessors, (13463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:07,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9762 states to 9762 states and 13463 transitions. [2025-03-03 15:07:07,412 INFO L78 Accepts]: Start accepts. Automaton has 9762 states and 13463 transitions. Word has length 69 [2025-03-03 15:07:07,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:07,412 INFO L471 AbstractCegarLoop]: Abstraction has 9762 states and 13463 transitions. [2025-03-03 15:07:07,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:07,413 INFO L276 IsEmpty]: Start isEmpty. Operand 9762 states and 13463 transitions. [2025-03-03 15:07:07,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:07:07,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:07,417 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] [2025-03-03 15:07:07,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:07:07,417 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:07,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:07,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1938803911, now seen corresponding path program 1 times [2025-03-03 15:07:07,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:07,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003005629] [2025-03-03 15:07:07,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:07,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:07,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:07:07,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:07:07,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:07,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:07,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:07,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:07,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003005629] [2025-03-03 15:07:07,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003005629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:07,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:07,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:07:07,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205492879] [2025-03-03 15:07:07,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:07,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:07:07,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:07,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:07:07,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:07:07,666 INFO L87 Difference]: Start difference. First operand 9762 states and 13463 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:08,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:08,306 INFO L93 Difference]: Finished difference Result 21264 states and 29750 transitions. [2025-03-03 15:07:08,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:07:08,307 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-03 15:07:08,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:08,322 INFO L225 Difference]: With dead ends: 21264 [2025-03-03 15:07:08,323 INFO L226 Difference]: Without dead ends: 14840 [2025-03-03 15:07:08,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:07:08,331 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 3490 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3490 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:08,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3490 Valid, 1829 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1231 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:07:08,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14840 states. [2025-03-03 15:07:08,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14840 to 9750. [2025-03-03 15:07:08,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9750 states, 9743 states have (on average 1.3794519141948065) internal successors, (13440), 9749 states have internal predecessors, (13440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:08,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9750 states to 9750 states and 13440 transitions. [2025-03-03 15:07:08,504 INFO L78 Accepts]: Start accepts. Automaton has 9750 states and 13440 transitions. Word has length 69 [2025-03-03 15:07:08,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:08,504 INFO L471 AbstractCegarLoop]: Abstraction has 9750 states and 13440 transitions. [2025-03-03 15:07:08,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:08,504 INFO L276 IsEmpty]: Start isEmpty. Operand 9750 states and 13440 transitions. [2025-03-03 15:07:08,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:07:08,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:08,509 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] [2025-03-03 15:07:08,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:07:08,510 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:08,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:08,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1342138928, now seen corresponding path program 1 times [2025-03-03 15:07:08,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:08,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194468016] [2025-03-03 15:07:08,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:08,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:08,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:07:08,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:07:08,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:08,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:08,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:08,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:08,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194468016] [2025-03-03 15:07:08,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194468016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:08,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:08,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:07:08,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862630693] [2025-03-03 15:07:08,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:08,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:07:08,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:08,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:07:08,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:07:08,812 INFO L87 Difference]: Start difference. First operand 9750 states and 13440 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:09,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:09,473 INFO L93 Difference]: Finished difference Result 21417 states and 29975 transitions. [2025-03-03 15:07:09,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:07:09,473 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-03 15:07:09,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:09,489 INFO L225 Difference]: With dead ends: 21417 [2025-03-03 15:07:09,489 INFO L226 Difference]: Without dead ends: 14966 [2025-03-03 15:07:09,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:07:09,498 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 3570 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3570 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:09,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3570 Valid, 1777 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:07:09,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14966 states. [2025-03-03 15:07:09,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14966 to 9726. [2025-03-03 15:07:09,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9726 states, 9719 states have (on average 1.3788455602428233) internal successors, (13401), 9725 states have internal predecessors, (13401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:09,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9726 states to 9726 states and 13401 transitions. [2025-03-03 15:07:09,606 INFO L78 Accepts]: Start accepts. Automaton has 9726 states and 13401 transitions. Word has length 69 [2025-03-03 15:07:09,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:09,606 INFO L471 AbstractCegarLoop]: Abstraction has 9726 states and 13401 transitions. [2025-03-03 15:07:09,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:09,607 INFO L276 IsEmpty]: Start isEmpty. Operand 9726 states and 13401 transitions. [2025-03-03 15:07:09,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:07:09,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:09,611 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] [2025-03-03 15:07:09,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:07:09,611 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:09,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:09,611 INFO L85 PathProgramCache]: Analyzing trace with hash 905323558, now seen corresponding path program 1 times [2025-03-03 15:07:09,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:09,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50220371] [2025-03-03 15:07:09,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:09,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:09,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:07:09,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:07:09,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:09,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:09,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:09,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:09,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50220371] [2025-03-03 15:07:09,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50220371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:09,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:09,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:07:09,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807578426] [2025-03-03 15:07:09,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:09,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:07:09,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:09,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:07:09,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:07:09,850 INFO L87 Difference]: Start difference. First operand 9726 states and 13401 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:10,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:10,478 INFO L93 Difference]: Finished difference Result 20010 states and 27963 transitions. [2025-03-03 15:07:10,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:07:10,478 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-03 15:07:10,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:10,491 INFO L225 Difference]: With dead ends: 20010 [2025-03-03 15:07:10,491 INFO L226 Difference]: Without dead ends: 13335 [2025-03-03 15:07:10,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:07:10,500 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 3380 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3380 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:10,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3380 Valid, 1804 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:07:10,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13335 states. [2025-03-03 15:07:10,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13335 to 9591. [2025-03-03 15:07:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9591 states, 9584 states have (on average 1.3785475792988313) internal successors, (13212), 9590 states have internal predecessors, (13212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:10,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9591 states to 9591 states and 13212 transitions. [2025-03-03 15:07:10,601 INFO L78 Accepts]: Start accepts. Automaton has 9591 states and 13212 transitions. Word has length 69 [2025-03-03 15:07:10,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:10,602 INFO L471 AbstractCegarLoop]: Abstraction has 9591 states and 13212 transitions. [2025-03-03 15:07:10,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:10,602 INFO L276 IsEmpty]: Start isEmpty. Operand 9591 states and 13212 transitions. [2025-03-03 15:07:10,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:07:10,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:10,606 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] [2025-03-03 15:07:10,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:07:10,607 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:10,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:10,607 INFO L85 PathProgramCache]: Analyzing trace with hash -317392737, now seen corresponding path program 1 times [2025-03-03 15:07:10,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:10,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360083] [2025-03-03 15:07:10,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:10,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:10,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:07:10,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:07:10,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:10,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:11,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:11,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:11,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360083] [2025-03-03 15:07:11,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:11,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:11,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:07:11,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855686052] [2025-03-03 15:07:11,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:11,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:07:11,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:11,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:07:11,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:07:11,198 INFO L87 Difference]: Start difference. First operand 9591 states and 13212 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:12,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:12,361 INFO L93 Difference]: Finished difference Result 34120 states and 48024 transitions. [2025-03-03 15:07:12,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 15:07:12,362 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-03-03 15:07:12,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:12,393 INFO L225 Difference]: With dead ends: 34120 [2025-03-03 15:07:12,393 INFO L226 Difference]: Without dead ends: 27699 [2025-03-03 15:07:12,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:07:12,406 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 4526 mSDsluCounter, 4163 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4526 SdHoareTripleChecker+Valid, 4767 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:12,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4526 Valid, 4767 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:07:12,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27699 states. [2025-03-03 15:07:12,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27699 to 9571. [2025-03-03 15:07:12,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9571 states, 9565 states have (on average 1.377417668583377) internal successors, (13175), 9570 states have internal predecessors, (13175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:12,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9571 states to 9571 states and 13175 transitions. [2025-03-03 15:07:12,581 INFO L78 Accepts]: Start accepts. Automaton has 9571 states and 13175 transitions. Word has length 70 [2025-03-03 15:07:12,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:12,581 INFO L471 AbstractCegarLoop]: Abstraction has 9571 states and 13175 transitions. [2025-03-03 15:07:12,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:12,581 INFO L276 IsEmpty]: Start isEmpty. Operand 9571 states and 13175 transitions. [2025-03-03 15:07:12,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:07:12,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:12,586 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:12,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:07:12,586 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:12,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:12,586 INFO L85 PathProgramCache]: Analyzing trace with hash 20539696, now seen corresponding path program 1 times [2025-03-03 15:07:12,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:12,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475925596] [2025-03-03 15:07:12,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:12,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:12,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:07:12,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:07:12,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:12,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:13,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:13,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475925596] [2025-03-03 15:07:13,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475925596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:13,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:13,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:07:13,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192013051] [2025-03-03 15:07:13,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:13,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:07:13,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:13,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:07:13,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:07:13,020 INFO L87 Difference]: Start difference. First operand 9571 states and 13175 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:13,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:13,568 INFO L93 Difference]: Finished difference Result 21060 states and 29548 transitions. [2025-03-03 15:07:13,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:07:13,568 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-03-03 15:07:13,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:13,583 INFO L225 Difference]: With dead ends: 21060 [2025-03-03 15:07:13,583 INFO L226 Difference]: Without dead ends: 14268 [2025-03-03 15:07:13,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:07:13,591 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 3557 mSDsluCounter, 2892 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3557 SdHoareTripleChecker+Valid, 3491 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:13,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3557 Valid, 3491 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:07:13,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14268 states. [2025-03-03 15:07:13,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14268 to 9174. [2025-03-03 15:07:13,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9174 states, 9170 states have (on average 1.3793893129770993) internal successors, (12649), 9173 states have internal predecessors, (12649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:13,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9174 states to 9174 states and 12649 transitions. [2025-03-03 15:07:13,690 INFO L78 Accepts]: Start accepts. Automaton has 9174 states and 12649 transitions. Word has length 70 [2025-03-03 15:07:13,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:13,691 INFO L471 AbstractCegarLoop]: Abstraction has 9174 states and 12649 transitions. [2025-03-03 15:07:13,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:13,691 INFO L276 IsEmpty]: Start isEmpty. Operand 9174 states and 12649 transitions. [2025-03-03 15:07:13,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:07:13,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:13,695 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] [2025-03-03 15:07:13,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:07:13,695 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:13,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:13,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1159622793, now seen corresponding path program 1 times [2025-03-03 15:07:13,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:13,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738048107] [2025-03-03 15:07:13,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:13,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:13,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:07:13,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:07:13,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:13,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:14,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:14,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:14,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738048107] [2025-03-03 15:07:14,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738048107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:14,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:14,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:07:14,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333575486] [2025-03-03 15:07:14,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:14,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:07:14,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:14,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:07:14,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:07:14,140 INFO L87 Difference]: Start difference. First operand 9174 states and 12649 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:14,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:14,767 INFO L93 Difference]: Finished difference Result 20645 states and 28993 transitions. [2025-03-03 15:07:14,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:07:14,768 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-03-03 15:07:14,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:14,784 INFO L225 Difference]: With dead ends: 20645 [2025-03-03 15:07:14,784 INFO L226 Difference]: Without dead ends: 14157 [2025-03-03 15:07:14,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:07:14,793 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 3293 mSDsluCounter, 2874 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3293 SdHoareTripleChecker+Valid, 3420 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:14,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3293 Valid, 3420 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:07:14,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14157 states. [2025-03-03 15:07:14,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14157 to 9087. [2025-03-03 15:07:14,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9087 states, 9084 states have (on average 1.3781373844121532) internal successors, (12519), 9086 states have internal predecessors, (12519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:14,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9087 states to 9087 states and 12519 transitions. [2025-03-03 15:07:14,915 INFO L78 Accepts]: Start accepts. Automaton has 9087 states and 12519 transitions. Word has length 70 [2025-03-03 15:07:14,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:14,915 INFO L471 AbstractCegarLoop]: Abstraction has 9087 states and 12519 transitions. [2025-03-03 15:07:14,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:14,915 INFO L276 IsEmpty]: Start isEmpty. Operand 9087 states and 12519 transitions. [2025-03-03 15:07:14,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:07:14,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:14,919 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] [2025-03-03 15:07:14,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:07:14,919 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:14,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:14,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1925569480, now seen corresponding path program 1 times [2025-03-03 15:07:14,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:14,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283432196] [2025-03-03 15:07:14,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:14,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:14,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:07:14,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:07:14,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:14,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:15,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:15,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:15,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283432196] [2025-03-03 15:07:15,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283432196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:15,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:15,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:07:15,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566178799] [2025-03-03 15:07:15,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:15,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:07:15,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:15,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:07:15,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:07:15,240 INFO L87 Difference]: Start difference. First operand 9087 states and 12519 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:15,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:15,860 INFO L93 Difference]: Finished difference Result 22338 states and 31415 transitions. [2025-03-03 15:07:15,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:07:15,861 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-03-03 15:07:15,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:15,876 INFO L225 Difference]: With dead ends: 22338 [2025-03-03 15:07:15,876 INFO L226 Difference]: Without dead ends: 15927 [2025-03-03 15:07:15,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2025-03-03 15:07:15,883 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 3333 mSDsluCounter, 2071 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3333 SdHoareTripleChecker+Valid, 2592 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:15,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3333 Valid, 2592 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:07:15,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15927 states. [2025-03-03 15:07:15,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15927 to 9093. [2025-03-03 15:07:15,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9093 states, 9090 states have (on average 1.378107810781078) internal successors, (12527), 9092 states have internal predecessors, (12527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:16,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9093 states to 9093 states and 12527 transitions. [2025-03-03 15:07:16,008 INFO L78 Accepts]: Start accepts. Automaton has 9093 states and 12527 transitions. Word has length 70 [2025-03-03 15:07:16,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:16,009 INFO L471 AbstractCegarLoop]: Abstraction has 9093 states and 12527 transitions. [2025-03-03 15:07:16,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:16,009 INFO L276 IsEmpty]: Start isEmpty. Operand 9093 states and 12527 transitions. [2025-03-03 15:07:16,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:07:16,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:16,013 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] [2025-03-03 15:07:16,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:07:16,013 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:16,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:16,014 INFO L85 PathProgramCache]: Analyzing trace with hash -432302184, now seen corresponding path program 1 times [2025-03-03 15:07:16,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:16,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507530863] [2025-03-03 15:07:16,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:16,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:16,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:07:16,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:07:16,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:16,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:16,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:16,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:16,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507530863] [2025-03-03 15:07:16,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507530863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:16,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:16,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:07:16,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102222551] [2025-03-03 15:07:16,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:16,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:07:16,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:16,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:07:16,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:07:16,103 INFO L87 Difference]: Start difference. First operand 9093 states and 12527 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:16,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:16,504 INFO L93 Difference]: Finished difference Result 24880 states and 34849 transitions. [2025-03-03 15:07:16,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:07:16,504 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-03-03 15:07:16,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:16,522 INFO L225 Difference]: With dead ends: 24880 [2025-03-03 15:07:16,522 INFO L226 Difference]: Without dead ends: 20599 [2025-03-03 15:07:16,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:07:16,529 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 2708 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2708 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:16,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2708 Valid, 960 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:07:16,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20599 states. [2025-03-03 15:07:16,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20599 to 9111. [2025-03-03 15:07:16,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9111 states, 9108 states have (on average 1.3777997364953887) internal successors, (12549), 9110 states have internal predecessors, (12549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:16,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9111 states to 9111 states and 12549 transitions. [2025-03-03 15:07:16,649 INFO L78 Accepts]: Start accepts. Automaton has 9111 states and 12549 transitions. Word has length 70 [2025-03-03 15:07:16,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:16,649 INFO L471 AbstractCegarLoop]: Abstraction has 9111 states and 12549 transitions. [2025-03-03 15:07:16,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:16,650 INFO L276 IsEmpty]: Start isEmpty. Operand 9111 states and 12549 transitions. [2025-03-03 15:07:16,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:07:16,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:16,653 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] [2025-03-03 15:07:16,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:07:16,654 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:16,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:16,654 INFO L85 PathProgramCache]: Analyzing trace with hash 781680441, now seen corresponding path program 1 times [2025-03-03 15:07:16,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:16,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441956072] [2025-03-03 15:07:16,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:16,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:16,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:07:16,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:07:16,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:16,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:16,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:16,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:16,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441956072] [2025-03-03 15:07:16,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441956072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:16,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:16,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:16,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978920120] [2025-03-03 15:07:16,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:16,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:16,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:16,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:16,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:16,697 INFO L87 Difference]: Start difference. First operand 9111 states and 12549 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:16,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:16,737 INFO L93 Difference]: Finished difference Result 13912 states and 19297 transitions. [2025-03-03 15:07:16,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:16,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2025-03-03 15:07:16,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:16,745 INFO L225 Difference]: With dead ends: 13912 [2025-03-03 15:07:16,745 INFO L226 Difference]: Without dead ends: 9117 [2025-03-03 15:07:16,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:16,750 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 358 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:16,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1327 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:16,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9117 states. [2025-03-03 15:07:16,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9117 to 9111. [2025-03-03 15:07:16,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9111 states, 9108 states have (on average 1.3671497584541064) internal successors, (12452), 9110 states have internal predecessors, (12452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:16,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9111 states to 9111 states and 12452 transitions. [2025-03-03 15:07:16,823 INFO L78 Accepts]: Start accepts. Automaton has 9111 states and 12452 transitions. Word has length 71 [2025-03-03 15:07:16,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:16,823 INFO L471 AbstractCegarLoop]: Abstraction has 9111 states and 12452 transitions. [2025-03-03 15:07:16,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:16,823 INFO L276 IsEmpty]: Start isEmpty. Operand 9111 states and 12452 transitions. [2025-03-03 15:07:16,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:07:16,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:16,827 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] [2025-03-03 15:07:16,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:07:16,827 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:16,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:16,828 INFO L85 PathProgramCache]: Analyzing trace with hash -497196498, now seen corresponding path program 1 times [2025-03-03 15:07:16,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:16,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324738486] [2025-03-03 15:07:16,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:16,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:16,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:07:16,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:07:16,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:16,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:16,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:16,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:16,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324738486] [2025-03-03 15:07:16,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324738486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:16,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:16,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:16,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680850699] [2025-03-03 15:07:16,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:16,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:16,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:16,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:16,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:16,866 INFO L87 Difference]: Start difference. First operand 9111 states and 12452 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:16,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:16,929 INFO L93 Difference]: Finished difference Result 16785 states and 23117 transitions. [2025-03-03 15:07:16,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:16,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2025-03-03 15:07:16,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:16,938 INFO L225 Difference]: With dead ends: 16785 [2025-03-03 15:07:16,938 INFO L226 Difference]: Without dead ends: 11235 [2025-03-03 15:07:16,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:16,946 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 528 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:16,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 832 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:16,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11235 states. [2025-03-03 15:07:17,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11235 to 8446. [2025-03-03 15:07:17,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8446 states, 8443 states have (on average 1.370365983655099) internal successors, (11570), 8445 states have internal predecessors, (11570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:17,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8446 states to 8446 states and 11570 transitions. [2025-03-03 15:07:17,021 INFO L78 Accepts]: Start accepts. Automaton has 8446 states and 11570 transitions. Word has length 72 [2025-03-03 15:07:17,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:17,021 INFO L471 AbstractCegarLoop]: Abstraction has 8446 states and 11570 transitions. [2025-03-03 15:07:17,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:17,021 INFO L276 IsEmpty]: Start isEmpty. Operand 8446 states and 11570 transitions. [2025-03-03 15:07:17,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:07:17,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:17,024 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] [2025-03-03 15:07:17,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:07:17,025 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:17,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:17,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1540680335, now seen corresponding path program 1 times [2025-03-03 15:07:17,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:17,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32694799] [2025-03-03 15:07:17,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:17,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:17,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:07:17,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:07:17,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:17,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:17,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:17,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:17,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32694799] [2025-03-03 15:07:17,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32694799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:17,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:17,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:17,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856556956] [2025-03-03 15:07:17,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:17,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:17,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:17,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:17,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:17,088 INFO L87 Difference]: Start difference. First operand 8446 states and 11570 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:17,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:17,157 INFO L93 Difference]: Finished difference Result 17635 states and 24408 transitions. [2025-03-03 15:07:17,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:17,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2025-03-03 15:07:17,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:17,170 INFO L225 Difference]: With dead ends: 17635 [2025-03-03 15:07:17,170 INFO L226 Difference]: Without dead ends: 12447 [2025-03-03 15:07:17,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:17,177 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 427 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:17,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 612 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:17,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12447 states. [2025-03-03 15:07:17,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12447 to 12409. [2025-03-03 15:07:17,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12409 states, 12407 states have (on average 1.3881679696945273) internal successors, (17223), 12408 states have internal predecessors, (17223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:17,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12409 states to 12409 states and 17223 transitions. [2025-03-03 15:07:17,285 INFO L78 Accepts]: Start accepts. Automaton has 12409 states and 17223 transitions. Word has length 72 [2025-03-03 15:07:17,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:17,285 INFO L471 AbstractCegarLoop]: Abstraction has 12409 states and 17223 transitions. [2025-03-03 15:07:17,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:17,285 INFO L276 IsEmpty]: Start isEmpty. Operand 12409 states and 17223 transitions. [2025-03-03 15:07:17,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 15:07:17,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:17,289 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:17,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:07:17,289 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:17,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:17,290 INFO L85 PathProgramCache]: Analyzing trace with hash 131441337, now seen corresponding path program 1 times [2025-03-03 15:07:17,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:17,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217284414] [2025-03-03 15:07:17,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:17,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:17,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 15:07:17,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 15:07:17,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:17,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:17,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:17,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:17,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217284414] [2025-03-03 15:07:17,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217284414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:17,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:17,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:07:17,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242348203] [2025-03-03 15:07:17,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:17,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:07:17,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:17,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:07:17,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:07:17,555 INFO L87 Difference]: Start difference. First operand 12409 states and 17223 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:18,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:18,025 INFO L93 Difference]: Finished difference Result 16247 states and 22579 transitions. [2025-03-03 15:07:18,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:07:18,025 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-03 15:07:18,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:18,034 INFO L225 Difference]: With dead ends: 16247 [2025-03-03 15:07:18,035 INFO L226 Difference]: Without dead ends: 12670 [2025-03-03 15:07:18,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:07:18,039 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 2449 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2449 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:18,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2449 Valid, 1265 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:07:18,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12670 states. [2025-03-03 15:07:18,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12670 to 12406. [2025-03-03 15:07:18,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12406 states, 12404 states have (on average 1.3880199935504676) internal successors, (17217), 12405 states have internal predecessors, (17217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:18,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12406 states to 12406 states and 17217 transitions. [2025-03-03 15:07:18,153 INFO L78 Accepts]: Start accepts. Automaton has 12406 states and 17217 transitions. Word has length 73 [2025-03-03 15:07:18,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:18,153 INFO L471 AbstractCegarLoop]: Abstraction has 12406 states and 17217 transitions. [2025-03-03 15:07:18,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:18,154 INFO L276 IsEmpty]: Start isEmpty. Operand 12406 states and 17217 transitions. [2025-03-03 15:07:18,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 15:07:18,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:18,157 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] [2025-03-03 15:07:18,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:07:18,157 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:18,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:18,158 INFO L85 PathProgramCache]: Analyzing trace with hash -173125131, now seen corresponding path program 1 times [2025-03-03 15:07:18,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:18,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346115962] [2025-03-03 15:07:18,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:18,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:18,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:07:18,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:07:18,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:18,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:18,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:18,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:18,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346115962] [2025-03-03 15:07:18,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346115962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:18,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:18,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:18,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068933421] [2025-03-03 15:07:18,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:18,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:18,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:18,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:18,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:18,201 INFO L87 Difference]: Start difference. First operand 12406 states and 17217 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:18,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:18,260 INFO L93 Difference]: Finished difference Result 19371 states and 26999 transitions. [2025-03-03 15:07:18,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:18,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-03-03 15:07:18,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:18,269 INFO L225 Difference]: With dead ends: 19371 [2025-03-03 15:07:18,269 INFO L226 Difference]: Without dead ends: 12410 [2025-03-03 15:07:18,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:18,274 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 247 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:18,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 995 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:18,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12410 states. [2025-03-03 15:07:18,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12410 to 12406. [2025-03-03 15:07:18,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12406 states, 12404 states have (on average 1.374879071267333) internal successors, (17054), 12405 states have internal predecessors, (17054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:18,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12406 states to 12406 states and 17054 transitions. [2025-03-03 15:07:18,393 INFO L78 Accepts]: Start accepts. Automaton has 12406 states and 17054 transitions. Word has length 74 [2025-03-03 15:07:18,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:18,393 INFO L471 AbstractCegarLoop]: Abstraction has 12406 states and 17054 transitions. [2025-03-03 15:07:18,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:18,394 INFO L276 IsEmpty]: Start isEmpty. Operand 12406 states and 17054 transitions. [2025-03-03 15:07:18,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 15:07:18,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:18,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:18,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:07:18,398 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:18,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:18,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1009062602, now seen corresponding path program 1 times [2025-03-03 15:07:18,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:18,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435167445] [2025-03-03 15:07:18,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:18,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:18,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 15:07:18,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 15:07:18,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:18,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:18,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:18,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:18,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435167445] [2025-03-03 15:07:18,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435167445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:18,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:18,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:18,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725057832] [2025-03-03 15:07:18,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:18,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:18,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:18,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:18,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:18,438 INFO L87 Difference]: Start difference. First operand 12406 states and 17054 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:18,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:18,528 INFO L93 Difference]: Finished difference Result 23511 states and 32478 transitions. [2025-03-03 15:07:18,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:18,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-03 15:07:18,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:18,541 INFO L225 Difference]: With dead ends: 23511 [2025-03-03 15:07:18,541 INFO L226 Difference]: Without dead ends: 15676 [2025-03-03 15:07:18,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:18,550 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 361 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:18,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 535 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:07:18,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15676 states. [2025-03-03 15:07:18,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15676 to 11931. [2025-03-03 15:07:18,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11931 states, 11929 states have (on average 1.3758906865621594) internal successors, (16413), 11930 states have internal predecessors, (16413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:18,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11931 states to 11931 states and 16413 transitions. [2025-03-03 15:07:18,690 INFO L78 Accepts]: Start accepts. Automaton has 11931 states and 16413 transitions. Word has length 76 [2025-03-03 15:07:18,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:18,690 INFO L471 AbstractCegarLoop]: Abstraction has 11931 states and 16413 transitions. [2025-03-03 15:07:18,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:18,690 INFO L276 IsEmpty]: Start isEmpty. Operand 11931 states and 16413 transitions. [2025-03-03 15:07:18,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 15:07:18,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:18,694 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:18,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:07:18,694 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:18,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:18,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2078115861, now seen corresponding path program 1 times [2025-03-03 15:07:18,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:18,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228014825] [2025-03-03 15:07:18,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:18,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:18,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 15:07:18,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 15:07:18,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:18,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:19,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:19,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:19,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228014825] [2025-03-03 15:07:19,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228014825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:19,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:19,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-03 15:07:19,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140258062] [2025-03-03 15:07:19,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:19,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 15:07:19,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:19,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 15:07:19,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:07:19,621 INFO L87 Difference]: Start difference. First operand 11931 states and 16413 transitions. Second operand has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:22,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:22,017 INFO L93 Difference]: Finished difference Result 24549 states and 33923 transitions. [2025-03-03 15:07:22,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 15:07:22,018 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-03 15:07:22,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:22,038 INFO L225 Difference]: With dead ends: 24549 [2025-03-03 15:07:22,038 INFO L226 Difference]: Without dead ends: 23328 [2025-03-03 15:07:22,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=319, Invalid=1403, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 15:07:22,045 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 4184 mSDsluCounter, 5946 mSDsCounter, 0 mSdLazyCounter, 3104 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4184 SdHoareTripleChecker+Valid, 6343 SdHoareTripleChecker+Invalid, 3125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:22,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4184 Valid, 6343 Invalid, 3125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3104 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 15:07:22,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23328 states. [2025-03-03 15:07:22,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23328 to 11943. [2025-03-03 15:07:22,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11943 states, 11941 states have (on average 1.3758479189347625) internal successors, (16429), 11942 states have internal predecessors, (16429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:22,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11943 states to 11943 states and 16429 transitions. [2025-03-03 15:07:22,163 INFO L78 Accepts]: Start accepts. Automaton has 11943 states and 16429 transitions. Word has length 76 [2025-03-03 15:07:22,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:22,163 INFO L471 AbstractCegarLoop]: Abstraction has 11943 states and 16429 transitions. [2025-03-03 15:07:22,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:22,163 INFO L276 IsEmpty]: Start isEmpty. Operand 11943 states and 16429 transitions. [2025-03-03 15:07:22,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:07:22,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:22,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:22,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 15:07:22,168 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:22,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:22,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1771290343, now seen corresponding path program 1 times [2025-03-03 15:07:22,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:22,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179898554] [2025-03-03 15:07:22,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:22,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:22,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:07:22,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:07:22,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:22,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:22,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:22,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:22,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179898554] [2025-03-03 15:07:22,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179898554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:22,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:22,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:07:22,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560881763] [2025-03-03 15:07:22,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:22,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:07:22,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:22,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:07:22,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:07:22,462 INFO L87 Difference]: Start difference. First operand 11943 states and 16429 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:22,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:22,742 INFO L93 Difference]: Finished difference Result 22273 states and 30897 transitions. [2025-03-03 15:07:22,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:07:22,743 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 15:07:22,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:22,760 INFO L225 Difference]: With dead ends: 22273 [2025-03-03 15:07:22,760 INFO L226 Difference]: Without dead ends: 18629 [2025-03-03 15:07:22,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:07:22,767 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 680 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:22,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1609 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:07:22,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18629 states. [2025-03-03 15:07:22,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18629 to 11788. [2025-03-03 15:07:22,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11788 states, 11787 states have (on average 1.3775345719860863) internal successors, (16237), 11787 states have internal predecessors, (16237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:22,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11788 states to 11788 states and 16237 transitions. [2025-03-03 15:07:22,907 INFO L78 Accepts]: Start accepts. Automaton has 11788 states and 16237 transitions. Word has length 77 [2025-03-03 15:07:22,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:22,907 INFO L471 AbstractCegarLoop]: Abstraction has 11788 states and 16237 transitions. [2025-03-03 15:07:22,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:22,907 INFO L276 IsEmpty]: Start isEmpty. Operand 11788 states and 16237 transitions. [2025-03-03 15:07:22,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 15:07:22,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:22,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:22,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 15:07:22,915 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:22,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:22,916 INFO L85 PathProgramCache]: Analyzing trace with hash -973304734, now seen corresponding path program 1 times [2025-03-03 15:07:22,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:22,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898021702] [2025-03-03 15:07:22,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:22,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:22,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 15:07:22,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 15:07:22,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:22,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:23,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:23,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:23,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898021702] [2025-03-03 15:07:23,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898021702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:23,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:23,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:07:23,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469675740] [2025-03-03 15:07:23,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:23,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:07:23,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:23,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:07:23,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:07:23,098 INFO L87 Difference]: Start difference. First operand 11788 states and 16237 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:23,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:23,270 INFO L93 Difference]: Finished difference Result 48895 states and 68639 transitions. [2025-03-03 15:07:23,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:07:23,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-03 15:07:23,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:23,313 INFO L225 Difference]: With dead ends: 48895 [2025-03-03 15:07:23,313 INFO L226 Difference]: Without dead ends: 38852 [2025-03-03 15:07:23,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:07:23,331 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 1770 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1770 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:23,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1770 Valid, 1154 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:07:23,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38852 states. [2025-03-03 15:07:23,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38852 to 21829. [2025-03-03 15:07:23,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21829 states, 21828 states have (on average 1.377038665933663) internal successors, (30058), 21828 states have internal predecessors, (30058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:23,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21829 states to 21829 states and 30058 transitions. [2025-03-03 15:07:23,681 INFO L78 Accepts]: Start accepts. Automaton has 21829 states and 30058 transitions. Word has length 86 [2025-03-03 15:07:23,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:23,681 INFO L471 AbstractCegarLoop]: Abstraction has 21829 states and 30058 transitions. [2025-03-03 15:07:23,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:23,681 INFO L276 IsEmpty]: Start isEmpty. Operand 21829 states and 30058 transitions. [2025-03-03 15:07:23,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 15:07:23,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:23,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:23,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 15:07:23,694 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:23,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:23,695 INFO L85 PathProgramCache]: Analyzing trace with hash -78091071, now seen corresponding path program 1 times [2025-03-03 15:07:23,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:23,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932974507] [2025-03-03 15:07:23,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:23,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:23,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 15:07:23,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 15:07:23,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:23,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:23,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:23,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:23,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932974507] [2025-03-03 15:07:23,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932974507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:23,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:23,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:07:23,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347852774] [2025-03-03 15:07:23,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:23,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:07:23,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:23,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:07:23,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:07:23,795 INFO L87 Difference]: Start difference. First operand 21829 states and 30058 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:24,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:24,003 INFO L93 Difference]: Finished difference Result 35585 states and 48916 transitions. [2025-03-03 15:07:24,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:07:24,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-03 15:07:24,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:24,032 INFO L225 Difference]: With dead ends: 35585 [2025-03-03 15:07:24,033 INFO L226 Difference]: Without dead ends: 27498 [2025-03-03 15:07:24,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:07:24,044 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 995 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:24,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 1329 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:07:24,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27498 states. [2025-03-03 15:07:24,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27498 to 23946. [2025-03-03 15:07:24,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23946 states, 23945 states have (on average 1.3723115472958864) internal successors, (32860), 23945 states have internal predecessors, (32860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:24,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23946 states to 23946 states and 32860 transitions. [2025-03-03 15:07:24,324 INFO L78 Accepts]: Start accepts. Automaton has 23946 states and 32860 transitions. Word has length 87 [2025-03-03 15:07:24,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:24,324 INFO L471 AbstractCegarLoop]: Abstraction has 23946 states and 32860 transitions. [2025-03-03 15:07:24,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:24,324 INFO L276 IsEmpty]: Start isEmpty. Operand 23946 states and 32860 transitions. [2025-03-03 15:07:24,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 15:07:24,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:24,340 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:24,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:07:24,341 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:24,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:24,342 INFO L85 PathProgramCache]: Analyzing trace with hash 824229442, now seen corresponding path program 1 times [2025-03-03 15:07:24,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:24,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204262086] [2025-03-03 15:07:24,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:24,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:24,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 15:07:24,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 15:07:24,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:24,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:24,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:24,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204262086] [2025-03-03 15:07:24,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204262086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:24,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:24,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:24,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276744589] [2025-03-03 15:07:24,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:24,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:24,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:24,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:24,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:24,454 INFO L87 Difference]: Start difference. First operand 23946 states and 32860 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:24,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:24,650 INFO L93 Difference]: Finished difference Result 66830 states and 91982 transitions. [2025-03-03 15:07:24,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:24,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-03-03 15:07:24,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:24,694 INFO L225 Difference]: With dead ends: 66830 [2025-03-03 15:07:24,694 INFO L226 Difference]: Without dead ends: 44628 [2025-03-03 15:07:24,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:24,717 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 155 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:24,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 755 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:24,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44628 states. [2025-03-03 15:07:25,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44628 to 41906. [2025-03-03 15:07:25,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41906 states, 41905 states have (on average 1.3599331821978284) internal successors, (56988), 41905 states have internal predecessors, (56988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:25,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41906 states to 41906 states and 56988 transitions. [2025-03-03 15:07:25,196 INFO L78 Accepts]: Start accepts. Automaton has 41906 states and 56988 transitions. Word has length 88 [2025-03-03 15:07:25,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:25,197 INFO L471 AbstractCegarLoop]: Abstraction has 41906 states and 56988 transitions. [2025-03-03 15:07:25,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:25,197 INFO L276 IsEmpty]: Start isEmpty. Operand 41906 states and 56988 transitions. [2025-03-03 15:07:25,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 15:07:25,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:25,207 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:25,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 15:07:25,207 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:25,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:25,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1319093004, now seen corresponding path program 1 times [2025-03-03 15:07:25,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:25,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76552] [2025-03-03 15:07:25,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:25,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:25,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 15:07:25,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 15:07:25,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:25,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:25,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:25,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:25,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76552] [2025-03-03 15:07:25,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:25,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:25,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:25,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971713011] [2025-03-03 15:07:25,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:25,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:25,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:25,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:25,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:25,303 INFO L87 Difference]: Start difference. First operand 41906 states and 56988 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:25,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:25,633 INFO L93 Difference]: Finished difference Result 116822 states and 159230 transitions. [2025-03-03 15:07:25,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:25,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-03 15:07:25,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:25,727 INFO L225 Difference]: With dead ends: 116822 [2025-03-03 15:07:25,727 INFO L226 Difference]: Without dead ends: 76660 [2025-03-03 15:07:25,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:25,769 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 143 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:25,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 744 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:25,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76660 states. [2025-03-03 15:07:26,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76660 to 71002. [2025-03-03 15:07:26,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71002 states, 71001 states have (on average 1.3565442740243094) internal successors, (96316), 71001 states have internal predecessors, (96316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:26,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71002 states to 71002 states and 96316 transitions. [2025-03-03 15:07:26,686 INFO L78 Accepts]: Start accepts. Automaton has 71002 states and 96316 transitions. Word has length 89 [2025-03-03 15:07:26,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:26,686 INFO L471 AbstractCegarLoop]: Abstraction has 71002 states and 96316 transitions. [2025-03-03 15:07:26,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:26,686 INFO L276 IsEmpty]: Start isEmpty. Operand 71002 states and 96316 transitions. [2025-03-03 15:07:26,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:07:26,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:26,694 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:26,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 15:07:26,694 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:26,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:26,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1466965167, now seen corresponding path program 1 times [2025-03-03 15:07:26,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:26,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932809325] [2025-03-03 15:07:26,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:26,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:26,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:07:26,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:07:26,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:26,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:26,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:26,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:26,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932809325] [2025-03-03 15:07:26,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932809325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:26,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:26,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:26,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166978670] [2025-03-03 15:07:26,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:26,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:26,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:26,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:26,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:26,769 INFO L87 Difference]: Start difference. First operand 71002 states and 96316 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:27,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:27,424 INFO L93 Difference]: Finished difference Result 201486 states and 272542 transitions. [2025-03-03 15:07:27,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:27,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-03-03 15:07:27,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:27,585 INFO L225 Difference]: With dead ends: 201486 [2025-03-03 15:07:27,585 INFO L226 Difference]: Without dead ends: 132228 [2025-03-03 15:07:27,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:27,624 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 130 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:27,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 730 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:27,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132228 states. [2025-03-03 15:07:29,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132228 to 120690. [2025-03-03 15:07:29,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120690 states, 120689 states have (on average 1.3396084150171101) internal successors, (161676), 120689 states have internal predecessors, (161676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:29,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120690 states to 120690 states and 161676 transitions. [2025-03-03 15:07:29,650 INFO L78 Accepts]: Start accepts. Automaton has 120690 states and 161676 transitions. Word has length 90 [2025-03-03 15:07:29,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:29,650 INFO L471 AbstractCegarLoop]: Abstraction has 120690 states and 161676 transitions. [2025-03-03 15:07:29,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:29,650 INFO L276 IsEmpty]: Start isEmpty. Operand 120690 states and 161676 transitions. [2025-03-03 15:07:29,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 15:07:29,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:29,656 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:29,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 15:07:29,656 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:29,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:29,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1593704593, now seen corresponding path program 1 times [2025-03-03 15:07:29,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:29,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272739257] [2025-03-03 15:07:29,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:29,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:29,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 15:07:29,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 15:07:29,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:29,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:29,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:29,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:29,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272739257] [2025-03-03 15:07:29,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272739257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:29,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:29,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:29,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324670452] [2025-03-03 15:07:29,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:29,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:29,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:29,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:29,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:29,708 INFO L87 Difference]: Start difference. First operand 120690 states and 161676 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:30,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:30,000 INFO L93 Difference]: Finished difference Result 141679 states and 189474 transitions. [2025-03-03 15:07:30,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:30,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-03 15:07:30,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:30,114 INFO L225 Difference]: With dead ends: 141679 [2025-03-03 15:07:30,115 INFO L226 Difference]: Without dead ends: 96587 [2025-03-03 15:07:30,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:30,288 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 199 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:30,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 758 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:30,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96587 states. [2025-03-03 15:07:30,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96587 to 71936. [2025-03-03 15:07:31,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71936 states, 71935 states have (on average 1.3339820671439493) internal successors, (95960), 71935 states have internal predecessors, (95960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71936 states to 71936 states and 95960 transitions. [2025-03-03 15:07:31,163 INFO L78 Accepts]: Start accepts. Automaton has 71936 states and 95960 transitions. Word has length 91 [2025-03-03 15:07:31,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:31,164 INFO L471 AbstractCegarLoop]: Abstraction has 71936 states and 95960 transitions. [2025-03-03 15:07:31,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:31,164 INFO L276 IsEmpty]: Start isEmpty. Operand 71936 states and 95960 transitions. [2025-03-03 15:07:31,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 15:07:31,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:31,171 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:31,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 15:07:31,171 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:31,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:31,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1540372141, now seen corresponding path program 1 times [2025-03-03 15:07:31,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:31,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469559483] [2025-03-03 15:07:31,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:31,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:31,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 15:07:31,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 15:07:31,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:31,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:31,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:31,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:31,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469559483] [2025-03-03 15:07:31,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469559483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:31,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:31,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:31,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966696872] [2025-03-03 15:07:31,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:31,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:31,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:31,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:31,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:31,238 INFO L87 Difference]: Start difference. First operand 71936 states and 95960 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:31,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:31,548 INFO L93 Difference]: Finished difference Result 97821 states and 130215 transitions. [2025-03-03 15:07:31,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:31,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-03 15:07:31,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:31,622 INFO L225 Difference]: With dead ends: 97821 [2025-03-03 15:07:31,623 INFO L226 Difference]: Without dead ends: 63239 [2025-03-03 15:07:31,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:31,656 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 216 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:31,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 852 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:31,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63239 states. [2025-03-03 15:07:32,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63239 to 63237. [2025-03-03 15:07:32,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63237 states, 63236 states have (on average 1.3232810424441774) internal successors, (83679), 63236 states have internal predecessors, (83679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:32,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63237 states to 63237 states and 83679 transitions. [2025-03-03 15:07:32,287 INFO L78 Accepts]: Start accepts. Automaton has 63237 states and 83679 transitions. Word has length 91 [2025-03-03 15:07:32,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:32,287 INFO L471 AbstractCegarLoop]: Abstraction has 63237 states and 83679 transitions. [2025-03-03 15:07:32,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:32,287 INFO L276 IsEmpty]: Start isEmpty. Operand 63237 states and 83679 transitions. [2025-03-03 15:07:32,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 15:07:32,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:32,292 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:32,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 15:07:32,292 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:32,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:32,292 INFO L85 PathProgramCache]: Analyzing trace with hash 954610342, now seen corresponding path program 1 times [2025-03-03 15:07:32,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:32,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812181419] [2025-03-03 15:07:32,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:32,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:32,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 15:07:32,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 15:07:32,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:32,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:32,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:32,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:32,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812181419] [2025-03-03 15:07:32,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812181419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:32,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:32,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:32,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568963817] [2025-03-03 15:07:32,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:32,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:32,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:32,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:32,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:32,502 INFO L87 Difference]: Start difference. First operand 63237 states and 83679 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:32,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:32,888 INFO L93 Difference]: Finished difference Result 181561 states and 239761 transitions. [2025-03-03 15:07:32,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:32,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-03 15:07:32,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:33,043 INFO L225 Difference]: With dead ends: 181561 [2025-03-03 15:07:33,043 INFO L226 Difference]: Without dead ends: 119839 [2025-03-03 15:07:33,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:33,105 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 108 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:33,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 717 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:33,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119839 states. [2025-03-03 15:07:34,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119839 to 111901. [2025-03-03 15:07:34,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111901 states, 111900 states have (on average 1.3093744414655943) internal successors, (146519), 111900 states have internal predecessors, (146519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:34,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111901 states to 111901 states and 146519 transitions. [2025-03-03 15:07:34,563 INFO L78 Accepts]: Start accepts. Automaton has 111901 states and 146519 transitions. Word has length 92 [2025-03-03 15:07:34,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:34,563 INFO L471 AbstractCegarLoop]: Abstraction has 111901 states and 146519 transitions. [2025-03-03 15:07:34,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:34,563 INFO L276 IsEmpty]: Start isEmpty. Operand 111901 states and 146519 transitions. [2025-03-03 15:07:34,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 15:07:34,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:34,568 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:34,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 15:07:34,568 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:34,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:34,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1323860144, now seen corresponding path program 1 times [2025-03-03 15:07:34,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:34,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78222085] [2025-03-03 15:07:34,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:34,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:34,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:07:34,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:07:34,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:34,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:34,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:34,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:34,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78222085] [2025-03-03 15:07:34,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78222085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:34,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:34,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:07:34,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511310275] [2025-03-03 15:07:34,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:34,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:07:34,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:34,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:07:34,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:07:34,727 INFO L87 Difference]: Start difference. First operand 111901 states and 146519 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:35,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:35,235 INFO L93 Difference]: Finished difference Result 120735 states and 158296 transitions. [2025-03-03 15:07:35,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:07:35,235 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-03-03 15:07:35,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:35,373 INFO L225 Difference]: With dead ends: 120735 [2025-03-03 15:07:35,373 INFO L226 Difference]: Without dead ends: 120733 [2025-03-03 15:07:35,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:07:35,412 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 0 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:35,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1758 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:07:35,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120733 states. [2025-03-03 15:07:36,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120733 to 120733. [2025-03-03 15:07:36,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120733 states, 120732 states have (on average 1.286742537189809) internal successors, (155351), 120732 states have internal predecessors, (155351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:36,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120733 states to 120733 states and 155351 transitions. [2025-03-03 15:07:36,937 INFO L78 Accepts]: Start accepts. Automaton has 120733 states and 155351 transitions. Word has length 94 [2025-03-03 15:07:36,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:36,937 INFO L471 AbstractCegarLoop]: Abstraction has 120733 states and 155351 transitions. [2025-03-03 15:07:36,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:36,938 INFO L276 IsEmpty]: Start isEmpty. Operand 120733 states and 155351 transitions. [2025-03-03 15:07:36,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:07:36,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:36,943 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:36,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 15:07:36,944 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:36,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:36,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2057803795, now seen corresponding path program 1 times [2025-03-03 15:07:36,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:36,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696139953] [2025-03-03 15:07:36,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:36,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:36,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:07:36,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:07:36,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:36,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:37,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:37,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:37,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696139953] [2025-03-03 15:07:37,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696139953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:37,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:37,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:37,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962990075] [2025-03-03 15:07:37,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:37,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:37,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:37,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:37,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:37,004 INFO L87 Difference]: Start difference. First operand 120733 states and 155351 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:38,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:38,210 INFO L93 Difference]: Finished difference Result 305041 states and 390281 transitions. [2025-03-03 15:07:38,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:38,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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 95 [2025-03-03 15:07:38,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:38,423 INFO L225 Difference]: With dead ends: 305041 [2025-03-03 15:07:38,423 INFO L226 Difference]: Without dead ends: 185823 [2025-03-03 15:07:38,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:38,458 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 261 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:38,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 554 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:38,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185823 states. [2025-03-03 15:07:40,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185823 to 185821. [2025-03-03 15:07:40,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185821 states, 185820 states have (on average 1.265864815412765) internal successors, (235223), 185820 states have internal predecessors, (235223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:40,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185821 states to 185821 states and 235223 transitions. [2025-03-03 15:07:40,428 INFO L78 Accepts]: Start accepts. Automaton has 185821 states and 235223 transitions. Word has length 95 [2025-03-03 15:07:40,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:40,428 INFO L471 AbstractCegarLoop]: Abstraction has 185821 states and 235223 transitions. [2025-03-03 15:07:40,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:40,428 INFO L276 IsEmpty]: Start isEmpty. Operand 185821 states and 235223 transitions. [2025-03-03 15:07:40,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:07:40,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:40,433 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:40,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 15:07:40,433 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:40,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:40,434 INFO L85 PathProgramCache]: Analyzing trace with hash 478904614, now seen corresponding path program 1 times [2025-03-03 15:07:40,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:40,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671422654] [2025-03-03 15:07:40,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:40,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:40,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:07:40,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:07:40,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:40,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:40,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:40,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:40,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671422654] [2025-03-03 15:07:40,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671422654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:40,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:40,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:07:40,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436562449] [2025-03-03 15:07:40,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:40,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:07:40,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:40,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:07:40,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:07:40,520 INFO L87 Difference]: Start difference. First operand 185821 states and 235223 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:41,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:41,633 INFO L93 Difference]: Finished difference Result 297583 states and 378660 transitions. [2025-03-03 15:07:41,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:07:41,634 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-03 15:07:41,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:41,973 INFO L225 Difference]: With dead ends: 297583 [2025-03-03 15:07:41,973 INFO L226 Difference]: Without dead ends: 259493 [2025-03-03 15:07:42,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:07:42,038 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 1390 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1390 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:42,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1390 Valid, 1205 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:07:42,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259493 states. [2025-03-03 15:07:44,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259493 to 214821. [2025-03-03 15:07:44,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214821 states, 214820 states have (on average 1.2641606926729354) internal successors, (271567), 214820 states have internal predecessors, (271567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:44,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214821 states to 214821 states and 271567 transitions. [2025-03-03 15:07:44,637 INFO L78 Accepts]: Start accepts. Automaton has 214821 states and 271567 transitions. Word has length 97 [2025-03-03 15:07:44,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:44,637 INFO L471 AbstractCegarLoop]: Abstraction has 214821 states and 271567 transitions. [2025-03-03 15:07:44,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:44,638 INFO L276 IsEmpty]: Start isEmpty. Operand 214821 states and 271567 transitions. [2025-03-03 15:07:44,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:07:44,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:44,643 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:44,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 15:07:44,643 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:44,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:44,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1932494263, now seen corresponding path program 1 times [2025-03-03 15:07:44,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:44,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228978922] [2025-03-03 15:07:44,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:44,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:44,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:07:44,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:07:44,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:44,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:45,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:45,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:45,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228978922] [2025-03-03 15:07:45,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228978922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:45,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:45,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:07:45,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494498919] [2025-03-03 15:07:45,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:45,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:07:45,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:45,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:07:45,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:07:45,158 INFO L87 Difference]: Start difference. First operand 214821 states and 271567 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:45,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:45,868 INFO L93 Difference]: Finished difference Result 309751 states and 393420 transitions. [2025-03-03 15:07:45,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:07:45,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-03-03 15:07:45,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:46,235 INFO L225 Difference]: With dead ends: 309751 [2025-03-03 15:07:46,235 INFO L226 Difference]: Without dead ends: 271661 [2025-03-03 15:07:46,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:07:46,333 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 1396 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1396 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:46,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1396 Valid, 1205 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:46,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271661 states. [2025-03-03 15:07:48,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271661 to 243821. [2025-03-03 15:07:49,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243821 states, 243820 states have (on average 1.2628619473382003) internal successors, (307911), 243820 states have internal predecessors, (307911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:49,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243821 states to 243821 states and 307911 transitions. [2025-03-03 15:07:49,816 INFO L78 Accepts]: Start accepts. Automaton has 243821 states and 307911 transitions. Word has length 99 [2025-03-03 15:07:49,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:49,816 INFO L471 AbstractCegarLoop]: Abstraction has 243821 states and 307911 transitions. [2025-03-03 15:07:49,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:49,816 INFO L276 IsEmpty]: Start isEmpty. Operand 243821 states and 307911 transitions. [2025-03-03 15:07:49,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 15:07:49,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:49,838 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:49,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-03 15:07:49,838 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:49,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:49,839 INFO L85 PathProgramCache]: Analyzing trace with hash -434637792, now seen corresponding path program 1 times [2025-03-03 15:07:49,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:49,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133821472] [2025-03-03 15:07:49,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:49,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:49,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 15:07:49,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 15:07:49,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:49,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:50,064 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 15:07:50,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:50,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133821472] [2025-03-03 15:07:50,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133821472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:07:50,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039204706] [2025-03-03 15:07:50,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:50,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:07:50,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:07:50,070 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:07:50,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:07:50,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 15:07:50,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 15:07:50,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:50,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:50,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 15:07:50,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:07:50,807 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 15:07:50,808 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:07:50,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039204706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:50,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:07:50,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 12 [2025-03-03 15:07:50,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866165980] [2025-03-03 15:07:50,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:50,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:07:50,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:50,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:07:50,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:07:50,810 INFO L87 Difference]: Start difference. First operand 243821 states and 307911 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:53,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:53,285 INFO L93 Difference]: Finished difference Result 655958 states and 827882 transitions. [2025-03-03 15:07:53,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:07:53,285 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 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 121 [2025-03-03 15:07:53,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:54,087 INFO L225 Difference]: With dead ends: 655958 [2025-03-03 15:07:54,087 INFO L226 Difference]: Without dead ends: 556704 [2025-03-03 15:07:54,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:07:54,163 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 1403 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1403 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:54,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1403 Valid, 1303 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:07:54,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556704 states.