./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ed6e4196d49d75b29a7ddd297e9986c08c6bd65f18221f72f78571f381f483e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:04:44,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:04:44,232 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:04:44,236 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:04:44,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:04:44,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:04:44,258 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:04:44,259 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:04:44,259 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:04:44,259 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:04:44,260 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:04:44,260 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:04:44,260 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:04:44,260 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:04:44,261 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:04:44,261 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:04:44,261 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:04:44,261 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:04:44,261 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:04:44,261 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:04:44,261 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:04:44,261 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:04:44,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:04:44,262 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:04:44,262 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:04:44,262 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:04:44,262 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:04:44,262 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:04:44,262 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:04:44,262 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:04:44,262 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:04:44,262 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:04:44,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:04:44,263 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:04:44,263 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:04:44,263 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:04:44,263 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:04:44,263 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:04:44,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:04:44,263 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:04:44,263 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:04:44,263 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:04:44,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:04:44,264 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 -> 0ed6e4196d49d75b29a7ddd297e9986c08c6bd65f18221f72f78571f381f483e [2025-03-03 15:04:44,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:04:44,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:04:44,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:04:44,483 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:04:44,483 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:04:44,485 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.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2025-03-03 15:04:45,569 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd0cfc02d/b721cd2857774e1fa1be7cefe58ea0d7/FLAGcbc6e9c9f [2025-03-03 15:04:45,848 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:04:45,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2025-03-03 15:04:45,859 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd0cfc02d/b721cd2857774e1fa1be7cefe58ea0d7/FLAGcbc6e9c9f [2025-03-03 15:04:46,138 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd0cfc02d/b721cd2857774e1fa1be7cefe58ea0d7 [2025-03-03 15:04:46,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:04:46,140 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:04:46,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:04:46,141 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:04:46,144 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:04:46,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:04:46" (1/1) ... [2025-03-03 15:04:46,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f93eea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:04:46, skipping insertion in model container [2025-03-03 15:04:46,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:04:46" (1/1) ... [2025-03-03 15:04:46,187 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:04:46,383 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.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[8637,8650] [2025-03-03 15:04:46,418 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.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15862,15875] [2025-03-03 15:04:46,432 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.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[18059,18072] [2025-03-03 15:04:46,438 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.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[19083,19096] [2025-03-03 15:04:46,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:04:46,595 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:04:46,626 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.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[8637,8650] [2025-03-03 15:04:46,651 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.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15862,15875] [2025-03-03 15:04:46,658 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.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[18059,18072] [2025-03-03 15:04:46,662 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.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[19083,19096] [2025-03-03 15:04:46,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:04:46,766 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:04:46,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:04:46 WrapperNode [2025-03-03 15:04:46,768 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:04:46,769 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:04:46,769 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:04:46,769 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:04:46,773 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:04:46" (1/1) ... [2025-03-03 15:04:46,792 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:04:46" (1/1) ... [2025-03-03 15:04:46,847 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2847 [2025-03-03 15:04:46,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:04:46,848 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:04:46,848 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:04:46,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:04:46,855 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:04:46" (1/1) ... [2025-03-03 15:04:46,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:04:46" (1/1) ... [2025-03-03 15:04:46,868 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:04:46" (1/1) ... [2025-03-03 15:04:46,914 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:04:46,915 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:04:46" (1/1) ... [2025-03-03 15:04:46,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:04:46" (1/1) ... [2025-03-03 15:04:46,940 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:04:46" (1/1) ... [2025-03-03 15:04:46,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:04:46" (1/1) ... [2025-03-03 15:04:46,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:04:46" (1/1) ... [2025-03-03 15:04:46,965 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:04:46" (1/1) ... [2025-03-03 15:04:46,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:04:46,979 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:04:46,979 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:04:46,979 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:04:46,981 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:04:46" (1/1) ... [2025-03-03 15:04:46,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:04:46,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:04:47,010 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:04:47,013 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:04:47,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:04:47,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:04:47,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:04:47,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:04:47,186 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:04:47,187 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:04:48,514 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-03 15:04:48,514 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L828: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-03-03 15:04:48,514 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2282: havoc main_~main____CPAchecker_TMP_0~19#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~23#1;havoc main_~node3____CPAchecker_TMP_1~4#1; [2025-03-03 15:04:48,514 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L301: havoc main_~node2__m2~1#1; [2025-03-03 15:04:48,514 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L368: 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:04:48,514 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1624: havoc main_~node3__m3~6#1; [2025-03-03 15:04:48,514 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3474: havoc main_~main____CPAchecker_TMP_0~37#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~41#1; [2025-03-03 15:04:48,514 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3145: havoc main_~node3__m3~12#1; [2025-03-03 15:04:48,514 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3938: havoc main_~node3____CPAchecker_TMP_0~11#1; [2025-03-03 15:04:48,514 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4335: havoc main_~main____CPAchecker_TMP_0~51#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~55#1;havoc main_~node3____CPAchecker_TMP_1~12#1; [2025-03-03 15:04:48,514 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2089: havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~20#1; [2025-03-03 15:04:48,514 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2552: havoc main_~main____CPAchecker_TMP_0~23#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~27#1;havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-03-03 15:04:48,514 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3411: havoc main_~node2__m2~5#1;havoc main_~node1____CPAchecker_TMP_1~2#1; [2025-03-03 15:04:48,514 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L241: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:04:48,514 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3677: havoc main_~node3__m3~14#1; [2025-03-03 15:04:48,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2224: havoc main_~main____CPAchecker_TMP_0~18#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~22#1; [2025-03-03 15:04:48,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2687: havoc main_~main____CPAchecker_TMP_0~25#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~29#1; [2025-03-03 15:04:48,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1300: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-03 15:04:48,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4142: havoc main_~main____CPAchecker_TMP_0~48#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~52#1; [2025-03-03 15:04:48,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1634: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-03 15:04:48,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4277: havoc main_~main____CPAchecker_TMP_0~50#1;havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~54#1; [2025-03-03 15:04:48,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2031: havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~19#1;havoc main_~node3____CPAchecker_TMP_1~3#1; [2025-03-03 15:04:48,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L908: 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:04:48,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L512: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:04:48,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2494: havoc main_~main____CPAchecker_TMP_0~22#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~26#1; [2025-03-03 15:04:48,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3155: havoc main_~node3____CPAchecker_TMP_0~8#1; [2025-03-03 15:04:48,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1042: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-03 15:04:48,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3421: havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-03-03 15:04:48,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1175: 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:04:48,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:04:48,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2894: havoc main_~node3__m3~11#1;havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-03-03 15:04:48,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3687: havoc main_~node3____CPAchecker_TMP_0~10#1; [2025-03-03 15:04:48,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L318: havoc main_~node3__m3~1#1; [2025-03-03 15:04:48,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4084: havoc main_~main____CPAchecker_TMP_0~47#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~51#1;havoc main_~node3____CPAchecker_TMP_1~11#1; [2025-03-03 15:04:48,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1838: havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~16#1; [2025-03-03 15:04:48,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3359: havoc main_~main____CPAchecker_TMP_0~36#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~40#1; [2025-03-03 15:04:48,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2170: havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~21#1; [2025-03-03 15:04:48,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1973: havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~18#1; [2025-03-03 15:04:48,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1116: havoc main_~node2__m2~3#1; [2025-03-03 15:04:48,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3891: havoc main_~main____CPAchecker_TMP_0~44#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~48#1; [2025-03-03 15:04:48,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L390: havoc main_~node2__m2~2#1; [2025-03-03 15:04:48,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L192: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:04:48,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L655: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-03 15:04:48,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3430: havoc main_~node3__m3~13#1; [2025-03-03 15:04:48,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4223: havoc main_~main____CPAchecker_TMP_0~49#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~53#1; [2025-03-03 15:04:48,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2440: havoc main_~main____CPAchecker_TMP_0~21#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~25#1; [2025-03-03 15:04:48,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4026: havoc main_~main____CPAchecker_TMP_0~46#1;havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~50#1; [2025-03-03 15:04:48,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1780: havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~15#1;havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-03-03 15:04:48,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2904: havoc main_~node3____CPAchecker_TMP_0~7#1; [2025-03-03 15:04:48,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3301: havoc main_~main____CPAchecker_TMP_0~35#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~39#1;havoc main_~node3____CPAchecker_TMP_1~8#1; [2025-03-03 15:04:48,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2377: havoc main_~node2__m2~4#1; [2025-03-03 15:04:48,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L462: havoc main_~node1__m1~3#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-03 15:04:48,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2643: havoc main_~node3__m3~10#1; [2025-03-03 15:04:48,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3833: havoc main_~main____CPAchecker_TMP_0~43#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~47#1;havoc main_~node3____CPAchecker_TMP_1~10#1; [2025-03-03 15:04:48,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3108: havoc main_~main____CPAchecker_TMP_0~32#1;havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~36#1; [2025-03-03 15:04:48,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1919: havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~17#1; [2025-03-03 15:04:48,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L202: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:04:48,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1722: havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~14#1; [2025-03-03 15:04:48,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3440: havoc main_~node3____CPAchecker_TMP_0~9#1; [2025-03-03 15:04:48,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1591: havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-03-03 15:04:48,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3243: havoc main_~main____CPAchecker_TMP_0~34#1;havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~38#1; [2025-03-03 15:04:48,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L800: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-03 15:04:48,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3972: havoc main_~main____CPAchecker_TMP_0~45#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~49#1; [2025-03-03 15:04:48,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1330: havoc main_~check__tmp~9#1; [2025-03-03 15:04:48,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2387: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-03 15:04:48,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1000: 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:04:48,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3775: havoc main_~main____CPAchecker_TMP_0~42#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~46#1; [2025-03-03 15:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1133: havoc main_~node3__m3~4#1; [2025-03-03 15:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3644: havoc main_~main____CPAchecker_TMP_0~40#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~44#1; [2025-03-03 15:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2653: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-03-03 15:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1266: havoc main_~node3__m3~5#1; [2025-03-03 15:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3050: havoc main_~main____CPAchecker_TMP_0~31#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~35#1;havoc main_~node3____CPAchecker_TMP_1~7#1; [2025-03-03 15:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L540: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-03 15:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L408: havoc main_~node3__m3~2#1; [2025-03-03 15:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2126: havoc main_~node3__m3~8#1; [2025-03-03 15:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1533: havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1;havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-03 15:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L212: havoc main_~node2__m2~0#1; [2025-03-03 15:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L741: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-03 15:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2857: havoc main_~main____CPAchecker_TMP_0~28#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~32#1; [2025-03-03 15:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1668: havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~13#1; [2025-03-03 15:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4179: havoc main_~node3__m3~16#1; [2025-03-03 15:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2396: havoc main_~node3__m3~9#1; [2025-03-03 15:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3189: havoc main_~main____CPAchecker_TMP_0~33#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~37#1; [2025-03-03 15:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3586: havoc main_~main____CPAchecker_TMP_0~39#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~43#1;havoc main_~node3____CPAchecker_TMP_1~9#1; [2025-03-03 15:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L283: 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:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2992: havoc main_~main____CPAchecker_TMP_0~30#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~34#1; [2025-03-03 15:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3721: havoc main_~main____CPAchecker_TMP_0~41#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~45#1; [2025-03-03 15:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1475: 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:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2136: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-03 15:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L222: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2799: havoc main_~main____CPAchecker_TMP_0~27#1;havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~31#1;havoc main_~node3____CPAchecker_TMP_1~6#1; [2025-03-03 15:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1875: havoc main_~node3__m3~7#1;havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-03 15:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3528: havoc main_~main____CPAchecker_TMP_0~38#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~42#1; [2025-03-03 15:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4189: havoc main_~node3____CPAchecker_TMP_0~12#1; [2025-03-03 15:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2406: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-03-03 15:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2340: havoc main_~main____CPAchecker_TMP_0~20#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~24#1; [2025-03-03 15:04:48,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1217: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-03-03 15:04:48,518 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928: havoc main_~node3__m3~15#1;havoc main_~node2____CPAchecker_TMP_1~3#1; [2025-03-03 15:04:48,518 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2938: havoc main_~main____CPAchecker_TMP_0~29#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~33#1; [2025-03-03 15:04:48,518 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2741: havoc main_~main____CPAchecker_TMP_0~26#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~30#1; [2025-03-03 15:04:48,518 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L627: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:04:48,518 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L231: havoc main_~node3__m3~0#1; [2025-03-03 15:04:48,518 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4393: havoc main_~main____CPAchecker_TMP_0~52#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~56#1; [2025-03-03 15:04:48,518 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L958: havoc main_~node3__m3~3#1; [2025-03-03 15:04:48,518 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2610: havoc main_~main____CPAchecker_TMP_0~24#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~28#1; [2025-03-03 15:04:48,613 INFO L? ?]: Removed 486 outVars from TransFormulas that were not future-live. [2025-03-03 15:04:48,613 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:04:48,631 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:04:48,631 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:04:48,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:04:48 BoogieIcfgContainer [2025-03-03 15:04:48,631 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:04:48,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:04:48,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:04:48,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:04:48,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:04:46" (1/3) ... [2025-03-03 15:04:48,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669cc010 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:04:48, skipping insertion in model container [2025-03-03 15:04:48,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:04:46" (2/3) ... [2025-03-03 15:04:48,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669cc010 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:04:48, skipping insertion in model container [2025-03-03 15:04:48,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:04:48" (3/3) ... [2025-03-03 15:04:48,639 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2025-03-03 15:04:48,650 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:04:48,653 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c that has 1 procedures, 457 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-03 15:04:48,705 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:04:48,714 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;@71a92bc3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:04:48,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-03 15:04:48,720 INFO L276 IsEmpty]: Start isEmpty. Operand has 457 states, 452 states have (on average 1.8495575221238938) internal successors, (836), 456 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:48,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 15:04:48,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:48,733 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] [2025-03-03 15:04:48,733 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:04:48,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:48,738 INFO L85 PathProgramCache]: Analyzing trace with hash 692156089, now seen corresponding path program 1 times [2025-03-03 15:04:48,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:48,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342492398] [2025-03-03 15:04:48,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:48,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:48,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 15:04:48,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 15:04:48,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:48,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:49,098 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:04:49,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:49,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342492398] [2025-03-03 15:04:49,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342492398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:49,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:49,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:04:49,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761821092] [2025-03-03 15:04:49,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:49,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:04:49,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:49,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:04:49,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:04:49,123 INFO L87 Difference]: Start difference. First operand has 457 states, 452 states have (on average 1.8495575221238938) internal successors, (836), 456 states have internal predecessors, (836), 0 states have call successors, (0), 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 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:49,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:49,251 INFO L93 Difference]: Finished difference Result 713 states and 1249 transitions. [2025-03-03 15:04:49,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:04:49,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-03-03 15:04:49,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:49,260 INFO L225 Difference]: With dead ends: 713 [2025-03-03 15:04:49,260 INFO L226 Difference]: Without dead ends: 579 [2025-03-03 15:04:49,262 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:04:49,264 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 421 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:49,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1419 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:04:49,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-03-03 15:04:49,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 572. [2025-03-03 15:04:49,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 568 states have (on average 1.3433098591549295) internal successors, (763), 571 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 763 transitions. [2025-03-03 15:04:49,318 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 763 transitions. Word has length 51 [2025-03-03 15:04:49,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:49,319 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 763 transitions. [2025-03-03 15:04:49,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:49,319 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 763 transitions. [2025-03-03 15:04:49,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 15:04:49,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:49,321 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] [2025-03-03 15:04:49,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:04:49,322 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:04:49,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:49,322 INFO L85 PathProgramCache]: Analyzing trace with hash 51738873, now seen corresponding path program 1 times [2025-03-03 15:04:49,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:49,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464176898] [2025-03-03 15:04:49,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:49,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:49,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 15:04:49,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 15:04:49,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:49,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:49,556 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:04:49,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:49,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464176898] [2025-03-03 15:04:49,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464176898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:49,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:49,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:04:49,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908037754] [2025-03-03 15:04:49,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:49,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:04:49,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:49,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:04:49,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:04:49,560 INFO L87 Difference]: Start difference. First operand 572 states and 763 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:49,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:49,876 INFO L93 Difference]: Finished difference Result 1153 states and 1594 transitions. [2025-03-03 15:04:49,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:04:49,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-03-03 15:04:49,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:49,879 INFO L225 Difference]: With dead ends: 1153 [2025-03-03 15:04:49,879 INFO L226 Difference]: Without dead ends: 698 [2025-03-03 15:04:49,880 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:04:49,881 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 1742 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1742 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:49,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1742 Valid, 392 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:04:49,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-03-03 15:04:49,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 692. [2025-03-03 15:04:49,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 688 states have (on average 1.3924418604651163) internal successors, (958), 691 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:49,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 958 transitions. [2025-03-03 15:04:49,913 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 958 transitions. Word has length 51 [2025-03-03 15:04:49,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:49,913 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 958 transitions. [2025-03-03 15:04:49,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:49,914 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 958 transitions. [2025-03-03 15:04:49,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 15:04:49,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:49,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] [2025-03-03 15:04:49,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:04:49,915 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:04:49,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:49,916 INFO L85 PathProgramCache]: Analyzing trace with hash 2135862553, now seen corresponding path program 1 times [2025-03-03 15:04:49,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:49,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532420132] [2025-03-03 15:04:49,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:49,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:49,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 15:04:49,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 15:04:49,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:49,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:50,061 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:04:50,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:50,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532420132] [2025-03-03 15:04:50,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532420132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:50,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:50,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:04:50,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615671169] [2025-03-03 15:04:50,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:50,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:04:50,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:50,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:04:50,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:04:50,063 INFO L87 Difference]: Start difference. First operand 692 states and 958 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:50,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:50,325 INFO L93 Difference]: Finished difference Result 1389 states and 1957 transitions. [2025-03-03 15:04:50,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:04:50,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-03 15:04:50,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:50,329 INFO L225 Difference]: With dead ends: 1389 [2025-03-03 15:04:50,329 INFO L226 Difference]: Without dead ends: 847 [2025-03-03 15:04:50,330 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:04:50,331 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 1518 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:50,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 359 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:04:50,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2025-03-03 15:04:50,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 838. [2025-03-03 15:04:50,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 834 states have (on average 1.39568345323741) internal successors, (1164), 837 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:50,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1164 transitions. [2025-03-03 15:04:50,351 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1164 transitions. Word has length 52 [2025-03-03 15:04:50,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:50,352 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1164 transitions. [2025-03-03 15:04:50,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:50,353 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1164 transitions. [2025-03-03 15:04:50,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 15:04:50,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:50,354 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:04:50,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:04:50,354 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:04:50,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:50,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1355098429, now seen corresponding path program 1 times [2025-03-03 15:04:50,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:50,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903167351] [2025-03-03 15:04:50,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:50,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:50,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 15:04:50,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 15:04:50,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:50,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:50,430 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:04:50,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:50,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903167351] [2025-03-03 15:04:50,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903167351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:50,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:50,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:04:50,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685842949] [2025-03-03 15:04:50,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:50,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:04:50,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:50,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:04:50,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:04:50,431 INFO L87 Difference]: Start difference. First operand 838 states and 1164 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:50,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:50,473 INFO L93 Difference]: Finished difference Result 2023 states and 2865 transitions. [2025-03-03 15:04:50,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:04:50,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-03 15:04:50,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:50,478 INFO L225 Difference]: With dead ends: 2023 [2025-03-03 15:04:50,478 INFO L226 Difference]: Without dead ends: 1377 [2025-03-03 15:04:50,479 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:04:50,480 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 323 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:50,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 851 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:04:50,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2025-03-03 15:04:50,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1365. [2025-03-03 15:04:50,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1361 states have (on average 1.3864805290227773) internal successors, (1887), 1364 states have internal predecessors, (1887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:50,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1887 transitions. [2025-03-03 15:04:50,509 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1887 transitions. Word has length 52 [2025-03-03 15:04:50,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:50,510 INFO L471 AbstractCegarLoop]: Abstraction has 1365 states and 1887 transitions. [2025-03-03 15:04:50,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:50,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1887 transitions. [2025-03-03 15:04:50,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 15:04:50,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:50,513 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:04:50,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:04:50,513 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:04:50,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:50,513 INFO L85 PathProgramCache]: Analyzing trace with hash 636112114, now seen corresponding path program 1 times [2025-03-03 15:04:50,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:50,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512164260] [2025-03-03 15:04:50,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:50,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:50,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 15:04:50,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 15:04:50,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:50,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:50,644 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:04:50,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:50,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512164260] [2025-03-03 15:04:50,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512164260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:50,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:50,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:04:50,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186230848] [2025-03-03 15:04:50,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:50,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:04:50,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:50,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:04:50,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:04:50,645 INFO L87 Difference]: Start difference. First operand 1365 states and 1887 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:50,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:50,899 INFO L93 Difference]: Finished difference Result 3432 states and 4855 transitions. [2025-03-03 15:04:50,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:04:50,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-03 15:04:50,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:50,907 INFO L225 Difference]: With dead ends: 3432 [2025-03-03 15:04:50,907 INFO L226 Difference]: Without dead ends: 2221 [2025-03-03 15:04:50,912 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:04:50,913 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 1465 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:50,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 353 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:04:50,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2221 states. [2025-03-03 15:04:50,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2221 to 2215. [2025-03-03 15:04:50,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2215 states, 2211 states have (on average 1.4084124830393487) internal successors, (3114), 2214 states have internal predecessors, (3114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:50,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 3114 transitions. [2025-03-03 15:04:50,952 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 3114 transitions. Word has length 53 [2025-03-03 15:04:50,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:50,952 INFO L471 AbstractCegarLoop]: Abstraction has 2215 states and 3114 transitions. [2025-03-03 15:04:50,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:50,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 3114 transitions. [2025-03-03 15:04:50,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 15:04:50,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:50,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:04:50,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:04:50,954 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:04:50,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:50,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1789828269, now seen corresponding path program 1 times [2025-03-03 15:04:50,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:50,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669638892] [2025-03-03 15:04:50,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:50,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:50,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 15:04:50,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 15:04:50,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:50,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:51,036 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:04:51,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:51,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669638892] [2025-03-03 15:04:51,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669638892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:51,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:51,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:04:51,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355042436] [2025-03-03 15:04:51,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:51,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:04:51,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:51,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:04:51,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:04:51,037 INFO L87 Difference]: Start difference. First operand 2215 states and 3114 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:51,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:51,071 INFO L93 Difference]: Finished difference Result 4627 states and 6581 transitions. [2025-03-03 15:04:51,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:04:51,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-03 15:04:51,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:51,083 INFO L225 Difference]: With dead ends: 4627 [2025-03-03 15:04:51,083 INFO L226 Difference]: Without dead ends: 2984 [2025-03-03 15:04:51,086 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:04:51,088 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 245 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 711 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:04:51,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 711 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:04:51,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2025-03-03 15:04:51,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 2966. [2025-03-03 15:04:51,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2966 states, 2962 states have (on average 1.3902768399729912) internal successors, (4118), 2965 states have internal predecessors, (4118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:51,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2966 states and 4118 transitions. [2025-03-03 15:04:51,149 INFO L78 Accepts]: Start accepts. Automaton has 2966 states and 4118 transitions. Word has length 53 [2025-03-03 15:04:51,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:51,149 INFO L471 AbstractCegarLoop]: Abstraction has 2966 states and 4118 transitions. [2025-03-03 15:04:51,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:51,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2966 states and 4118 transitions. [2025-03-03 15:04:51,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 15:04:51,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:51,151 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] [2025-03-03 15:04:51,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:04:51,152 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:04:51,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:51,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1729728805, now seen corresponding path program 1 times [2025-03-03 15:04:51,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:51,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134650877] [2025-03-03 15:04:51,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:51,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:51,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 15:04:51,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 15:04:51,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:51,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:51,297 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:04:51,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:51,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134650877] [2025-03-03 15:04:51,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134650877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:51,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:51,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:04:51,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302281038] [2025-03-03 15:04:51,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:51,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:04:51,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:51,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:04:51,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:04:51,299 INFO L87 Difference]: Start difference. First operand 2966 states and 4118 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:51,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:51,617 INFO L93 Difference]: Finished difference Result 5867 states and 8228 transitions. [2025-03-03 15:04:51,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:04:51,617 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-03-03 15:04:51,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:51,629 INFO L225 Difference]: With dead ends: 5867 [2025-03-03 15:04:51,629 INFO L226 Difference]: Without dead ends: 4546 [2025-03-03 15:04:51,633 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:04:51,634 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 1715 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:51,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1715 Valid, 583 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:04:51,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4546 states. [2025-03-03 15:04:51,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4546 to 2980. [2025-03-03 15:04:51,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2980 states, 2976 states have (on average 1.3897849462365592) internal successors, (4136), 2979 states have internal predecessors, (4136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2980 states to 2980 states and 4136 transitions. [2025-03-03 15:04:51,736 INFO L78 Accepts]: Start accepts. Automaton has 2980 states and 4136 transitions. Word has length 54 [2025-03-03 15:04:51,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:51,737 INFO L471 AbstractCegarLoop]: Abstraction has 2980 states and 4136 transitions. [2025-03-03 15:04:51,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:51,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2980 states and 4136 transitions. [2025-03-03 15:04:51,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 15:04:51,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:51,739 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] [2025-03-03 15:04:51,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:04:51,739 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:04:51,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:51,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1813061798, now seen corresponding path program 1 times [2025-03-03 15:04:51,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:51,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373472652] [2025-03-03 15:04:51,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:51,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:51,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 15:04:51,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 15:04:51,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:51,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:51,870 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:04:51,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:51,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373472652] [2025-03-03 15:04:51,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373472652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:51,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:51,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:04:51,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632136928] [2025-03-03 15:04:51,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:51,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:04:51,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:51,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:04:51,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:04:51,872 INFO L87 Difference]: Start difference. First operand 2980 states and 4136 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:52,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:52,258 INFO L93 Difference]: Finished difference Result 6538 states and 9201 transitions. [2025-03-03 15:04:52,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:04:52,258 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-03-03 15:04:52,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:52,273 INFO L225 Difference]: With dead ends: 6538 [2025-03-03 15:04:52,273 INFO L226 Difference]: Without dead ends: 5420 [2025-03-03 15:04:52,277 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:04:52,281 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 1840 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1840 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:52,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1840 Valid, 618 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:04:52,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5420 states. [2025-03-03 15:04:52,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5420 to 3002. [2025-03-03 15:04:52,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3002 states, 2998 states have (on average 1.3899266177451635) internal successors, (4167), 3001 states have internal predecessors, (4167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3002 states to 3002 states and 4167 transitions. [2025-03-03 15:04:52,383 INFO L78 Accepts]: Start accepts. Automaton has 3002 states and 4167 transitions. Word has length 54 [2025-03-03 15:04:52,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:52,383 INFO L471 AbstractCegarLoop]: Abstraction has 3002 states and 4167 transitions. [2025-03-03 15:04:52,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:52,383 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states and 4167 transitions. [2025-03-03 15:04:52,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 15:04:52,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:52,385 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] [2025-03-03 15:04:52,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:04:52,385 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:04:52,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:52,386 INFO L85 PathProgramCache]: Analyzing trace with hash 467795619, now seen corresponding path program 1 times [2025-03-03 15:04:52,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:52,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98045043] [2025-03-03 15:04:52,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:52,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:52,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 15:04:52,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 15:04:52,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:52,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:52,514 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:04:52,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:52,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98045043] [2025-03-03 15:04:52,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98045043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:52,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:52,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:04:52,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738599644] [2025-03-03 15:04:52,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:52,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:04:52,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:52,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:04:52,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:04:52,515 INFO L87 Difference]: Start difference. First operand 3002 states and 4167 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:52,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:52,925 INFO L93 Difference]: Finished difference Result 7320 states and 10266 transitions. [2025-03-03 15:04:52,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:04:52,925 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-03-03 15:04:52,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:52,941 INFO L225 Difference]: With dead ends: 7320 [2025-03-03 15:04:52,941 INFO L226 Difference]: Without dead ends: 6352 [2025-03-03 15:04:52,945 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:04:52,947 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 1962 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1962 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:52,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1962 Valid, 632 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:04:52,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6352 states. [2025-03-03 15:04:53,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6352 to 3036. [2025-03-03 15:04:53,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3036 states, 3032 states have (on average 1.3888522427440633) internal successors, (4211), 3035 states have internal predecessors, (4211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:53,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 4211 transitions. [2025-03-03 15:04:53,027 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 4211 transitions. Word has length 54 [2025-03-03 15:04:53,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:53,027 INFO L471 AbstractCegarLoop]: Abstraction has 3036 states and 4211 transitions. [2025-03-03 15:04:53,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:53,027 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 4211 transitions. [2025-03-03 15:04:53,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 15:04:53,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:53,029 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:04:53,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:04:53,030 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:04:53,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:53,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1402362578, now seen corresponding path program 1 times [2025-03-03 15:04:53,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:53,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786541343] [2025-03-03 15:04:53,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:53,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:53,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 15:04:53,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 15:04:53,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:53,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:53,304 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:04:53,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:53,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786541343] [2025-03-03 15:04:53,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786541343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:53,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:53,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:04:53,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743115283] [2025-03-03 15:04:53,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:53,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:04:53,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:53,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:04:53,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:04:53,306 INFO L87 Difference]: Start difference. First operand 3036 states and 4211 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:53,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:53,735 INFO L93 Difference]: Finished difference Result 6220 states and 8782 transitions. [2025-03-03 15:04:53,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:04:53,736 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-03 15:04:53,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:53,751 INFO L225 Difference]: With dead ends: 6220 [2025-03-03 15:04:53,753 INFO L226 Difference]: Without dead ends: 4259 [2025-03-03 15:04:53,757 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:04:53,757 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 1670 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1670 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:53,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1670 Valid, 950 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:04:53,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4259 states. [2025-03-03 15:04:53,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4259 to 2949. [2025-03-03 15:04:53,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2945 states have (on average 1.3884550084889644) internal successors, (4089), 2948 states have internal predecessors, (4089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:53,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 4089 transitions. [2025-03-03 15:04:53,798 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 4089 transitions. Word has length 55 [2025-03-03 15:04:53,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:53,799 INFO L471 AbstractCegarLoop]: Abstraction has 2949 states and 4089 transitions. [2025-03-03 15:04:53,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:53,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 4089 transitions. [2025-03-03 15:04:53,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 15:04:53,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:53,800 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:04:53,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:04:53,800 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:04:53,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:53,801 INFO L85 PathProgramCache]: Analyzing trace with hash 496768009, now seen corresponding path program 1 times [2025-03-03 15:04:53,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:53,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137739438] [2025-03-03 15:04:53,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:53,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:53,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 15:04:53,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 15:04:53,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:53,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:54,017 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:04:54,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:54,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137739438] [2025-03-03 15:04:54,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137739438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:54,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:54,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:04:54,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494454190] [2025-03-03 15:04:54,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:54,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:04:54,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:54,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:04:54,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:04:54,019 INFO L87 Difference]: Start difference. First operand 2949 states and 4089 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:54,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:54,566 INFO L93 Difference]: Finished difference Result 5928 states and 8313 transitions. [2025-03-03 15:04:54,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:04:54,566 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-03 15:04:54,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:54,573 INFO L225 Difference]: With dead ends: 5928 [2025-03-03 15:04:54,573 INFO L226 Difference]: Without dead ends: 4121 [2025-03-03 15:04:54,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:04:54,576 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 1694 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1694 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:54,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1694 Valid, 1195 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:04:54,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4121 states. [2025-03-03 15:04:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4121 to 2920. [2025-03-03 15:04:54,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2916 states have (on average 1.3882030178326474) internal successors, (4048), 2919 states have internal predecessors, (4048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:54,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4048 transitions. [2025-03-03 15:04:54,632 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4048 transitions. Word has length 55 [2025-03-03 15:04:54,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:54,632 INFO L471 AbstractCegarLoop]: Abstraction has 2920 states and 4048 transitions. [2025-03-03 15:04:54,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:54,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4048 transitions. [2025-03-03 15:04:54,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 15:04:54,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:54,634 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:04:54,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:04:54,634 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:04:54,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:54,635 INFO L85 PathProgramCache]: Analyzing trace with hash 761945362, now seen corresponding path program 1 times [2025-03-03 15:04:54,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:54,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703452445] [2025-03-03 15:04:54,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:54,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:54,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 15:04:54,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 15:04:54,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:54,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:54,826 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:04:54,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:54,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703452445] [2025-03-03 15:04:54,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703452445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:54,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:54,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:04:54,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145177409] [2025-03-03 15:04:54,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:54,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:04:54,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:54,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:04:54,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:04:54,828 INFO L87 Difference]: Start difference. First operand 2920 states and 4048 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:55,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:55,278 INFO L93 Difference]: Finished difference Result 4382 states and 6098 transitions. [2025-03-03 15:04:55,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:04:55,278 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-03 15:04:55,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:55,285 INFO L225 Difference]: With dead ends: 4382 [2025-03-03 15:04:55,285 INFO L226 Difference]: Without dead ends: 4377 [2025-03-03 15:04:55,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:04:55,287 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 2021 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2021 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:55,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2021 Valid, 1069 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:04:55,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4377 states. [2025-03-03 15:04:55,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4377 to 2920. [2025-03-03 15:04:55,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2916 states have (on average 1.387517146776406) internal successors, (4046), 2919 states have internal predecessors, (4046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:55,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4046 transitions. [2025-03-03 15:04:55,328 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4046 transitions. Word has length 55 [2025-03-03 15:04:55,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:55,329 INFO L471 AbstractCegarLoop]: Abstraction has 2920 states and 4046 transitions. [2025-03-03 15:04:55,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:55,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4046 transitions. [2025-03-03 15:04:55,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 15:04:55,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:55,331 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] [2025-03-03 15:04:55,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:04:55,331 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:04:55,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:55,331 INFO L85 PathProgramCache]: Analyzing trace with hash 930432667, now seen corresponding path program 1 times [2025-03-03 15:04:55,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:55,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283089129] [2025-03-03 15:04:55,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:55,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:55,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 15:04:55,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 15:04:55,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:55,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:55,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:04:55,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:55,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283089129] [2025-03-03 15:04:55,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283089129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:55,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:55,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:04:55,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548346145] [2025-03-03 15:04:55,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:55,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:04:55,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:55,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:04:55,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:04:55,376 INFO L87 Difference]: Start difference. First operand 2920 states and 4046 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:55,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:55,401 INFO L93 Difference]: Finished difference Result 4010 states and 5564 transitions. [2025-03-03 15:04:55,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:04:55,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-03 15:04:55,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:55,406 INFO L225 Difference]: With dead ends: 4010 [2025-03-03 15:04:55,406 INFO L226 Difference]: Without dead ends: 2911 [2025-03-03 15:04:55,408 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:04:55,408 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 259 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:55,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 813 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:04:55,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2025-03-03 15:04:55,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2905. [2025-03-03 15:04:55,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2905 states, 2901 states have (on average 1.3602206135815236) internal successors, (3946), 2904 states have internal predecessors, (3946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:55,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2905 states and 3946 transitions. [2025-03-03 15:04:55,453 INFO L78 Accepts]: Start accepts. Automaton has 2905 states and 3946 transitions. Word has length 56 [2025-03-03 15:04:55,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:55,453 INFO L471 AbstractCegarLoop]: Abstraction has 2905 states and 3946 transitions. [2025-03-03 15:04:55,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:55,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 3946 transitions. [2025-03-03 15:04:55,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 15:04:55,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:55,455 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] [2025-03-03 15:04:55,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:04:55,455 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:04:55,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:55,456 INFO L85 PathProgramCache]: Analyzing trace with hash 125999415, now seen corresponding path program 1 times [2025-03-03 15:04:55,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:55,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923580225] [2025-03-03 15:04:55,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:55,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:55,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 15:04:55,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 15:04:55,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:55,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:55,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:04:55,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:55,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923580225] [2025-03-03 15:04:55,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923580225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:55,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:55,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:04:55,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590828102] [2025-03-03 15:04:55,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:55,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:04:55,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:55,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:04:55,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:04:55,503 INFO L87 Difference]: Start difference. First operand 2905 states and 3946 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:55,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:55,527 INFO L93 Difference]: Finished difference Result 4240 states and 5806 transitions. [2025-03-03 15:04:55,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:04:55,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-03 15:04:55,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:55,531 INFO L225 Difference]: With dead ends: 4240 [2025-03-03 15:04:55,532 INFO L226 Difference]: Without dead ends: 2911 [2025-03-03 15:04:55,533 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:04:55,533 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 240 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 811 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:04:55,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 811 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:04:55,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2025-03-03 15:04:55,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2905. [2025-03-03 15:04:55,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2905 states, 2901 states have (on average 1.3478110996208204) internal successors, (3910), 2904 states have internal predecessors, (3910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:55,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2905 states and 3910 transitions. [2025-03-03 15:04:55,559 INFO L78 Accepts]: Start accepts. Automaton has 2905 states and 3910 transitions. Word has length 56 [2025-03-03 15:04:55,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:55,559 INFO L471 AbstractCegarLoop]: Abstraction has 2905 states and 3910 transitions. [2025-03-03 15:04:55,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:55,559 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 3910 transitions. [2025-03-03 15:04:55,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 15:04:55,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:55,561 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] [2025-03-03 15:04:55,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:04:55,561 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:04:55,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:55,561 INFO L85 PathProgramCache]: Analyzing trace with hash -2108801605, now seen corresponding path program 1 times [2025-03-03 15:04:55,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:55,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870791663] [2025-03-03 15:04:55,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:55,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:55,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 15:04:55,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 15:04:55,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:55,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:55,606 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:04:55,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:55,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870791663] [2025-03-03 15:04:55,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870791663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:55,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:55,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:04:55,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804435914] [2025-03-03 15:04:55,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:55,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:04:55,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:55,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:04:55,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:04:55,607 INFO L87 Difference]: Start difference. First operand 2905 states and 3910 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:55,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:55,643 INFO L93 Difference]: Finished difference Result 4163 states and 5648 transitions. [2025-03-03 15:04:55,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:04:55,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-03 15:04:55,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:55,647 INFO L225 Difference]: With dead ends: 4163 [2025-03-03 15:04:55,647 INFO L226 Difference]: Without dead ends: 2912 [2025-03-03 15:04:55,649 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:04:55,649 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 224 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:55,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 809 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:04:55,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2025-03-03 15:04:55,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 2905. [2025-03-03 15:04:55,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2905 states, 2901 states have (on average 1.3340227507755946) internal successors, (3870), 2904 states have internal predecessors, (3870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:55,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2905 states and 3870 transitions. [2025-03-03 15:04:55,674 INFO L78 Accepts]: Start accepts. Automaton has 2905 states and 3870 transitions. Word has length 56 [2025-03-03 15:04:55,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:55,674 INFO L471 AbstractCegarLoop]: Abstraction has 2905 states and 3870 transitions. [2025-03-03 15:04:55,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:55,675 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 3870 transitions. [2025-03-03 15:04:55,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 15:04:55,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:55,676 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] [2025-03-03 15:04:55,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:04:55,677 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:04:55,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:55,677 INFO L85 PathProgramCache]: Analyzing trace with hash 369426516, now seen corresponding path program 1 times [2025-03-03 15:04:55,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:55,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662962029] [2025-03-03 15:04:55,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:55,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:55,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 15:04:55,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 15:04:55,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:55,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:55,714 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:04:55,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:55,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662962029] [2025-03-03 15:04:55,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662962029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:55,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:55,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:04:55,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462392213] [2025-03-03 15:04:55,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:55,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:04:55,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:55,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:04:55,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:04:55,716 INFO L87 Difference]: Start difference. First operand 2905 states and 3870 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:55,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:55,766 INFO L93 Difference]: Finished difference Result 4583 states and 6152 transitions. [2025-03-03 15:04:55,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:04:55,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 15:04:55,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:55,771 INFO L225 Difference]: With dead ends: 4583 [2025-03-03 15:04:55,771 INFO L226 Difference]: Without dead ends: 3323 [2025-03-03 15:04:55,772 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:04:55,773 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 324 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:55,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 532 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:04:55,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2025-03-03 15:04:55,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 2723. [2025-03-03 15:04:55,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2723 states, 2719 states have (on average 1.3365207796984184) internal successors, (3634), 2722 states have internal predecessors, (3634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:55,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 3634 transitions. [2025-03-03 15:04:55,799 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 3634 transitions. Word has length 57 [2025-03-03 15:04:55,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:55,799 INFO L471 AbstractCegarLoop]: Abstraction has 2723 states and 3634 transitions. [2025-03-03 15:04:55,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:55,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3634 transitions. [2025-03-03 15:04:55,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 15:04:55,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:55,801 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] [2025-03-03 15:04:55,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:04:55,801 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:04:55,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:55,801 INFO L85 PathProgramCache]: Analyzing trace with hash 522032144, now seen corresponding path program 1 times [2025-03-03 15:04:55,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:55,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583429809] [2025-03-03 15:04:55,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:55,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:55,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 15:04:55,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 15:04:55,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:55,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:55,846 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:04:55,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:55,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583429809] [2025-03-03 15:04:55,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583429809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:55,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:55,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:04:55,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192078411] [2025-03-03 15:04:55,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:55,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:04:55,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:55,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:04:55,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:04:55,848 INFO L87 Difference]: Start difference. First operand 2723 states and 3634 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:55,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:55,908 INFO L93 Difference]: Finished difference Result 5002 states and 6723 transitions. [2025-03-03 15:04:55,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:04:55,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-03 15:04:55,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:55,913 INFO L225 Difference]: With dead ends: 5002 [2025-03-03 15:04:55,913 INFO L226 Difference]: Without dead ends: 3341 [2025-03-03 15:04:55,915 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:04:55,916 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 300 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:55,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 459 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:04:55,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3341 states. [2025-03-03 15:04:55,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3341 to 2587. [2025-03-03 15:04:55,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2587 states, 2583 states have (on average 1.3387533875338753) internal successors, (3458), 2586 states have internal predecessors, (3458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:55,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2587 states to 2587 states and 3458 transitions. [2025-03-03 15:04:55,940 INFO L78 Accepts]: Start accepts. Automaton has 2587 states and 3458 transitions. Word has length 58 [2025-03-03 15:04:55,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:55,941 INFO L471 AbstractCegarLoop]: Abstraction has 2587 states and 3458 transitions. [2025-03-03 15:04:55,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:55,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2587 states and 3458 transitions. [2025-03-03 15:04:55,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 15:04:55,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:55,942 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] [2025-03-03 15:04:55,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:04:55,943 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:04:55,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:55,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1877891216, now seen corresponding path program 1 times [2025-03-03 15:04:55,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:55,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44429267] [2025-03-03 15:04:55,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:55,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:55,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 15:04:55,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 15:04:55,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:55,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:56,395 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:04:56,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:56,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44429267] [2025-03-03 15:04:56,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44429267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:56,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:56,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:04:56,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602766499] [2025-03-03 15:04:56,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:56,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:04:56,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:56,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:04:56,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:04:56,396 INFO L87 Difference]: Start difference. First operand 2587 states and 3458 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:56,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:56,957 INFO L93 Difference]: Finished difference Result 4530 states and 6118 transitions. [2025-03-03 15:04:56,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:04:56,958 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-03 15:04:56,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:56,964 INFO L225 Difference]: With dead ends: 4530 [2025-03-03 15:04:56,964 INFO L226 Difference]: Without dead ends: 4162 [2025-03-03 15:04:56,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:04:56,966 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 1830 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1830 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:56,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1830 Valid, 1571 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:04:56,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4162 states. [2025-03-03 15:04:57,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4162 to 2524. [2025-03-03 15:04:57,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2524 states, 2522 states have (on average 1.3409992069785883) internal successors, (3382), 2523 states have internal predecessors, (3382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:57,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2524 states to 2524 states and 3382 transitions. [2025-03-03 15:04:57,010 INFO L78 Accepts]: Start accepts. Automaton has 2524 states and 3382 transitions. Word has length 58 [2025-03-03 15:04:57,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:57,010 INFO L471 AbstractCegarLoop]: Abstraction has 2524 states and 3382 transitions. [2025-03-03 15:04:57,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:57,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2524 states and 3382 transitions. [2025-03-03 15:04:57,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 15:04:57,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:57,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:04:57,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:04:57,012 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:04:57,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:57,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1984154437, now seen corresponding path program 1 times [2025-03-03 15:04:57,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:57,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168595265] [2025-03-03 15:04:57,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:57,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:57,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 15:04:57,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 15:04:57,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:57,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:57,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:04:57,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:57,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168595265] [2025-03-03 15:04:57,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168595265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:57,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:57,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:04:57,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811911583] [2025-03-03 15:04:57,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:57,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:04:57,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:57,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:04:57,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:04:57,481 INFO L87 Difference]: Start difference. First operand 2524 states and 3382 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:58,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:58,322 INFO L93 Difference]: Finished difference Result 5238 states and 7121 transitions. [2025-03-03 15:04:58,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 15:04:58,322 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-03 15:04:58,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:58,330 INFO L225 Difference]: With dead ends: 5238 [2025-03-03 15:04:58,330 INFO L226 Difference]: Without dead ends: 4832 [2025-03-03 15:04:58,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2025-03-03 15:04:58,332 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 1714 mSDsluCounter, 2273 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1714 SdHoareTripleChecker+Valid, 2521 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:58,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1714 Valid, 2521 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:04:58,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4832 states. [2025-03-03 15:04:58,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4832 to 2478. [2025-03-03 15:04:58,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2478 states, 2477 states have (on average 1.342349616471538) internal successors, (3325), 2477 states have internal predecessors, (3325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:58,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 3325 transitions. [2025-03-03 15:04:58,379 INFO L78 Accepts]: Start accepts. Automaton has 2478 states and 3325 transitions. Word has length 58 [2025-03-03 15:04:58,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:58,379 INFO L471 AbstractCegarLoop]: Abstraction has 2478 states and 3325 transitions. [2025-03-03 15:04:58,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:58,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 3325 transitions. [2025-03-03 15:04:58,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:04:58,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:58,382 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:04:58,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:04:58,383 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:04:58,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:58,383 INFO L85 PathProgramCache]: Analyzing trace with hash 994384137, now seen corresponding path program 1 times [2025-03-03 15:04:58,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:58,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263408032] [2025-03-03 15:04:58,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:58,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:58,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:04:58,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:04:58,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:58,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:58,475 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:04:58,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:58,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263408032] [2025-03-03 15:04:58,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263408032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:58,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:58,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:04:58,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37647342] [2025-03-03 15:04:58,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:58,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:04:58,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:58,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:04:58,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:04:58,477 INFO L87 Difference]: Start difference. First operand 2478 states and 3325 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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:04:58,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:58,542 INFO L93 Difference]: Finished difference Result 6001 states and 8265 transitions. [2025-03-03 15:04:58,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:04:58,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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:04:58,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:58,548 INFO L225 Difference]: With dead ends: 6001 [2025-03-03 15:04:58,549 INFO L226 Difference]: Without dead ends: 4490 [2025-03-03 15:04:58,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:04:58,551 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 1041 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:58,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 761 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:04:58,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2025-03-03 15:04:58,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 3841. [2025-03-03 15:04:58,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3841 states, 3840 states have (on average 1.3432291666666667) internal successors, (5158), 3840 states have internal predecessors, (5158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:58,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 5158 transitions. [2025-03-03 15:04:58,588 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 5158 transitions. Word has length 68 [2025-03-03 15:04:58,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:58,588 INFO L471 AbstractCegarLoop]: Abstraction has 3841 states and 5158 transitions. [2025-03-03 15:04:58,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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:04:58,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 5158 transitions. [2025-03-03 15:04:58,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:04:58,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:58,592 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:04:58,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:04:58,593 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:04:58,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:58,594 INFO L85 PathProgramCache]: Analyzing trace with hash 790723175, now seen corresponding path program 1 times [2025-03-03 15:04:58,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:58,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300950706] [2025-03-03 15:04:58,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:58,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:58,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:04:58,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:04:58,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:58,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:58,680 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:04:58,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:58,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300950706] [2025-03-03 15:04:58,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300950706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:58,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:58,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:04:58,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659239784] [2025-03-03 15:04:58,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:58,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:04:58,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:58,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:04:58,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:04:58,683 INFO L87 Difference]: Start difference. First operand 3841 states and 5158 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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:04:58,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:58,737 INFO L93 Difference]: Finished difference Result 3847 states and 5161 transitions. [2025-03-03 15:04:58,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:04:58,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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:04:58,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:58,742 INFO L225 Difference]: With dead ends: 3847 [2025-03-03 15:04:58,742 INFO L226 Difference]: Without dead ends: 3376 [2025-03-03 15:04:58,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:04:58,745 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 672 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:58,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 756 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:04:58,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3376 states. [2025-03-03 15:04:58,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3376 to 3372. [2025-03-03 15:04:58,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3372 states, 3371 states have (on average 1.3479679620290714) internal successors, (4544), 3371 states have internal predecessors, (4544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:58,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3372 states to 3372 states and 4544 transitions. [2025-03-03 15:04:58,778 INFO L78 Accepts]: Start accepts. Automaton has 3372 states and 4544 transitions. Word has length 69 [2025-03-03 15:04:58,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:58,779 INFO L471 AbstractCegarLoop]: Abstraction has 3372 states and 4544 transitions. [2025-03-03 15:04:58,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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:04:58,779 INFO L276 IsEmpty]: Start isEmpty. Operand 3372 states and 4544 transitions. [2025-03-03 15:04:58,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:04:58,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:58,782 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:04:58,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:04:58,782 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:04:58,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:58,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1632978968, now seen corresponding path program 1 times [2025-03-03 15:04:58,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:58,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334107674] [2025-03-03 15:04:58,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:58,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:58,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:04:58,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:04:58,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:58,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:58,864 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:04:58,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:58,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334107674] [2025-03-03 15:04:58,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334107674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:58,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:58,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:04:58,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631288672] [2025-03-03 15:04:58,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:58,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:04:58,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:58,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:04:58,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:04:58,866 INFO L87 Difference]: Start difference. First operand 3372 states and 4544 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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:04:58,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:58,896 INFO L93 Difference]: Finished difference Result 7984 states and 10890 transitions. [2025-03-03 15:04:58,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:04:58,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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:04:58,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:58,906 INFO L225 Difference]: With dead ends: 7984 [2025-03-03 15:04:58,906 INFO L226 Difference]: Without dead ends: 5374 [2025-03-03 15:04:58,909 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:04:58,910 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 122 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 561 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:04:58,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 561 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:04:58,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5374 states. [2025-03-03 15:04:58,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5374 to 5056. [2025-03-03 15:04:58,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5056 states, 5055 states have (on average 1.3404549950544016) internal successors, (6776), 5055 states have internal predecessors, (6776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:58,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5056 states to 5056 states and 6776 transitions. [2025-03-03 15:04:58,991 INFO L78 Accepts]: Start accepts. Automaton has 5056 states and 6776 transitions. Word has length 70 [2025-03-03 15:04:58,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:58,991 INFO L471 AbstractCegarLoop]: Abstraction has 5056 states and 6776 transitions. [2025-03-03 15:04:58,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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:04:58,991 INFO L276 IsEmpty]: Start isEmpty. Operand 5056 states and 6776 transitions. [2025-03-03 15:04:58,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:04:58,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:58,994 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:04:58,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:04:58,994 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:04:58,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:58,994 INFO L85 PathProgramCache]: Analyzing trace with hash 106887474, now seen corresponding path program 1 times [2025-03-03 15:04:58,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:58,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751014275] [2025-03-03 15:04:58,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:58,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:59,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:04:59,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:04:59,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:59,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:59,082 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:04:59,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:59,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751014275] [2025-03-03 15:04:59,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751014275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:59,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:59,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:04:59,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733905958] [2025-03-03 15:04:59,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:59,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:04:59,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:59,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:04:59,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:04:59,083 INFO L87 Difference]: Start difference. First operand 5056 states and 6776 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:04:59,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:59,125 INFO L93 Difference]: Finished difference Result 13176 states and 17878 transitions. [2025-03-03 15:04:59,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:04:59,126 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:04:59,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:59,139 INFO L225 Difference]: With dead ends: 13176 [2025-03-03 15:04:59,140 INFO L226 Difference]: Without dead ends: 8916 [2025-03-03 15:04:59,145 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:04:59,146 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 111 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:59,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 549 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:04:59,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8916 states. [2025-03-03 15:04:59,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8916 to 8178. [2025-03-03 15:04:59,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8178 states, 8177 states have (on average 1.3410786351962822) internal successors, (10966), 8177 states have internal predecessors, (10966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:59,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8178 states to 8178 states and 10966 transitions. [2025-03-03 15:04:59,233 INFO L78 Accepts]: Start accepts. Automaton has 8178 states and 10966 transitions. Word has length 71 [2025-03-03 15:04:59,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:59,234 INFO L471 AbstractCegarLoop]: Abstraction has 8178 states and 10966 transitions. [2025-03-03 15:04:59,234 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:04:59,234 INFO L276 IsEmpty]: Start isEmpty. Operand 8178 states and 10966 transitions. [2025-03-03 15:04:59,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 15:04:59,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:59,236 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:04:59,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:04:59,237 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:04:59,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:59,237 INFO L85 PathProgramCache]: Analyzing trace with hash 643974055, now seen corresponding path program 1 times [2025-03-03 15:04:59,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:59,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957081562] [2025-03-03 15:04:59,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:59,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:59,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 15:04:59,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 15:04:59,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:59,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:59,324 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:04:59,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:59,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957081562] [2025-03-03 15:04:59,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957081562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:59,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:59,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:04:59,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523585207] [2025-03-03 15:04:59,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:59,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:04:59,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:59,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:04:59,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:04:59,326 INFO L87 Difference]: Start difference. First operand 8178 states and 10966 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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:04:59,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:59,390 INFO L93 Difference]: Finished difference Result 22142 states and 29840 transitions. [2025-03-03 15:04:59,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:04:59,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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:04:59,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:59,419 INFO L225 Difference]: With dead ends: 22142 [2025-03-03 15:04:59,428 INFO L226 Difference]: Without dead ends: 14760 [2025-03-03 15:04:59,438 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:04:59,439 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 98 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:59,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 533 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:04:59,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14760 states. [2025-03-03 15:04:59,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14760 to 13542. [2025-03-03 15:04:59,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13542 states, 13541 states have (on average 1.334170297614652) internal successors, (18066), 13541 states have internal predecessors, (18066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:59,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13542 states to 13542 states and 18066 transitions. [2025-03-03 15:04:59,612 INFO L78 Accepts]: Start accepts. Automaton has 13542 states and 18066 transitions. Word has length 73 [2025-03-03 15:04:59,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:59,613 INFO L471 AbstractCegarLoop]: Abstraction has 13542 states and 18066 transitions. [2025-03-03 15:04:59,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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:04:59,613 INFO L276 IsEmpty]: Start isEmpty. Operand 13542 states and 18066 transitions. [2025-03-03 15:04:59,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:04:59,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:59,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:04:59,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:04:59,615 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:04:59,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:59,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1143784379, now seen corresponding path program 1 times [2025-03-03 15:04:59,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:59,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253353538] [2025-03-03 15:04:59,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:59,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:59,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:04:59,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:04:59,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:59,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:59,794 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:04:59,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:59,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253353538] [2025-03-03 15:04:59,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253353538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:59,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:59,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:04:59,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189251109] [2025-03-03 15:04:59,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:59,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:04:59,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:59,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:04:59,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:04:59,796 INFO L87 Difference]: Start difference. First operand 13542 states and 18066 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:59,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:59,853 INFO L93 Difference]: Finished difference Result 14888 states and 19859 transitions. [2025-03-03 15:04:59,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:04:59,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-03 15:04:59,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:59,878 INFO L225 Difference]: With dead ends: 14888 [2025-03-03 15:04:59,878 INFO L226 Difference]: Without dead ends: 14886 [2025-03-03 15:04:59,884 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:04:59,884 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 0 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:59,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1299 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:04:59,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14886 states. [2025-03-03 15:05:00,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14886 to 14886. [2025-03-03 15:05:00,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14886 states, 14885 states have (on average 1.3039973127309372) internal successors, (19410), 14885 states have internal predecessors, (19410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:00,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14886 states to 14886 states and 19410 transitions. [2025-03-03 15:05:00,116 INFO L78 Accepts]: Start accepts. Automaton has 14886 states and 19410 transitions. Word has length 75 [2025-03-03 15:05:00,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:00,117 INFO L471 AbstractCegarLoop]: Abstraction has 14886 states and 19410 transitions. [2025-03-03 15:05:00,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:00,118 INFO L276 IsEmpty]: Start isEmpty. Operand 14886 states and 19410 transitions. [2025-03-03 15:05:00,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 15:05:00,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:00,120 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:05:00,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:05:00,120 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:05:00,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:00,121 INFO L85 PathProgramCache]: Analyzing trace with hash -949780693, now seen corresponding path program 1 times [2025-03-03 15:05:00,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:00,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870301580] [2025-03-03 15:05:00,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:00,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:00,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 15:05:00,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 15:05:00,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:00,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:00,160 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:05:00,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:00,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870301580] [2025-03-03 15:05:00,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870301580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:00,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:00,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:00,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834262909] [2025-03-03 15:05:00,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:00,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:00,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:00,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:00,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:00,162 INFO L87 Difference]: Start difference. First operand 14886 states and 19410 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:05:00,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:00,239 INFO L93 Difference]: Finished difference Result 36082 states and 47004 transitions. [2025-03-03 15:05:00,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:00,240 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:05:00,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:00,275 INFO L225 Difference]: With dead ends: 36082 [2025-03-03 15:05:00,275 INFO L226 Difference]: Without dead ends: 21992 [2025-03-03 15:05:00,289 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:05:00,290 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 196 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:00,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 404 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:00,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21992 states. [2025-03-03 15:05:00,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21992 to 21990. [2025-03-03 15:05:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21990 states, 21989 states have (on average 1.2865523670926373) internal successors, (28290), 21989 states have internal predecessors, (28290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:00,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21990 states to 21990 states and 28290 transitions. [2025-03-03 15:05:00,497 INFO L78 Accepts]: Start accepts. Automaton has 21990 states and 28290 transitions. Word has length 76 [2025-03-03 15:05:00,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:00,498 INFO L471 AbstractCegarLoop]: Abstraction has 21990 states and 28290 transitions. [2025-03-03 15:05:00,498 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:05:00,498 INFO L276 IsEmpty]: Start isEmpty. Operand 21990 states and 28290 transitions. [2025-03-03 15:05:00,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:05:00,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:00,500 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:05:00,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:05:00,500 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:05:00,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:00,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2095661317, now seen corresponding path program 1 times [2025-03-03 15:05:00,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:00,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914995937] [2025-03-03 15:05:00,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:00,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:00,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:05:00,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:05:00,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:00,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:00,667 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:05:00,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:00,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914995937] [2025-03-03 15:05:00,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914995937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:00,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:00,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:05:00,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086588632] [2025-03-03 15:05:00,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:00,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:00,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:00,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:00,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:00,670 INFO L87 Difference]: Start difference. First operand 21990 states and 28290 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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:05:00,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:00,794 INFO L93 Difference]: Finished difference Result 32438 states and 41982 transitions. [2025-03-03 15:05:00,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:00,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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:05:00,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:00,843 INFO L225 Difference]: With dead ends: 32438 [2025-03-03 15:05:00,843 INFO L226 Difference]: Without dead ends: 27576 [2025-03-03 15:05:00,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:05:00,856 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 643 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:00,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 833 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:00,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27576 states. [2025-03-03 15:05:01,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27576 to 25134. [2025-03-03 15:05:01,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25134 states, 25133 states have (on average 1.283969283412247) internal successors, (32270), 25133 states have internal predecessors, (32270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:01,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25134 states to 25134 states and 32270 transitions. [2025-03-03 15:05:01,192 INFO L78 Accepts]: Start accepts. Automaton has 25134 states and 32270 transitions. Word has length 77 [2025-03-03 15:05:01,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:01,192 INFO L471 AbstractCegarLoop]: Abstraction has 25134 states and 32270 transitions. [2025-03-03 15:05:01,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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:05:01,193 INFO L276 IsEmpty]: Start isEmpty. Operand 25134 states and 32270 transitions. [2025-03-03 15:05:01,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:05:01,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:01,200 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:05:01,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:05:01,201 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:05:01,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:01,201 INFO L85 PathProgramCache]: Analyzing trace with hash -231795413, now seen corresponding path program 1 times [2025-03-03 15:05:01,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:01,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153390862] [2025-03-03 15:05:01,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:01,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:01,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:05:01,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:05:01,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:01,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:01,421 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:01,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:01,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153390862] [2025-03-03 15:05:01,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153390862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:05:01,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080341045] [2025-03-03 15:05:01,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:01,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:05:01,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:05:01,424 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:05:01,426 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:05:01,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:05:01,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:05:01,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:01,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:01,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 15:05:01,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:05:01,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 15:05:01,938 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:05:01,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080341045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:01,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:05:01,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 12 [2025-03-03 15:05:01,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409400884] [2025-03-03 15:05:01,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:01,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:05:01,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:01,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:05:01,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:05:01,939 INFO L87 Difference]: Start difference. First operand 25134 states and 32270 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 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:05:02,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:02,527 INFO L93 Difference]: Finished difference Result 63654 states and 81885 transitions. [2025-03-03 15:05:02,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:05:02,528 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 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 95 [2025-03-03 15:05:02,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:02,602 INFO L225 Difference]: With dead ends: 63654 [2025-03-03 15:05:02,602 INFO L226 Difference]: Without dead ends: 47224 [2025-03-03 15:05:02,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 89 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:05:02,618 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 1166 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:02,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 859 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:05:02,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47224 states. [2025-03-03 15:05:02,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47224 to 25002. [2025-03-03 15:05:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25002 states, 25001 states have (on average 1.2843486260549577) internal successors, (32110), 25001 states have internal predecessors, (32110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:02,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25002 states to 25002 states and 32110 transitions. [2025-03-03 15:05:02,946 INFO L78 Accepts]: Start accepts. Automaton has 25002 states and 32110 transitions. Word has length 95 [2025-03-03 15:05:02,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:02,946 INFO L471 AbstractCegarLoop]: Abstraction has 25002 states and 32110 transitions. [2025-03-03 15:05:02,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 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:05:02,946 INFO L276 IsEmpty]: Start isEmpty. Operand 25002 states and 32110 transitions. [2025-03-03 15:05:02,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:05:02,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:02,951 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:05:02,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 15:05:03,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-03 15:05:03,156 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:05:03,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:03,157 INFO L85 PathProgramCache]: Analyzing trace with hash 104546868, now seen corresponding path program 1 times [2025-03-03 15:05:03,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:03,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766418372] [2025-03-03 15:05:03,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:03,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:03,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:05:03,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:05:03,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:03,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:03,327 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:03,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:03,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766418372] [2025-03-03 15:05:03,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766418372] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:05:03,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99844333] [2025-03-03 15:05:03,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:03,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:05:03,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:05:03,329 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:05:03,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:05:03,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:05:03,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:05:03,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:03,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:03,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 15:05:03,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:05:03,847 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:03,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:05:04,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:04,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99844333] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:05:04,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:05:04,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 19 [2025-03-03 15:05:04,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175171048] [2025-03-03 15:05:04,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:05:04,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 15:05:04,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:04,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 15:05:04,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:05:04,472 INFO L87 Difference]: Start difference. First operand 25002 states and 32110 transitions. Second operand has 19 states, 19 states have (on average 13.052631578947368) internal successors, (248), 19 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:06,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:06,076 INFO L93 Difference]: Finished difference Result 116125 states and 149242 transitions. [2025-03-03 15:05:06,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-03 15:05:06,077 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 13.052631578947368) internal successors, (248), 19 states have internal predecessors, (248), 0 states have call successors, (0), 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:05:06,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:06,199 INFO L225 Difference]: With dead ends: 116125 [2025-03-03 15:05:06,199 INFO L226 Difference]: Without dead ends: 91787 [2025-03-03 15:05:06,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1625 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1060, Invalid=3496, Unknown=0, NotChecked=0, Total=4556 [2025-03-03 15:05:06,240 INFO L435 NwaCegarLoop]: 714 mSDtfsCounter, 3145 mSDsluCounter, 4547 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3145 SdHoareTripleChecker+Valid, 5261 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:06,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3145 Valid, 5261 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:05:06,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91787 states. [2025-03-03 15:05:06,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91787 to 66950. [2025-03-03 15:05:06,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66950 states, 66949 states have (on average 1.278316330341006) internal successors, (85582), 66949 states have internal predecessors, (85582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:07,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66950 states to 66950 states and 85582 transitions. [2025-03-03 15:05:07,045 INFO L78 Accepts]: Start accepts. Automaton has 66950 states and 85582 transitions. Word has length 95 [2025-03-03 15:05:07,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:07,046 INFO L471 AbstractCegarLoop]: Abstraction has 66950 states and 85582 transitions. [2025-03-03 15:05:07,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.052631578947368) internal successors, (248), 19 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:07,046 INFO L276 IsEmpty]: Start isEmpty. Operand 66950 states and 85582 transitions. [2025-03-03 15:05:07,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 15:05:07,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:07,052 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:07,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 15:05:07,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-03 15:05:07,253 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:05:07,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:07,254 INFO L85 PathProgramCache]: Analyzing trace with hash -528809163, now seen corresponding path program 1 times [2025-03-03 15:05:07,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:07,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785877084] [2025-03-03 15:05:07,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:07,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:07,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:05:07,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:05:07,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:07,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:07,444 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:07,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:07,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785877084] [2025-03-03 15:05:07,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785877084] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:05:07,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494105404] [2025-03-03 15:05:07,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:07,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:05:07,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:05:07,446 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:05:07,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 15:05:07,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:05:07,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:05:07,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:07,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:07,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:05:07,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:05:07,865 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:07,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:05:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:07,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494105404] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:05:07,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:05:07,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-03-03 15:05:07,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534504648] [2025-03-03 15:05:07,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:05:07,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:05:07,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:07,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:05:07,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:05:07,984 INFO L87 Difference]: Start difference. First operand 66950 states and 85582 transitions. Second operand has 14 states, 14 states have (on average 18.428571428571427) internal successors, (258), 14 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:08,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:08,650 INFO L93 Difference]: Finished difference Result 135780 states and 173373 transitions. [2025-03-03 15:05:08,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:05:08,651 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.428571428571427) internal successors, (258), 14 states have internal predecessors, (258), 0 states have call successors, (0), 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 96 [2025-03-03 15:05:08,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:08,956 INFO L225 Difference]: With dead ends: 135780 [2025-03-03 15:05:08,957 INFO L226 Difference]: Without dead ends: 69398 [2025-03-03 15:05:08,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:05:08,985 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 2172 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2172 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:08,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2172 Valid, 1102 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:05:09,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69398 states. [2025-03-03 15:05:09,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69398 to 66438. [2025-03-03 15:05:09,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66438 states, 66437 states have (on average 1.2505682074747506) internal successors, (83084), 66437 states have internal predecessors, (83084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66438 states to 66438 states and 83084 transitions. [2025-03-03 15:05:09,580 INFO L78 Accepts]: Start accepts. Automaton has 66438 states and 83084 transitions. Word has length 96 [2025-03-03 15:05:09,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:09,580 INFO L471 AbstractCegarLoop]: Abstraction has 66438 states and 83084 transitions. [2025-03-03 15:05:09,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.428571428571427) internal successors, (258), 14 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:09,580 INFO L276 IsEmpty]: Start isEmpty. Operand 66438 states and 83084 transitions. [2025-03-03 15:05:09,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:05:09,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:09,587 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:09,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 15:05:09,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:05:09,789 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:05:09,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:09,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1106236589, now seen corresponding path program 1 times [2025-03-03 15:05:09,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:09,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731057177] [2025-03-03 15:05:09,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:09,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:09,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:05:09,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:05:09,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:09,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:09,847 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:09,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:09,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731057177] [2025-03-03 15:05:09,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731057177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:09,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:09,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:05:09,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636894227] [2025-03-03 15:05:09,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:09,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:09,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:09,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:09,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:09,849 INFO L87 Difference]: Start difference. First operand 66438 states and 83084 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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:05:10,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:10,472 INFO L93 Difference]: Finished difference Result 134530 states and 167931 transitions. [2025-03-03 15:05:10,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:05:10,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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:05:10,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:10,568 INFO L225 Difference]: With dead ends: 134530 [2025-03-03 15:05:10,568 INFO L226 Difference]: Without dead ends: 68748 [2025-03-03 15:05:10,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:05:10,588 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 485 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:10,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 455 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:05:10,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68748 states. [2025-03-03 15:05:11,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68748 to 64098. [2025-03-03 15:05:11,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64098 states, 64097 states have (on average 1.2278733794093328) internal successors, (78703), 64097 states have internal predecessors, (78703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:11,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64098 states to 64098 states and 78703 transitions. [2025-03-03 15:05:11,469 INFO L78 Accepts]: Start accepts. Automaton has 64098 states and 78703 transitions. Word has length 97 [2025-03-03 15:05:11,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:11,470 INFO L471 AbstractCegarLoop]: Abstraction has 64098 states and 78703 transitions. [2025-03-03 15:05:11,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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:05:11,470 INFO L276 IsEmpty]: Start isEmpty. Operand 64098 states and 78703 transitions. [2025-03-03 15:05:11,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:05:11,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:11,477 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:11,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:05:11,478 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:05:11,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:11,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1120947418, now seen corresponding path program 1 times [2025-03-03 15:05:11,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:11,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650801619] [2025-03-03 15:05:11,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:11,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:11,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:05:11,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:05:11,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:11,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:11,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 15:05:11,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:11,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650801619] [2025-03-03 15:05:11,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650801619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:11,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:11,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:05:11,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305839605] [2025-03-03 15:05:11,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:11,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:11,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:11,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:11,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:11,555 INFO L87 Difference]: Start difference. First operand 64098 states and 78703 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 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:05:11,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:11,888 INFO L93 Difference]: Finished difference Result 86096 states and 106180 transitions. [2025-03-03 15:05:11,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:11,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 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 100 [2025-03-03 15:05:11,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:11,960 INFO L225 Difference]: With dead ends: 86096 [2025-03-03 15:05:11,960 INFO L226 Difference]: Without dead ends: 73122 [2025-03-03 15:05:11,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:05:11,972 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 585 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:11,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 773 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:12,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73122 states. [2025-03-03 15:05:12,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73122 to 71194. [2025-03-03 15:05:12,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71194 states, 71193 states have (on average 1.223406795611928) internal successors, (87098), 71193 states have internal predecessors, (87098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:12,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71194 states to 71194 states and 87098 transitions. [2025-03-03 15:05:12,688 INFO L78 Accepts]: Start accepts. Automaton has 71194 states and 87098 transitions. Word has length 100 [2025-03-03 15:05:12,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:12,688 INFO L471 AbstractCegarLoop]: Abstraction has 71194 states and 87098 transitions. [2025-03-03 15:05:12,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 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:05:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 71194 states and 87098 transitions. [2025-03-03 15:05:12,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:05:12,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:12,697 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:12,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 15:05:12,697 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:05:12,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:12,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1463155010, now seen corresponding path program 1 times [2025-03-03 15:05:12,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:12,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678767254] [2025-03-03 15:05:12,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:12,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:12,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:05:12,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:05:12,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:12,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:12,922 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:12,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:12,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678767254] [2025-03-03 15:05:12,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678767254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:12,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:12,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:05:12,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507830160] [2025-03-03 15:05:12,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:12,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:12,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:12,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:12,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:12,923 INFO L87 Difference]: Start difference. First operand 71194 states and 87098 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:13,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:13,155 INFO L93 Difference]: Finished difference Result 96602 states and 118940 transitions. [2025-03-03 15:05:13,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:13,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-03 15:05:13,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:13,247 INFO L225 Difference]: With dead ends: 96602 [2025-03-03 15:05:13,247 INFO L226 Difference]: Without dead ends: 81310 [2025-03-03 15:05:13,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:05:13,281 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 584 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:13,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 770 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:13,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81310 states. [2025-03-03 15:05:14,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81310 to 79382. [2025-03-03 15:05:14,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79382 states, 79381 states have (on average 1.218704727831597) internal successors, (96742), 79381 states have internal predecessors, (96742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:14,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79382 states to 79382 states and 96742 transitions. [2025-03-03 15:05:14,222 INFO L78 Accepts]: Start accepts. Automaton has 79382 states and 96742 transitions. Word has length 101 [2025-03-03 15:05:14,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:14,223 INFO L471 AbstractCegarLoop]: Abstraction has 79382 states and 96742 transitions. [2025-03-03 15:05:14,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:14,223 INFO L276 IsEmpty]: Start isEmpty. Operand 79382 states and 96742 transitions. [2025-03-03 15:05:14,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 15:05:14,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:14,231 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:05:14,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 15:05:14,231 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:05:14,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:14,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1380772824, now seen corresponding path program 1 times [2025-03-03 15:05:14,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:14,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011241706] [2025-03-03 15:05:14,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:14,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:14,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 15:05:14,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 15:05:14,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:14,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:14,324 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 15:05:14,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:14,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011241706] [2025-03-03 15:05:14,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011241706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:14,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:14,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:05:14,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918549733] [2025-03-03 15:05:14,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:14,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:05:14,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:14,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:05:14,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:05:14,326 INFO L87 Difference]: Start difference. First operand 79382 states and 96742 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:14,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:14,901 INFO L93 Difference]: Finished difference Result 133319 states and 162155 transitions. [2025-03-03 15:05:14,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:05:14,902 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-03-03 15:05:14,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:15,023 INFO L225 Difference]: With dead ends: 133319 [2025-03-03 15:05:15,023 INFO L226 Difference]: Without dead ends: 109523 [2025-03-03 15:05:15,045 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:05:15,045 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 1168 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:15,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 504 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:05:15,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109523 states. [2025-03-03 15:05:15,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109523 to 79432. [2025-03-03 15:05:15,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79432 states, 79431 states have (on average 1.2186425954602107) internal successors, (96798), 79431 states have internal predecessors, (96798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:16,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79432 states to 79432 states and 96798 transitions. [2025-03-03 15:05:16,047 INFO L78 Accepts]: Start accepts. Automaton has 79432 states and 96798 transitions. Word has length 105 [2025-03-03 15:05:16,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:16,048 INFO L471 AbstractCegarLoop]: Abstraction has 79432 states and 96798 transitions. [2025-03-03 15:05:16,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:16,048 INFO L276 IsEmpty]: Start isEmpty. Operand 79432 states and 96798 transitions. [2025-03-03 15:05:16,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 15:05:16,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:16,057 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:05:16,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 15:05:16,057 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:05:16,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:16,058 INFO L85 PathProgramCache]: Analyzing trace with hash -70973293, now seen corresponding path program 1 times [2025-03-03 15:05:16,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:16,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971662690] [2025-03-03 15:05:16,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:16,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:16,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 15:05:16,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 15:05:16,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:16,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:16,479 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:16,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:16,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971662690] [2025-03-03 15:05:16,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971662690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:16,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:16,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:05:16,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916179216] [2025-03-03 15:05:16,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:16,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:05:16,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:16,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:05:16,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:05:16,480 INFO L87 Difference]: Start difference. First operand 79432 states and 96798 transitions. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:17,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:17,105 INFO L93 Difference]: Finished difference Result 171260 states and 208263 transitions. [2025-03-03 15:05:17,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:05:17,106 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-03-03 15:05:17,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:17,263 INFO L225 Difference]: With dead ends: 171260 [2025-03-03 15:05:17,264 INFO L226 Difference]: Without dead ends: 135632 [2025-03-03 15:05:17,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:05:17,319 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 1149 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:17,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 1150 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:05:17,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135632 states. [2025-03-03 15:05:18,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135632 to 120433. [2025-03-03 15:05:18,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120433 states, 120432 states have (on average 1.2200827022718215) internal successors, (146937), 120432 states have internal predecessors, (146937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:18,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120433 states to 120433 states and 146937 transitions. [2025-03-03 15:05:18,624 INFO L78 Accepts]: Start accepts. Automaton has 120433 states and 146937 transitions. Word has length 105 [2025-03-03 15:05:18,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:18,624 INFO L471 AbstractCegarLoop]: Abstraction has 120433 states and 146937 transitions. [2025-03-03 15:05:18,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:18,624 INFO L276 IsEmpty]: Start isEmpty. Operand 120433 states and 146937 transitions. [2025-03-03 15:05:18,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 15:05:18,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:18,634 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:05:18,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 15:05:18,635 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:05:18,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:18,635 INFO L85 PathProgramCache]: Analyzing trace with hash -569023959, now seen corresponding path program 1 times [2025-03-03 15:05:18,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:18,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926206684] [2025-03-03 15:05:18,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:18,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:18,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 15:05:18,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 15:05:18,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:18,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:19,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:19,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:19,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926206684] [2025-03-03 15:05:19,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926206684] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:05:19,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073507758] [2025-03-03 15:05:19,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:19,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:05:19,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:05:19,070 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:05:19,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 15:05:19,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 15:05:19,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 15:05:19,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:19,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:19,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:05:19,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:05:19,829 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:19,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:05:19,969 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:19,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073507758] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:05:19,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:05:19,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-03-03 15:05:19,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51819639] [2025-03-03 15:05:19,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:05:19,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:05:19,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:19,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:05:19,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:05:19,972 INFO L87 Difference]: Start difference. First operand 120433 states and 146937 transitions. Second operand has 14 states, 14 states have (on average 20.857142857142858) internal successors, (292), 14 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:20,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:20,780 INFO L93 Difference]: Finished difference Result 285548 states and 349331 transitions. [2025-03-03 15:05:20,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:05:20,781 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 20.857142857142858) internal successors, (292), 14 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-03 15:05:20,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:20,984 INFO L225 Difference]: With dead ends: 285548 [2025-03-03 15:05:20,984 INFO L226 Difference]: Without dead ends: 165933 [2025-03-03 15:05:21,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:05:21,072 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 1925 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1925 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:21,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1925 Valid, 856 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:05:21,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165933 states. [2025-03-03 15:05:22,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165933 to 138787. [2025-03-03 15:05:22,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138787 states, 138786 states have (on average 1.2051864020866658) internal successors, (167263), 138786 states have internal predecessors, (167263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:22,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138787 states to 138787 states and 167263 transitions. [2025-03-03 15:05:22,810 INFO L78 Accepts]: Start accepts. Automaton has 138787 states and 167263 transitions. Word has length 106 [2025-03-03 15:05:22,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:22,810 INFO L471 AbstractCegarLoop]: Abstraction has 138787 states and 167263 transitions. [2025-03-03 15:05:22,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.857142857142858) internal successors, (292), 14 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:22,811 INFO L276 IsEmpty]: Start isEmpty. Operand 138787 states and 167263 transitions. [2025-03-03 15:05:22,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 15:05:22,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:22,820 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:05:22,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 15:05:23,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:05:23,024 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:05:23,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:23,027 INFO L85 PathProgramCache]: Analyzing trace with hash -264835777, now seen corresponding path program 1 times [2025-03-03 15:05:23,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:23,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211565944] [2025-03-03 15:05:23,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:23,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:23,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 15:05:23,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 15:05:23,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:23,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:23,392 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:23,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:23,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211565944] [2025-03-03 15:05:23,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211565944] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:05:23,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406190284] [2025-03-03 15:05:23,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:23,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:05:23,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:05:23,396 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:05:23,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 15:05:23,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 15:05:23,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 15:05:23,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:23,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:23,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 15:05:23,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:05:24,404 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:24,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:05:25,175 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:25,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406190284] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:05:25,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:05:25,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 13] total 31 [2025-03-03 15:05:25,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256742499] [2025-03-03 15:05:25,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:05:25,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 15:05:25,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:25,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 15:05:25,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2025-03-03 15:05:25,177 INFO L87 Difference]: Start difference. First operand 138787 states and 167263 transitions. Second operand has 32 states, 32 states have (on average 8.625) internal successors, (276), 31 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:27,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:27,373 INFO L93 Difference]: Finished difference Result 457611 states and 547909 transitions. [2025-03-03 15:05:27,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 15:05:27,374 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 8.625) internal successors, (276), 31 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-03 15:05:27,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:27,781 INFO L225 Difference]: With dead ends: 457611 [2025-03-03 15:05:27,781 INFO L226 Difference]: Without dead ends: 319303 [2025-03-03 15:05:27,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=750, Invalid=2556, Unknown=0, NotChecked=0, Total=3306 [2025-03-03 15:05:27,926 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 3290 mSDsluCounter, 1897 mSDsCounter, 0 mSdLazyCounter, 1842 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3290 SdHoareTripleChecker+Valid, 2082 SdHoareTripleChecker+Invalid, 1923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:27,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3290 Valid, 2082 Invalid, 1923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1842 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:05:28,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319303 states. [2025-03-03 15:05:30,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319303 to 186541. [2025-03-03 15:05:30,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186541 states, 186540 states have (on average 1.1951163289374933) internal successors, (222937), 186540 states have internal predecessors, (222937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:30,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186541 states to 186541 states and 222937 transitions. [2025-03-03 15:05:30,886 INFO L78 Accepts]: Start accepts. Automaton has 186541 states and 222937 transitions. Word has length 106 [2025-03-03 15:05:30,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:30,888 INFO L471 AbstractCegarLoop]: Abstraction has 186541 states and 222937 transitions. [2025-03-03 15:05:30,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.625) internal successors, (276), 31 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:30,888 INFO L276 IsEmpty]: Start isEmpty. Operand 186541 states and 222937 transitions. [2025-03-03 15:05:30,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 15:05:30,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:30,901 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:05:30,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 15:05:31,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-03 15:05:31,104 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:05:31,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:31,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1253671246, now seen corresponding path program 1 times [2025-03-03 15:05:31,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:31,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916152118] [2025-03-03 15:05:31,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:31,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:31,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 15:05:31,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 15:05:31,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:31,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:31,246 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 15:05:31,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:31,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916152118] [2025-03-03 15:05:31,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916152118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:31,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:31,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:05:31,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179385461] [2025-03-03 15:05:31,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:31,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:05:31,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:31,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:05:31,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:05:31,247 INFO L87 Difference]: Start difference. First operand 186541 states and 222937 transitions. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:32,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:32,150 INFO L93 Difference]: Finished difference Result 310004 states and 370220 transitions. [2025-03-03 15:05:32,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:05:32,151 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 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 107 [2025-03-03 15:05:32,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:32,387 INFO L225 Difference]: With dead ends: 310004 [2025-03-03 15:05:32,387 INFO L226 Difference]: Without dead ends: 186611 [2025-03-03 15:05:32,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:05:32,466 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 592 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:32,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 673 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:05:32,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186611 states. [2025-03-03 15:05:34,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186611 to 186453. [2025-03-03 15:05:34,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186453 states, 186452 states have (on average 1.1951279685924527) internal successors, (222834), 186452 states have internal predecessors, (222834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:34,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186453 states to 186453 states and 222834 transitions. [2025-03-03 15:05:34,680 INFO L78 Accepts]: Start accepts. Automaton has 186453 states and 222834 transitions. Word has length 107 [2025-03-03 15:05:34,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:34,680 INFO L471 AbstractCegarLoop]: Abstraction has 186453 states and 222834 transitions. [2025-03-03 15:05:34,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:34,680 INFO L276 IsEmpty]: Start isEmpty. Operand 186453 states and 222834 transitions. [2025-03-03 15:05:34,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 15:05:34,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:34,689 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:05:34,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 15:05:34,689 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:05:34,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:34,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1225742584, now seen corresponding path program 1 times [2025-03-03 15:05:34,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:34,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288809602] [2025-03-03 15:05:34,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:34,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:34,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 15:05:34,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 15:05:34,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:34,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:35,431 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:35,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:35,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288809602] [2025-03-03 15:05:35,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288809602] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:05:35,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35490849] [2025-03-03 15:05:35,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:35,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:05:35,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:05:35,433 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:05:35,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 15:05:35,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 15:05:35,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 15:05:35,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:35,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:35,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 15:05:35,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:05:36,080 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:36,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:05:36,547 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:36,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35490849] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:05:36,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:05:36,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 10] total 34 [2025-03-03 15:05:36,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75443923] [2025-03-03 15:05:36,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:05:36,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-03 15:05:36,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:36,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-03 15:05:36,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1018, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 15:05:36,549 INFO L87 Difference]: Start difference. First operand 186453 states and 222834 transitions. Second operand has 34 states, 34 states have (on average 8.558823529411764) internal successors, (291), 34 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:39,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:39,801 INFO L93 Difference]: Finished difference Result 264343 states and 314979 transitions. [2025-03-03 15:05:39,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-03-03 15:05:39,802 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 8.558823529411764) internal successors, (291), 34 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-03 15:05:39,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:40,043 INFO L225 Difference]: With dead ends: 264343 [2025-03-03 15:05:40,043 INFO L226 Difference]: Without dead ends: 224741 [2025-03-03 15:05:40,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1774 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1116, Invalid=6366, Unknown=0, NotChecked=0, Total=7482 [2025-03-03 15:05:40,111 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 2406 mSDsluCounter, 6807 mSDsCounter, 0 mSdLazyCounter, 3274 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2406 SdHoareTripleChecker+Valid, 7209 SdHoareTripleChecker+Invalid, 3314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:40,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2406 Valid, 7209 Invalid, 3314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3274 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:05:40,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224741 states. [2025-03-03 15:05:42,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224741 to 186716. [2025-03-03 15:05:42,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186716 states, 186715 states have (on average 1.1933695739496024) internal successors, (222820), 186715 states have internal predecessors, (222820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:42,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186716 states to 186716 states and 222820 transitions. [2025-03-03 15:05:42,730 INFO L78 Accepts]: Start accepts. Automaton has 186716 states and 222820 transitions. Word has length 108 [2025-03-03 15:05:42,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:42,730 INFO L471 AbstractCegarLoop]: Abstraction has 186716 states and 222820 transitions. [2025-03-03 15:05:42,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 8.558823529411764) internal successors, (291), 34 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:42,731 INFO L276 IsEmpty]: Start isEmpty. Operand 186716 states and 222820 transitions. [2025-03-03 15:05:42,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 15:05:42,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:42,739 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:05:42,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 15:05:42,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-03 15:05:42,939 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:05:42,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:42,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1939791745, now seen corresponding path program 1 times [2025-03-03 15:05:42,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:42,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207967494] [2025-03-03 15:05:42,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:42,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:42,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 15:05:42,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 15:05:42,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:42,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:43,488 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:43,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:43,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207967494] [2025-03-03 15:05:43,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207967494] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:05:43,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126285945] [2025-03-03 15:05:43,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:43,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:05:43,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:05:43,491 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:05:43,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 15:05:43,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 15:05:43,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 15:05:43,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:43,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:43,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 15:05:43,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:05:44,279 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:44,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:05:44,863 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:44,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126285945] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:05:44,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:05:44,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 12] total 37 [2025-03-03 15:05:44,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805244863] [2025-03-03 15:05:44,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:05:44,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-03 15:05:44,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:44,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-03 15:05:44,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1222, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 15:05:44,865 INFO L87 Difference]: Start difference. First operand 186716 states and 222820 transitions. Second operand has 37 states, 37 states have (on average 8.162162162162161) internal successors, (302), 37 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:52,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:52,861 INFO L93 Difference]: Finished difference Result 347240 states and 412466 transitions. [2025-03-03 15:05:52,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2025-03-03 15:05:52,862 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 8.162162162162161) internal successors, (302), 37 states have internal predecessors, (302), 0 states have call successors, (0), 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 109 [2025-03-03 15:05:52,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:53,288 INFO L225 Difference]: With dead ends: 347240 [2025-03-03 15:05:53,289 INFO L226 Difference]: Without dead ends: 310242 [2025-03-03 15:05:53,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7940 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=4110, Invalid=21330, Unknown=0, NotChecked=0, Total=25440 [2025-03-03 15:05:53,640 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 4525 mSDsluCounter, 5428 mSDsCounter, 0 mSdLazyCounter, 5298 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4525 SdHoareTripleChecker+Valid, 5691 SdHoareTripleChecker+Invalid, 5408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 5298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:53,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4525 Valid, 5691 Invalid, 5408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 5298 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 15:05:53,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310242 states. [2025-03-03 15:05:55,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310242 to 197792. [2025-03-03 15:05:55,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197792 states, 197791 states have (on average 1.1930421505528563) internal successors, (235973), 197791 states have internal predecessors, (235973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:56,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197792 states to 197792 states and 235973 transitions. [2025-03-03 15:05:56,188 INFO L78 Accepts]: Start accepts. Automaton has 197792 states and 235973 transitions. Word has length 109 [2025-03-03 15:05:56,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:56,189 INFO L471 AbstractCegarLoop]: Abstraction has 197792 states and 235973 transitions. [2025-03-03 15:05:56,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 8.162162162162161) internal successors, (302), 37 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:56,189 INFO L276 IsEmpty]: Start isEmpty. Operand 197792 states and 235973 transitions. [2025-03-03 15:05:56,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 15:05:56,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:56,197 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:05:56,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 15:05:56,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:05:56,398 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:05:56,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:56,398 INFO L85 PathProgramCache]: Analyzing trace with hash 702308238, now seen corresponding path program 1 times [2025-03-03 15:05:56,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:56,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791610073] [2025-03-03 15:05:56,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:56,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:56,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 15:05:56,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 15:05:56,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:56,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:57,152 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:57,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:57,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791610073] [2025-03-03 15:05:57,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791610073] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:05:57,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262580525] [2025-03-03 15:05:57,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:57,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:05:57,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:05:57,155 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:05:57,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 15:05:57,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 15:05:57,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 15:05:57,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:57,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:57,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 15:05:57,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:05:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:57,640 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:05:57,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262580525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:57,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:05:57,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 19 [2025-03-03 15:05:57,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013521414] [2025-03-03 15:05:57,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:57,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:05:57,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:57,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:05:57,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:05:57,641 INFO L87 Difference]: Start difference. First operand 197792 states and 235973 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 10 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:58,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:58,354 INFO L93 Difference]: Finished difference Result 281456 states and 335978 transitions. [2025-03-03 15:05:58,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:05:58,355 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 10 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-03 15:05:58,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:58,593 INFO L225 Difference]: With dead ends: 281456 [2025-03-03 15:05:58,594 INFO L226 Difference]: Without dead ends: 212826 [2025-03-03 15:05:58,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:05:58,673 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 342 mSDsluCounter, 2169 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 2530 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:58,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 2530 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:05:59,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212826 states. [2025-03-03 15:06:00,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212826 to 211406. [2025-03-03 15:06:01,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211406 states, 211405 states have (on average 1.1916132541803648) internal successors, (251913), 211405 states have internal predecessors, (251913), 0 states have call successors, (0), 0 states have call 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:01,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211406 states to 211406 states and 251913 transitions. [2025-03-03 15:06:01,350 INFO L78 Accepts]: Start accepts. Automaton has 211406 states and 251913 transitions. Word has length 109 [2025-03-03 15:06:01,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:01,350 INFO L471 AbstractCegarLoop]: Abstraction has 211406 states and 251913 transitions. [2025-03-03 15:06:01,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 10 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call 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:01,350 INFO L276 IsEmpty]: Start isEmpty. Operand 211406 states and 251913 transitions. [2025-03-03 15:06:01,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 15:06:01,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:01,358 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:06:01,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 15:06:01,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2025-03-03 15:06:01,559 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 15:06:01,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:01,559 INFO L85 PathProgramCache]: Analyzing trace with hash 99809268, now seen corresponding path program 1 times [2025-03-03 15:06:01,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:01,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593847206] [2025-03-03 15:06:01,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:01,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:01,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 15:06:01,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 15:06:01,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:01,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:01,958 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:01,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:01,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593847206] [2025-03-03 15:06:01,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593847206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:01,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:01,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 15:06:01,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543518031] [2025-03-03 15:06:01,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:01,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 15:06:01,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:01,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 15:06:01,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:06:01,959 INFO L87 Difference]: Start difference. First operand 211406 states and 251913 transitions. Second operand has 15 states, 15 states have (on average 7.266666666666667) internal successors, (109), 14 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)