./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-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.ufo.BOUNDED-6.pals.c.v+sep-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 5de8a6e48c671522e021c00f8053da339f3153b1fcc0b54263671efa3814086b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:06:26,173 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:06:26,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:06:26,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:06:26,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:06:26,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:06:26,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:06:26,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:06:26,242 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:06:26,242 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:06:26,242 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:06:26,242 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:06:26,242 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:06:26,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:06:26,242 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:06:26,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:06:26,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:06:26,243 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:06:26,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:06:26,243 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:06:26,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:06:26,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:06:26,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:06:26,243 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:06:26,243 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:06:26,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:06:26,243 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:06:26,243 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:06:26,243 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:06:26,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:06:26,243 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:06:26,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:06:26,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:06:26,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:06:26,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:06:26,244 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:06:26,244 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:06:26,244 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:06:26,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:06:26,244 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:06:26,244 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:06:26,244 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:06:26,244 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:06:26,244 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 -> 5de8a6e48c671522e021c00f8053da339f3153b1fcc0b54263671efa3814086b [2025-03-03 15:06:26,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:06:26,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:06:26,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:06:26,500 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:06:26,501 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:06:26,502 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2025-03-03 15:06:27,648 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3347eee73/c6ede2c397e84daca76b107aefca144f/FLAG03afcbcc4 [2025-03-03 15:06:28,100 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:06:28,101 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2025-03-03 15:06:28,126 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3347eee73/c6ede2c397e84daca76b107aefca144f/FLAG03afcbcc4 [2025-03-03 15:06:28,224 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3347eee73/c6ede2c397e84daca76b107aefca144f [2025-03-03 15:06:28,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:06:28,228 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:06:28,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:06:28,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:06:28,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:06:28,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:06:28" (1/1) ... [2025-03-03 15:06:28,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@597c3217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:28, skipping insertion in model container [2025-03-03 15:06:28,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:06:28" (1/1) ... [2025-03-03 15:06:28,312 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:06:28,516 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[8424,8437] [2025-03-03 15:06:28,537 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[12951,12964] [2025-03-03 15:06:28,565 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[20701,20714] [2025-03-03 15:06:28,585 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[27792,27805] [2025-03-03 15:06:28,629 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[49016,49029] [2025-03-03 15:06:28,682 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[80107,80120] [2025-03-03 15:06:28,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:06:28,795 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:06:28,815 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[8424,8437] [2025-03-03 15:06:28,823 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[12951,12964] [2025-03-03 15:06:28,838 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[20701,20714] [2025-03-03 15:06:28,850 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[27792,27805] [2025-03-03 15:06:28,898 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[49016,49029] [2025-03-03 15:06:28,926 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[80107,80120] [2025-03-03 15:06:28,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:06:29,002 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:06:29,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:29 WrapperNode [2025-03-03 15:06:29,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:06:29,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:06:29,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:06:29,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:06:29,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:29" (1/1) ... [2025-03-03 15:06:29,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:29" (1/1) ... [2025-03-03 15:06:29,156 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 6424 [2025-03-03 15:06:29,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:06:29,157 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:06:29,157 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:06:29,157 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:06:29,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:29" (1/1) ... [2025-03-03 15:06:29,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:29" (1/1) ... [2025-03-03 15:06:29,180 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:29" (1/1) ... [2025-03-03 15:06:29,281 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:06:29,284 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:29" (1/1) ... [2025-03-03 15:06:29,284 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:29" (1/1) ... [2025-03-03 15:06:29,312 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:29" (1/1) ... [2025-03-03 15:06:29,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:29" (1/1) ... [2025-03-03 15:06:29,327 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:29" (1/1) ... [2025-03-03 15:06:29,343 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:29" (1/1) ... [2025-03-03 15:06:29,362 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:06:29,363 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:06:29,363 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:06:29,364 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:06:29,364 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:29" (1/1) ... [2025-03-03 15:06:29,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:06:29,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:06:29,390 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:06:29,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:06:29,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:06:29,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:06:29,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:06:29,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:06:29,600 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:06:29,602 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:06:32,072 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1690: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-03 15:06:32,073 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1295: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:06:32,073 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8298: havoc main_~node1____CPAchecker_TMP_1~14#1;havoc main_~node1__m1~48#1;havoc main_~main____CPAchecker_TMP_0~47#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~53#1;havoc main_~node3__m3~34#1;havoc main_~node2__m2~40#1;havoc main_~node1__m1~47#1;havoc main_~main____CPAchecker_TMP_0~46#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~52#1; [2025-03-03 15:06:32,074 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4996: havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-03-03 15:06:32,074 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2222: havoc main_~node1____CPAchecker_TMP_1~2#1; [2025-03-03 15:06:32,074 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7904: havoc main_~node2____CPAchecker_TMP_1~6#1;havoc main_~node2__m2~38#1; [2025-03-03 15:06:32,074 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8037: havoc main_~node2__m2~39#1; [2025-03-03 15:06:32,074 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L506: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:06:32,075 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1961: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~11#1;havoc main_~node3__m3~8#1;havoc main_~node2__m2~7#1;havoc main_~node1__m1~9#1;havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~10#1;havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-03 15:06:32,075 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2360: havoc main_~node3__m3~10#1;havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-03 15:06:32,075 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5400: havoc main_~node1____CPAchecker_TMP_1~6#1; [2025-03-03 15:06:32,075 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6722: havoc main_~node3__m3~28#1; [2025-03-03 15:06:32,075 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5666: havoc main_~node1____CPAchecker_TMP_1~7#1; [2025-03-03 15:06:32,076 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10292: havoc main_~node1____CPAchecker_TMP_1~18#1;havoc main_~node1__m1~64#1;havoc main_~main____CPAchecker_TMP_0~63#1;havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~69#1;havoc main_~node3__m3~43#1;havoc main_~node2__m2~47#1;havoc main_~node1__m1~63#1;havoc main_~main____CPAchecker_TMP_0~62#1;havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~68#1; [2025-03-03 15:06:32,076 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8047: havoc main_~node2____CPAchecker_TMP_0~5#1; [2025-03-03 15:06:32,076 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6858: havoc main_~node1__m1~39#1;havoc main_~main____CPAchecker_TMP_0~38#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~44#1;havoc main_~node3__m3~29#1;havoc main_~node2__m2~32#1;havoc main_~node1__m1~38#1;havoc main_~main____CPAchecker_TMP_0~37#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~43#1; [2025-03-03 15:06:32,076 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9502: havoc main_~node1__m1~57#1;havoc main_~main____CPAchecker_TMP_0~56#1;havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~62#1; [2025-03-03 15:06:32,076 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2370: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-03 15:06:32,076 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8977: havoc main_~node2____CPAchecker_TMP_0~6#1; [2025-03-03 15:06:32,076 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8713: havoc main_~node1__m1~51#1;havoc main_~main____CPAchecker_TMP_0~50#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~56#1; [2025-03-03 15:06:32,076 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4882: havoc main_~node3__m3~20#1; [2025-03-03 15:06:32,076 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6732: havoc main_~node3____CPAchecker_TMP_0~8#1; [2025-03-03 15:06:32,076 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1183: havoc main_~node3__m3~4#1;havoc main_~node2__m2~4#1;havoc main_~node1__m1~5#1;havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-03 15:06:32,076 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7129: havoc main_~node1__m1~41#1;havoc main_~main____CPAchecker_TMP_0~40#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~46#1;havoc main_~node3__m3~30#1;havoc main_~node2__m2~33#1;havoc main_~node1__m1~40#1;havoc main_~main____CPAchecker_TMP_0~39#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~45#1; [2025-03-03 15:06:32,076 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8584: havoc main_~node3__m3~35#1;havoc main_~node2__m2~41#1;havoc main_~node1__m1~50#1;havoc main_~main____CPAchecker_TMP_0~49#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~55#1; [2025-03-03 15:06:32,077 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8056: havoc main_~node3__m3~33#1; [2025-03-03 15:06:32,077 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4357: havoc main_~node3__m3~17#1; [2025-03-03 15:06:32,077 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6868: havoc main_~node1____CPAchecker_TMP_0~10#1; [2025-03-03 15:06:32,077 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6210: havoc main_~node1__m1~35#1;havoc main_~main____CPAchecker_TMP_0~34#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~40#1;havoc main_~node3__m3~25#1;havoc main_~node2__m2~29#1;havoc main_~node1__m1~34#1;havoc main_~main____CPAchecker_TMP_0~33#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~39#1; [2025-03-03 15:06:32,077 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10438: havoc main_~node1__m1~65#1;havoc main_~main____CPAchecker_TMP_0~64#1;havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~70#1;havoc main_~node3____CPAchecker_TMP_1~12#1; [2025-03-03 15:06:32,077 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2907: havoc main_~node3__m3~11#1; [2025-03-03 15:06:32,077 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1718: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-03-03 15:06:32,077 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7796: havoc main_~node2____CPAchecker_TMP_0~4#1; [2025-03-03 15:06:32,077 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4493: havoc main_~node1__m1~26#1;havoc main_~main____CPAchecker_TMP_0~25#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~29#1;havoc main_~node3__m3~18#1;havoc main_~node2__m2~22#1;havoc main_~node1__m1~25#1;havoc main_~main____CPAchecker_TMP_0~24#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~28#1; [2025-03-03 15:06:32,077 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:06:32,077 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7139: havoc main_~node1____CPAchecker_TMP_0~11#1; [2025-03-03 15:06:32,078 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L534: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-03 15:06:32,078 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8066: havoc main_~node3____CPAchecker_TMP_0~9#1; [2025-03-03 15:06:32,078 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L799: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1;havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1;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:06:32,078 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4367: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-03-03 15:06:32,078 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3839: havoc main_~node1__m1~22#1;havoc main_~main____CPAchecker_TMP_0~21#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~25#1;havoc main_~node3__m3~14#1;havoc main_~node2__m2~19#1;havoc main_~node1__m1~21#1;havoc main_~main____CPAchecker_TMP_0~20#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~24#1; [2025-03-03 15:06:32,078 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8465: havoc main_~node1__m1~49#1;havoc main_~main____CPAchecker_TMP_0~48#1;havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~54#1;havoc main_~node3____CPAchecker_TMP_1~9#1; [2025-03-03 15:06:32,078 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5031: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-03 15:06:32,078 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2917: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-03 15:06:32,078 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L276: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:06:32,078 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10055: havoc main_~node3__m3~42#1; [2025-03-03 15:06:32,079 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5695: havoc main_~node2__m2~27#1; [2025-03-03 15:06:32,079 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6491: havoc main_~node3__m3~26#1;havoc main_~node2__m2~30#1;havoc main_~node1__m1~36#1;havoc main_~main____CPAchecker_TMP_0~35#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~41#1;havoc main_~node3____CPAchecker_TMP_1~7#1; [2025-03-03 15:06:32,079 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9005: havoc main_~node2____CPAchecker_TMP_1~7#1; [2025-03-03 15:06:32,079 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L286: havoc main_~node2__m2~0#1; [2025-03-03 15:06:32,079 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10065: havoc main_~node3____CPAchecker_TMP_0~12#1; [2025-03-03 15:06:32,079 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5705: havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-03-03 15:06:32,079 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4120: havoc main_~node3__m3~15#1;havoc main_~node2__m2~20#1;havoc main_~node1__m1~23#1;havoc main_~main____CPAchecker_TMP_0~22#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~26#1;havoc main_~node3____CPAchecker_TMP_1~4#1; [2025-03-03 15:06:32,079 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6897: havoc main_~node1____CPAchecker_TMP_1~9#1; [2025-03-03 15:06:32,079 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7824: havoc main_~node2____CPAchecker_TMP_1~5#1; [2025-03-03 15:06:32,079 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3464: havoc main_~node2__m2~17#1; [2025-03-03 15:06:32,079 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L296: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:06:32,079 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8885: havoc main_~node1__m1~53#1;havoc main_~main____CPAchecker_TMP_0~52#1;havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~58#1;havoc main_~node3__m3~37#1;havoc main_~node2__m2~42#1;havoc main_~node1__m1~52#1;havoc main_~main____CPAchecker_TMP_0~51#1;havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~57#1; [2025-03-03 15:06:32,079 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7169: havoc main_~node1____CPAchecker_TMP_1~10#1; [2025-03-03 15:06:32,079 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9151: havoc main_~node1__m1~54#1;havoc main_~main____CPAchecker_TMP_0~53#1;havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~59#1;havoc main_~node3____CPAchecker_TMP_1~10#1; [2025-03-03 15:06:32,079 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5982: havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~38#1;havoc main_~node3__m3~24#1;havoc main_~node2__m2~28#1;havoc main_~node1__m1~33#1;havoc main_~main____CPAchecker_TMP_0~32#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~37#1; [2025-03-03 15:06:32,079 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5323: havoc main_~node1__m1~30#1;havoc main_~main____CPAchecker_TMP_0~29#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~34#1;havoc main_~node3__m3~21#1;havoc main_~node2__m2~25#1;havoc main_~node1__m1~29#1;havoc main_~main____CPAchecker_TMP_0~28#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~33#1;havoc main_~node3____CPAchecker_TMP_1~6#1; [2025-03-03 15:06:32,079 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5059: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-03 15:06:32,079 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3474: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:06:32,080 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5854: havoc main_~node3__m3~23#1;havoc main_~node2____CPAchecker_TMP_1~3#1; [2025-03-03 15:06:32,080 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4929: havoc main_~check__tmp~32#1; [2025-03-03 15:06:32,080 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: havoc main_~node3__m3~0#1; [2025-03-03 15:06:32,080 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6648: havoc main_~node3__m3~27#1;havoc main_~node2__m2~31#1;havoc main_~node1__m1~37#1;havoc main_~main____CPAchecker_TMP_0~36#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~42#1; [2025-03-03 15:06:32,080 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3611: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~23#1;havoc main_~node3__m3~13#1;havoc main_~node2__m2~18#1;havoc main_~node1__m1~20#1;havoc main_~main____CPAchecker_TMP_0~19#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~22#1; [2025-03-03 15:06:32,080 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8105: havoc main_~node1__m1~46#1;havoc main_~main____CPAchecker_TMP_0~45#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~51#1; [2025-03-03 15:06:32,080 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4802: havoc main_~node1__m1~28#1;havoc main_~main____CPAchecker_TMP_0~27#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~31#1;havoc main_~node3__m3~19#1;havoc main_~node2__m2~23#1;havoc main_~node1__m1~27#1;havoc main_~main____CPAchecker_TMP_0~26#1;havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~30#1; [2025-03-03 15:06:32,080 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3483: havoc main_~node3__m3~12#1; [2025-03-03 15:06:32,080 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8901: havoc main_~node1____CPAchecker_TMP_1~15#1; [2025-03-03 15:06:32,080 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6259: havoc main_~node1____CPAchecker_TMP_0~9#1; [2025-03-03 15:06:32,080 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4277: havoc main_~node3__m3~16#1;havoc main_~node2__m2~21#1;havoc main_~node1__m1~24#1;havoc main_~main____CPAchecker_TMP_0~23#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~27#1; [2025-03-03 15:06:32,080 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4542: havoc main_~node1____CPAchecker_TMP_0~5#1; [2025-03-03 15:06:32,080 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9695: havoc main_~node1____CPAchecker_TMP_1~17#1;havoc main_~node1__m1~59#1;havoc main_~main____CPAchecker_TMP_0~58#1;havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~64#1;havoc main_~node3__m3~40#1;havoc main_~node2__m2~45#1;havoc main_~node1__m1~58#1;havoc main_~main____CPAchecker_TMP_0~57#1;havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~63#1; [2025-03-03 15:06:32,080 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5864: havoc main_~node3____CPAchecker_TMP_0~7#1; [2025-03-03 15:06:32,080 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7450: havoc main_~node1__m1~43#1;havoc main_~main____CPAchecker_TMP_0~42#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~48#1;havoc main_~node3__m3~31#1;havoc main_~node2__m2~35#1;havoc main_~node1__m1~42#1;havoc main_~main____CPAchecker_TMP_0~41#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~47#1;havoc main_~node3____CPAchecker_TMP_1~8#1; [2025-03-03 15:06:32,080 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L315: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:06:32,080 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7715: havoc main_~node1__m1~45#1;havoc main_~main____CPAchecker_TMP_0~44#1;havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~50#1;havoc main_~node3__m3~32#1;havoc main_~node2__m2~36#1;havoc main_~node1__m1~44#1;havoc main_~main____CPAchecker_TMP_0~43#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~49#1; [2025-03-03 15:06:32,080 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5734: havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-03-03 15:06:32,080 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2432: havoc main_~node2__m2~9#1;havoc main_~node1__m1~12#1;havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~14#1; [2025-03-03 15:06:32,080 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1641: havoc main_~node1__m1~8#1;havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~9#1;havoc main_~node3__m3~7#1;havoc main_~node2__m2~6#1;havoc main_~node1__m1~7#1;havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-03 15:06:32,080 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3888: havoc main_~node1____CPAchecker_TMP_0~4#1; [2025-03-03 15:06:32,080 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3493: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-03 15:06:32,080 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10629: havoc main_~node2__m2~49#1;havoc main_~node1____CPAchecker_TMP_1~19#1;havoc main_~node1__m1~67#1;havoc main_~main____CPAchecker_TMP_0~66#1;havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~72#1;havoc main_~node3__m3~44#1;havoc main_~node2__m2~48#1;havoc main_~node1__m1~66#1;havoc main_~main____CPAchecker_TMP_0~65#1;havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~71#1; [2025-03-03 15:06:32,082 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2571: havoc main_~node2__m2~10#1;havoc main_~node1__m1~13#1;havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~15#1; [2025-03-03 15:06:32,082 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L457: 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;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-03 15:06:32,082 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7460: havoc main_~node1____CPAchecker_TMP_0~12#1; [2025-03-03 15:06:32,082 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10104: havoc main_~node1__m1~62#1;havoc main_~main____CPAchecker_TMP_0~61#1;havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~67#1; [2025-03-03 15:06:32,082 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7859: havoc main_~node1____CPAchecker_TMP_1~12#1; [2025-03-03 15:06:32,082 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2707: havoc main_~node2__m2~11#1;havoc main_~node1__m1~14#1;havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~16#1;havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-03-03 15:06:32,082 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2840: havoc main_~node2__m2~12#1;havoc main_~node1__m1~15#1;havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~17#1; [2025-03-03 15:06:32,082 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10639: havoc main_~node2____CPAchecker_TMP_0~7#1; [2025-03-03 15:06:32,082 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2183: havoc main_~node1__m1~11#1;havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~13#1;havoc main_~node3__m3~9#1;havoc main_~node2__m2~8#1;havoc main_~node1__m1~10#1;havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~12#1; [2025-03-03 15:06:32,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9981: havoc main_~node3__m3~41#1;havoc main_~node2__m2~46#1;havoc main_~node1__m1~61#1;havoc main_~main____CPAchecker_TMP_0~60#1;havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~66#1; [2025-03-03 15:06:32,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9453: havoc main_~node3__m3~39#1;havoc main_~node2____CPAchecker_TMP_1~8#1; [2025-03-03 15:06:32,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2979: havoc main_~node2__m2~13#1;havoc main_~node1__m1~16#1;havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~18#1; [2025-03-03 15:06:32,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5094: havoc main_~node1____CPAchecker_TMP_1~5#1; [2025-03-03 15:06:32,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L999: havoc main_~node3__m3~3#1;havoc main_~node2__m2~3#1;havoc main_~node1__m1~4#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1;havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-03 15:06:32,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8664: havoc main_~node3__m3~36#1; [2025-03-03 15:06:32,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8929: havoc main_~node2__m2~43#1; [2025-03-03 15:06:32,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5626: havoc main_~node1__m1~32#1;havoc main_~main____CPAchecker_TMP_0~31#1;havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~36#1;havoc main_~node3__m3~22#1;havoc main_~node2__m2~26#1;havoc main_~node1__m1~31#1;havoc main_~main____CPAchecker_TMP_0~30#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~35#1; [2025-03-03 15:06:32,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6287: havoc main_~node1____CPAchecker_TMP_1~8#1; [2025-03-03 15:06:32,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4570: havoc main_~node1____CPAchecker_TMP_1~4#1; [2025-03-03 15:06:32,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7214: havoc main_~node2____CPAchecker_TMP_1~4#1;havoc main_~node2__m2~34#1; [2025-03-03 15:06:32,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2193: havoc main_~node1____CPAchecker_TMP_0~3#1; [2025-03-03 15:06:32,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3118: havoc main_~node2__m2~14#1;havoc main_~node1__m1~17#1;havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~19#1; [2025-03-03 15:06:32,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4968: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-03-03 15:06:32,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4838: havoc main_~node2__m2~24#1;havoc main_~node1____CPAchecker_TMP_0~6#1; [2025-03-03 15:06:32,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9463: havoc main_~node3____CPAchecker_TMP_0~11#1; [2025-03-03 15:06:32,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3254: havoc main_~node2__m2~15#1;havoc main_~node1__m1~18#1;havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~20#1;havoc main_~node3____CPAchecker_TMP_1~3#1; [2025-03-03 15:06:32,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8011: havoc main_~node1____CPAchecker_TMP_1~13#1; [2025-03-03 15:06:32,084 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3387: havoc main_~node2__m2~16#1;havoc main_~node1__m1~19#1;havoc main_~main____CPAchecker_TMP_0~18#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~21#1; [2025-03-03 15:06:32,084 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9333: havoc main_~node1____CPAchecker_TMP_1~16#1;havoc main_~node1__m1~56#1;havoc main_~main____CPAchecker_TMP_0~55#1;havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~61#1;havoc main_~node3__m3~38#1;havoc main_~node2__m2~44#1;havoc main_~node1__m1~55#1;havoc main_~main____CPAchecker_TMP_0~54#1;havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~60#1; [2025-03-03 15:06:32,084 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3916: havoc main_~node1____CPAchecker_TMP_1~3#1; [2025-03-03 15:06:32,084 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7748: havoc main_~node2__m2~37#1;havoc main_~node1____CPAchecker_TMP_0~13#1; [2025-03-03 15:06:32,084 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9862: havoc main_~node1__m1~60#1;havoc main_~main____CPAchecker_TMP_0~59#1;havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~65#1;havoc main_~node3____CPAchecker_TMP_1~11#1; [2025-03-03 15:06:32,084 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8674: havoc main_~node3____CPAchecker_TMP_0~10#1; [2025-03-03 15:06:32,084 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5636: havoc main_~node1____CPAchecker_TMP_0~8#1; [2025-03-03 15:06:32,084 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5372: havoc main_~node1____CPAchecker_TMP_0~7#1; [2025-03-03 15:06:32,084 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7489: havoc main_~node1____CPAchecker_TMP_1~11#1; [2025-03-03 15:06:32,084 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1413: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1;havoc main_~node3__m3~6#1;havoc main_~node2__m2~5#1;havoc main_~node1__m1~6#1;havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-03 15:06:32,084 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1285: havoc main_~node3__m3~5#1; [2025-03-03 15:06:32,084 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10668: havoc main_~node2____CPAchecker_TMP_1~9#1; [2025-03-03 15:06:32,267 INFO L? ?]: Removed 1251 outVars from TransFormulas that were not future-live. [2025-03-03 15:06:32,267 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:06:32,301 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:06:32,301 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:06:32,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:06:32 BoogieIcfgContainer [2025-03-03 15:06:32,302 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:06:32,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:06:32,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:06:32,311 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:06:32,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:06:28" (1/3) ... [2025-03-03 15:06:32,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aff0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:06:32, skipping insertion in model container [2025-03-03 15:06:32,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:29" (2/3) ... [2025-03-03 15:06:32,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aff0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:06:32, skipping insertion in model container [2025-03-03 15:06:32,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:06:32" (3/3) ... [2025-03-03 15:06:32,312 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2025-03-03 15:06:32,324 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:06:32,327 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c that has 1 procedures, 1290 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-03 15:06:32,401 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:06:32,409 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;@65f6f27d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:06:32,409 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-03 15:06:32,418 INFO L276 IsEmpty]: Start isEmpty. Operand has 1290 states, 1283 states have (on average 1.7716289945440373) internal successors, (2273), 1289 states have internal predecessors, (2273), 0 states have call successors, (0), 0 states have call 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:32,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 15:06:32,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:32,437 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:06:32,437 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:06:32,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:32,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1609115129, now seen corresponding path program 1 times [2025-03-03 15:06:32,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:32,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69698510] [2025-03-03 15:06:32,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:32,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:32,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 15:06:32,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 15:06:32,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:32,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:32,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:32,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:32,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69698510] [2025-03-03 15:06:32,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69698510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:32,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:32,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:06:32,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447909299] [2025-03-03 15:06:32,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:32,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:06:32,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:32,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:06:32,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:06:32,953 INFO L87 Difference]: Start difference. First operand has 1290 states, 1283 states have (on average 1.7716289945440373) internal successors, (2273), 1289 states have internal predecessors, (2273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 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:06:34,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:34,158 INFO L93 Difference]: Finished difference Result 2514 states and 4326 transitions. [2025-03-03 15:06:34,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:06:34,160 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:06:34,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:34,172 INFO L225 Difference]: With dead ends: 2514 [2025-03-03 15:06:34,172 INFO L226 Difference]: Without dead ends: 1590 [2025-03-03 15:06:34,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:06:34,179 INFO L435 NwaCegarLoop]: 1054 mSDtfsCounter, 7092 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7092 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:34,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7092 Valid, 1556 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:06:34,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2025-03-03 15:06:34,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1584. [2025-03-03 15:06:34,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1578 states have (on average 1.309252217997465) internal successors, (2066), 1583 states have internal predecessors, (2066), 0 states have call successors, (0), 0 states have call 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:34,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2066 transitions. [2025-03-03 15:06:34,276 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2066 transitions. Word has length 52 [2025-03-03 15:06:34,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:34,276 INFO L471 AbstractCegarLoop]: Abstraction has 1584 states and 2066 transitions. [2025-03-03 15:06:34,276 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:06:34,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2066 transitions. [2025-03-03 15:06:34,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 15:06:34,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:34,281 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:06:34,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:06:34,281 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:06:34,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:34,281 INFO L85 PathProgramCache]: Analyzing trace with hash -2081202363, now seen corresponding path program 1 times [2025-03-03 15:06:34,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:34,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210708071] [2025-03-03 15:06:34,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:34,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:34,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 15:06:34,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 15:06:34,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:34,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:34,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:34,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:34,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210708071] [2025-03-03 15:06:34,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210708071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:34,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:34,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:06:34,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985670558] [2025-03-03 15:06:34,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:34,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:06:34,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:34,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:06:34,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:06:34,446 INFO L87 Difference]: Start difference. First operand 1584 states and 2066 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:06:35,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:35,129 INFO L93 Difference]: Finished difference Result 3109 states and 4114 transitions. [2025-03-03 15:06:35,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:06:35,130 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:06:35,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:35,137 INFO L225 Difference]: With dead ends: 3109 [2025-03-03 15:06:35,137 INFO L226 Difference]: Without dead ends: 2028 [2025-03-03 15:06:35,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:06:35,140 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 4606 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4606 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:35,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4606 Valid, 950 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:06:35,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2025-03-03 15:06:35,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 2018. [2025-03-03 15:06:35,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2018 states, 2012 states have (on average 1.3205765407554673) internal successors, (2657), 2017 states have internal predecessors, (2657), 0 states have call successors, (0), 0 states have call 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:35,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 2018 states and 2657 transitions. [2025-03-03 15:06:35,226 INFO L78 Accepts]: Start accepts. Automaton has 2018 states and 2657 transitions. Word has length 53 [2025-03-03 15:06:35,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:35,227 INFO L471 AbstractCegarLoop]: Abstraction has 2018 states and 2657 transitions. [2025-03-03 15:06:35,227 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:06:35,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 2657 transitions. [2025-03-03 15:06:35,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 15:06:35,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:35,233 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:06:35,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:06:35,234 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:06:35,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:35,237 INFO L85 PathProgramCache]: Analyzing trace with hash -301575427, now seen corresponding path program 1 times [2025-03-03 15:06:35,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:35,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039675719] [2025-03-03 15:06:35,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:35,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:35,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 15:06:35,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 15:06:35,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:35,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:35,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:35,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039675719] [2025-03-03 15:06:35,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039675719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:35,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:35,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:06:35,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278749795] [2025-03-03 15:06:35,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:35,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:06:35,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:35,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:06:35,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:06:35,375 INFO L87 Difference]: Start difference. First operand 2018 states and 2657 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:06:36,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:36,013 INFO L93 Difference]: Finished difference Result 4410 states and 5826 transitions. [2025-03-03 15:06:36,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:06:36,013 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:06:36,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:36,022 INFO L225 Difference]: With dead ends: 4410 [2025-03-03 15:06:36,022 INFO L226 Difference]: Without dead ends: 3076 [2025-03-03 15:06:36,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:06:36,024 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 4476 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4476 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:36,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4476 Valid, 974 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:06:36,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3076 states. [2025-03-03 15:06:36,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3076 to 3062. [2025-03-03 15:06:36,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3062 states, 3056 states have (on average 1.3236256544502618) internal successors, (4045), 3061 states have internal predecessors, (4045), 0 states have call successors, (0), 0 states have call 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:36,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 4045 transitions. [2025-03-03 15:06:36,072 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 4045 transitions. Word has length 53 [2025-03-03 15:06:36,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:36,073 INFO L471 AbstractCegarLoop]: Abstraction has 3062 states and 4045 transitions. [2025-03-03 15:06:36,073 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:06:36,073 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 4045 transitions. [2025-03-03 15:06:36,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 15:06:36,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:36,075 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:06:36,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:06:36,075 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:06:36,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:36,075 INFO L85 PathProgramCache]: Analyzing trace with hash 600357631, now seen corresponding path program 1 times [2025-03-03 15:06:36,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:36,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826651933] [2025-03-03 15:06:36,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:36,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:36,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 15:06:36,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 15:06:36,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:36,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:36,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:36,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:36,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826651933] [2025-03-03 15:06:36,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826651933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:36,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:36,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:06:36,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810874408] [2025-03-03 15:06:36,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:36,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:06:36,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:36,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:06:36,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:06:36,466 INFO L87 Difference]: Start difference. First operand 3062 states and 4045 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:06:37,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:37,471 INFO L93 Difference]: Finished difference Result 4439 states and 5985 transitions. [2025-03-03 15:06:37,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:06:37,472 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:06:37,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:37,482 INFO L225 Difference]: With dead ends: 4439 [2025-03-03 15:06:37,482 INFO L226 Difference]: Without dead ends: 3735 [2025-03-03 15:06:37,483 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:06:37,484 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 5099 mSDsluCounter, 2246 mSDsCounter, 0 mSdLazyCounter, 2305 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5099 SdHoareTripleChecker+Valid, 2877 SdHoareTripleChecker+Invalid, 2314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:37,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5099 Valid, 2877 Invalid, 2314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2305 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:06:37,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3735 states. [2025-03-03 15:06:37,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3735 to 3062. [2025-03-03 15:06:37,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3062 states, 3056 states have (on average 1.3232984293193717) internal successors, (4044), 3061 states have internal predecessors, (4044), 0 states have call successors, (0), 0 states have call 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:37,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 4044 transitions. [2025-03-03 15:06:37,543 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 4044 transitions. Word has length 55 [2025-03-03 15:06:37,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:37,543 INFO L471 AbstractCegarLoop]: Abstraction has 3062 states and 4044 transitions. [2025-03-03 15:06:37,543 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:06:37,543 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 4044 transitions. [2025-03-03 15:06:37,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 15:06:37,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:37,546 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:06:37,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:06:37,546 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:06:37,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:37,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1446921800, now seen corresponding path program 1 times [2025-03-03 15:06:37,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:37,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862801011] [2025-03-03 15:06:37,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:37,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:37,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 15:06:37,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 15:06:37,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:37,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:37,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:37,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:37,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862801011] [2025-03-03 15:06:37,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862801011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:37,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:37,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:06:37,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881660008] [2025-03-03 15:06:37,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:37,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:06:37,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:37,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:06:37,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:06:37,889 INFO L87 Difference]: Start difference. First operand 3062 states and 4044 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:06:39,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:39,493 INFO L93 Difference]: Finished difference Result 5435 states and 7347 transitions. [2025-03-03 15:06:39,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:06:39,493 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:06:39,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:39,504 INFO L225 Difference]: With dead ends: 5435 [2025-03-03 15:06:39,504 INFO L226 Difference]: Without dead ends: 4865 [2025-03-03 15:06:39,505 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:06:39,506 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 5405 mSDsluCounter, 3170 mSDsCounter, 0 mSdLazyCounter, 3896 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5405 SdHoareTripleChecker+Valid, 3907 SdHoareTripleChecker+Invalid, 3950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 3896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:39,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5405 Valid, 3907 Invalid, 3950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 3896 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 15:06:39,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4865 states. [2025-03-03 15:06:39,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4865 to 3062. [2025-03-03 15:06:39,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3062 states, 3056 states have (on average 1.3229712041884816) internal successors, (4043), 3061 states have internal predecessors, (4043), 0 states have call successors, (0), 0 states have call 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:39,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 4043 transitions. [2025-03-03 15:06:39,554 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 4043 transitions. Word has length 55 [2025-03-03 15:06:39,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:39,555 INFO L471 AbstractCegarLoop]: Abstraction has 3062 states and 4043 transitions. [2025-03-03 15:06:39,555 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:06:39,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 4043 transitions. [2025-03-03 15:06:39,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 15:06:39,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:39,557 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:06:39,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:06:39,557 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:06:39,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:39,558 INFO L85 PathProgramCache]: Analyzing trace with hash -383016193, now seen corresponding path program 1 times [2025-03-03 15:06:39,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:39,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025660042] [2025-03-03 15:06:39,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:39,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:39,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 15:06:39,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 15:06:39,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:39,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:39,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:39,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:39,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025660042] [2025-03-03 15:06:39,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025660042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:39,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:39,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:06:39,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943470873] [2025-03-03 15:06:39,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:39,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:06:39,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:39,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:06:39,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:06:39,781 INFO L87 Difference]: Start difference. First operand 3062 states and 4043 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:06:40,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:40,785 INFO L93 Difference]: Finished difference Result 3819 states and 5039 transitions. [2025-03-03 15:06:40,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:06:40,786 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:06:40,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:40,794 INFO L225 Difference]: With dead ends: 3819 [2025-03-03 15:06:40,795 INFO L226 Difference]: Without dead ends: 3813 [2025-03-03 15:06:40,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:06:40,796 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 6162 mSDsluCounter, 2162 mSDsCounter, 0 mSdLazyCounter, 2473 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6162 SdHoareTripleChecker+Valid, 2817 SdHoareTripleChecker+Invalid, 2507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:40,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6162 Valid, 2817 Invalid, 2507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2473 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:06:40,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3813 states. [2025-03-03 15:06:40,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3813 to 3062. [2025-03-03 15:06:40,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3062 states, 3056 states have (on average 1.3226439790575917) internal successors, (4042), 3061 states have internal predecessors, (4042), 0 states have call successors, (0), 0 states have call 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:40,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 4042 transitions. [2025-03-03 15:06:40,849 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 4042 transitions. Word has length 55 [2025-03-03 15:06:40,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:40,850 INFO L471 AbstractCegarLoop]: Abstraction has 3062 states and 4042 transitions. [2025-03-03 15:06:40,850 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:06:40,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 4042 transitions. [2025-03-03 15:06:40,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 15:06:40,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:40,852 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:06:40,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:06:40,852 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:06:40,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:40,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1229886782, now seen corresponding path program 1 times [2025-03-03 15:06:40,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:40,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914768237] [2025-03-03 15:06:40,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:40,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:40,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 15:06:40,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 15:06:40,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:40,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:40,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:40,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:40,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914768237] [2025-03-03 15:06:40,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914768237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:40,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:40,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:40,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399493039] [2025-03-03 15:06:40,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:40,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:40,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:40,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:40,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:40,905 INFO L87 Difference]: Start difference. First operand 3062 states and 4042 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:06:40,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:40,993 INFO L93 Difference]: Finished difference Result 5375 states and 7220 transitions. [2025-03-03 15:06:40,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:40,994 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:06:40,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:41,002 INFO L225 Difference]: With dead ends: 5375 [2025-03-03 15:06:41,002 INFO L226 Difference]: Without dead ends: 3744 [2025-03-03 15:06:41,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:41,005 INFO L435 NwaCegarLoop]: 1249 mSDtfsCounter, 667 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 2023 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:41,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 2023 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:06:41,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3744 states. [2025-03-03 15:06:41,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3744 to 3738. [2025-03-03 15:06:41,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3738 states, 3732 states have (on average 1.3086816720257235) internal successors, (4884), 3737 states have internal predecessors, (4884), 0 states have call successors, (0), 0 states have call 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:41,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3738 states to 3738 states and 4884 transitions. [2025-03-03 15:06:41,044 INFO L78 Accepts]: Start accepts. Automaton has 3738 states and 4884 transitions. Word has length 56 [2025-03-03 15:06:41,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:41,044 INFO L471 AbstractCegarLoop]: Abstraction has 3738 states and 4884 transitions. [2025-03-03 15:06:41,044 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:06:41,044 INFO L276 IsEmpty]: Start isEmpty. Operand 3738 states and 4884 transitions. [2025-03-03 15:06:41,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 15:06:41,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:41,046 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:06:41,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:06:41,046 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:06:41,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:41,047 INFO L85 PathProgramCache]: Analyzing trace with hash -781569823, now seen corresponding path program 1 times [2025-03-03 15:06:41,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:41,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209017048] [2025-03-03 15:06:41,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:41,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:41,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 15:06:41,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 15:06:41,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:41,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:41,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:41,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:41,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209017048] [2025-03-03 15:06:41,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209017048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:41,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:41,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:41,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094459884] [2025-03-03 15:06:41,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:41,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:41,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:41,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:41,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:41,103 INFO L87 Difference]: Start difference. First operand 3738 states and 4884 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:06:41,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:41,149 INFO L93 Difference]: Finished difference Result 5438 states and 7445 transitions. [2025-03-03 15:06:41,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:41,150 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:06:41,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:41,158 INFO L225 Difference]: With dead ends: 5438 [2025-03-03 15:06:41,158 INFO L226 Difference]: Without dead ends: 4086 [2025-03-03 15:06:41,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:41,160 INFO L435 NwaCegarLoop]: 1152 mSDtfsCounter, 563 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1740 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:41,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1740 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:41,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4086 states. [2025-03-03 15:06:41,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4086 to 4084. [2025-03-03 15:06:41,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4084 states, 4078 states have (on average 1.3366846493379108) internal successors, (5451), 4083 states have internal predecessors, (5451), 0 states have call successors, (0), 0 states have call 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:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4084 states to 4084 states and 5451 transitions. [2025-03-03 15:06:41,226 INFO L78 Accepts]: Start accepts. Automaton has 4084 states and 5451 transitions. Word has length 56 [2025-03-03 15:06:41,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:41,227 INFO L471 AbstractCegarLoop]: Abstraction has 4084 states and 5451 transitions. [2025-03-03 15:06:41,231 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:06:41,231 INFO L276 IsEmpty]: Start isEmpty. Operand 4084 states and 5451 transitions. [2025-03-03 15:06:41,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 15:06:41,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:41,233 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:06:41,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:06:41,233 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:06:41,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:41,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1529556222, now seen corresponding path program 1 times [2025-03-03 15:06:41,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:41,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621196660] [2025-03-03 15:06:41,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:41,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:41,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 15:06:41,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 15:06:41,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:41,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:41,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:41,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:41,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621196660] [2025-03-03 15:06:41,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621196660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:41,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:41,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:41,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982445533] [2025-03-03 15:06:41,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:41,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:41,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:41,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:41,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:41,288 INFO L87 Difference]: Start difference. First operand 4084 states and 5451 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:06:41,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:41,343 INFO L93 Difference]: Finished difference Result 7070 states and 9906 transitions. [2025-03-03 15:06:41,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:41,344 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:06:41,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:41,355 INFO L225 Difference]: With dead ends: 7070 [2025-03-03 15:06:41,355 INFO L226 Difference]: Without dead ends: 5076 [2025-03-03 15:06:41,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:41,358 INFO L435 NwaCegarLoop]: 1138 mSDtfsCounter, 570 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:41,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1704 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:41,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5076 states. [2025-03-03 15:06:41,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5076 to 5074. [2025-03-03 15:06:41,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5074 states, 5068 states have (on average 1.3681925808997633) internal successors, (6934), 5073 states have internal predecessors, (6934), 0 states have call successors, (0), 0 states have call 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:41,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5074 states to 5074 states and 6934 transitions. [2025-03-03 15:06:41,411 INFO L78 Accepts]: Start accepts. Automaton has 5074 states and 6934 transitions. Word has length 56 [2025-03-03 15:06:41,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:41,411 INFO L471 AbstractCegarLoop]: Abstraction has 5074 states and 6934 transitions. [2025-03-03 15:06:41,411 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:06:41,411 INFO L276 IsEmpty]: Start isEmpty. Operand 5074 states and 6934 transitions. [2025-03-03 15:06:41,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 15:06:41,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:41,413 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:06:41,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:06:41,413 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:06:41,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:41,417 INFO L85 PathProgramCache]: Analyzing trace with hash 88833455, now seen corresponding path program 1 times [2025-03-03 15:06:41,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:41,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804111309] [2025-03-03 15:06:41,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:41,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:41,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 15:06:41,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 15:06:41,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:41,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:41,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:41,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:41,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804111309] [2025-03-03 15:06:41,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804111309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:41,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:41,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:41,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869417651] [2025-03-03 15:06:41,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:41,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:41,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:41,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:41,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:41,458 INFO L87 Difference]: Start difference. First operand 5074 states and 6934 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:06:41,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:41,544 INFO L93 Difference]: Finished difference Result 9413 states and 13135 transitions. [2025-03-03 15:06:41,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:41,544 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:06:41,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:41,555 INFO L225 Difference]: With dead ends: 9413 [2025-03-03 15:06:41,555 INFO L226 Difference]: Without dead ends: 5384 [2025-03-03 15:06:41,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:41,559 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 811 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:41,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 1244 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:06:41,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5384 states. [2025-03-03 15:06:41,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5384 to 4317. [2025-03-03 15:06:41,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4317 states, 4312 states have (on average 1.3833487940630798) internal successors, (5965), 4316 states have internal predecessors, (5965), 0 states have call successors, (0), 0 states have call 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:41,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4317 states to 4317 states and 5965 transitions. [2025-03-03 15:06:41,607 INFO L78 Accepts]: Start accepts. Automaton has 4317 states and 5965 transitions. Word has length 57 [2025-03-03 15:06:41,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:41,607 INFO L471 AbstractCegarLoop]: Abstraction has 4317 states and 5965 transitions. [2025-03-03 15:06:41,607 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:06:41,607 INFO L276 IsEmpty]: Start isEmpty. Operand 4317 states and 5965 transitions. [2025-03-03 15:06:41,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 15:06:41,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:41,609 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:06:41,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:06:41,609 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:06:41,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:41,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1380138244, now seen corresponding path program 1 times [2025-03-03 15:06:41,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:41,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999948219] [2025-03-03 15:06:41,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:41,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:41,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 15:06:41,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 15:06:41,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:41,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:41,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:41,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:41,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999948219] [2025-03-03 15:06:41,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999948219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:41,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:41,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:41,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7273660] [2025-03-03 15:06:41,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:41,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:41,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:41,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:41,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:41,650 INFO L87 Difference]: Start difference. First operand 4317 states and 5965 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:06:41,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:41,712 INFO L93 Difference]: Finished difference Result 8355 states and 11764 transitions. [2025-03-03 15:06:41,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:41,713 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:06:41,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:41,719 INFO L225 Difference]: With dead ends: 8355 [2025-03-03 15:06:41,719 INFO L226 Difference]: Without dead ends: 4731 [2025-03-03 15:06:41,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:41,723 INFO L435 NwaCegarLoop]: 679 mSDtfsCounter, 660 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:41,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 961 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:41,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4731 states. [2025-03-03 15:06:41,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4731 to 3831. [2025-03-03 15:06:41,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3831 states, 3827 states have (on average 1.3971779461719362) internal successors, (5347), 3830 states have internal predecessors, (5347), 0 states have call successors, (0), 0 states have call 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:41,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3831 states to 3831 states and 5347 transitions. [2025-03-03 15:06:41,789 INFO L78 Accepts]: Start accepts. Automaton has 3831 states and 5347 transitions. Word has length 57 [2025-03-03 15:06:41,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:41,789 INFO L471 AbstractCegarLoop]: Abstraction has 3831 states and 5347 transitions. [2025-03-03 15:06:41,789 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:06:41,789 INFO L276 IsEmpty]: Start isEmpty. Operand 3831 states and 5347 transitions. [2025-03-03 15:06:41,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 15:06:41,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:41,791 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:06:41,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:06:41,791 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:06:41,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:41,791 INFO L85 PathProgramCache]: Analyzing trace with hash 614400553, now seen corresponding path program 1 times [2025-03-03 15:06:41,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:41,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127629759] [2025-03-03 15:06:41,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:41,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:41,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 15:06:41,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 15:06:41,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:41,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:42,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:42,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:42,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127629759] [2025-03-03 15:06:42,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127629759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:42,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:42,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 15:06:42,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476769979] [2025-03-03 15:06:42,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:42,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:06:42,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:42,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:06:42,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:06:42,173 INFO L87 Difference]: Start difference. First operand 3831 states and 5347 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 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:06:42,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:42,665 INFO L93 Difference]: Finished difference Result 5410 states and 7616 transitions. [2025-03-03 15:06:42,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 15:06:42,666 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 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:06:42,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:42,690 INFO L225 Difference]: With dead ends: 5410 [2025-03-03 15:06:42,690 INFO L226 Difference]: Without dead ends: 5310 [2025-03-03 15:06:42,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-03-03 15:06:42,691 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 1862 mSDsluCounter, 2757 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1862 SdHoareTripleChecker+Valid, 3318 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:42,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1862 Valid, 3318 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:06:42,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5310 states. [2025-03-03 15:06:42,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5310 to 3781. [2025-03-03 15:06:42,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3781 states, 3779 states have (on average 1.3987827467584018) internal successors, (5286), 3780 states have internal predecessors, (5286), 0 states have call successors, (0), 0 states have call 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:42,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3781 states to 3781 states and 5286 transitions. [2025-03-03 15:06:42,729 INFO L78 Accepts]: Start accepts. Automaton has 3781 states and 5286 transitions. Word has length 57 [2025-03-03 15:06:42,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:42,729 INFO L471 AbstractCegarLoop]: Abstraction has 3781 states and 5286 transitions. [2025-03-03 15:06:42,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 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:06:42,730 INFO L276 IsEmpty]: Start isEmpty. Operand 3781 states and 5286 transitions. [2025-03-03 15:06:42,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 15:06:42,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:42,731 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:06:42,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:06:42,732 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:06:42,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:42,734 INFO L85 PathProgramCache]: Analyzing trace with hash -467226064, now seen corresponding path program 1 times [2025-03-03 15:06:42,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:42,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663400706] [2025-03-03 15:06:42,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:42,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:42,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 15:06:42,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 15:06:42,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:42,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:42,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:42,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:42,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663400706] [2025-03-03 15:06:42,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663400706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:42,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:42,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:42,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866684115] [2025-03-03 15:06:42,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:42,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:42,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:42,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:42,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:42,782 INFO L87 Difference]: Start difference. First operand 3781 states and 5286 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:06:42,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:42,871 INFO L93 Difference]: Finished difference Result 7606 states and 10805 transitions. [2025-03-03 15:06:42,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:42,872 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:06:42,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:42,877 INFO L225 Difference]: With dead ends: 7606 [2025-03-03 15:06:42,877 INFO L226 Difference]: Without dead ends: 4167 [2025-03-03 15:06:42,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:42,880 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 504 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:42,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 863 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:06:42,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4167 states. [2025-03-03 15:06:42,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4167 to 3334. [2025-03-03 15:06:42,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3334 states, 3332 states have (on average 1.414765906362545) internal successors, (4714), 3333 states have internal predecessors, (4714), 0 states have call successors, (0), 0 states have call 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:42,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 4714 transitions. [2025-03-03 15:06:42,913 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 4714 transitions. Word has length 57 [2025-03-03 15:06:42,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:42,913 INFO L471 AbstractCegarLoop]: Abstraction has 3334 states and 4714 transitions. [2025-03-03 15:06:42,913 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:06:42,913 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 4714 transitions. [2025-03-03 15:06:42,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 15:06:42,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:42,914 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:06:42,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:06:42,914 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:06:42,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:42,915 INFO L85 PathProgramCache]: Analyzing trace with hash 571156854, now seen corresponding path program 1 times [2025-03-03 15:06:42,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:42,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635268690] [2025-03-03 15:06:42,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:42,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:42,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 15:06:42,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 15:06:42,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:42,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:43,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:43,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:43,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635268690] [2025-03-03 15:06:43,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635268690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:43,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:43,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:06:43,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214681434] [2025-03-03 15:06:43,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:43,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:06:43,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:43,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:06:43,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:06:43,330 INFO L87 Difference]: Start difference. First operand 3334 states and 4714 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 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:06:43,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:43,990 INFO L93 Difference]: Finished difference Result 6675 states and 9480 transitions. [2025-03-03 15:06:43,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:06:43,990 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 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:06:43,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:44,000 INFO L225 Difference]: With dead ends: 6675 [2025-03-03 15:06:44,000 INFO L226 Difference]: Without dead ends: 6596 [2025-03-03 15:06:44,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:06:44,002 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 3094 mSDsluCounter, 2397 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3094 SdHoareTripleChecker+Valid, 2983 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:44,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3094 Valid, 2983 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:06:44,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6596 states. [2025-03-03 15:06:44,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6596 to 3305. [2025-03-03 15:06:44,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3305 states, 3304 states have (on average 1.4155569007263922) internal successors, (4677), 3304 states have internal predecessors, (4677), 0 states have call successors, (0), 0 states have call 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:44,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 4677 transitions. [2025-03-03 15:06:44,039 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 4677 transitions. Word has length 58 [2025-03-03 15:06:44,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:44,039 INFO L471 AbstractCegarLoop]: Abstraction has 3305 states and 4677 transitions. [2025-03-03 15:06:44,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 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:06:44,040 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 4677 transitions. [2025-03-03 15:06:44,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 15:06:44,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:44,041 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:44,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:06:44,041 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:06:44,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:44,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1069325393, now seen corresponding path program 1 times [2025-03-03 15:06:44,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:44,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121653593] [2025-03-03 15:06:44,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:44,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:44,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 15:06:44,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 15:06:44,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:44,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:44,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:44,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:44,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121653593] [2025-03-03 15:06:44,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121653593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:44,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:44,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:06:44,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941683105] [2025-03-03 15:06:44,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:44,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:06:44,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:44,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:06:44,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:06:44,114 INFO L87 Difference]: Start difference. First operand 3305 states and 4677 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:44,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:44,189 INFO L93 Difference]: Finished difference Result 10423 states and 15071 transitions. [2025-03-03 15:06:44,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:06:44,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-03 15:06:44,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:44,200 INFO L225 Difference]: With dead ends: 10423 [2025-03-03 15:06:44,200 INFO L226 Difference]: Without dead ends: 7637 [2025-03-03 15:06:44,204 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:06:44,204 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 1590 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:44,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1590 Valid, 959 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7637 states. [2025-03-03 15:06:44,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7637 to 5781. [2025-03-03 15:06:44,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5781 states, 5780 states have (on average 1.41401384083045) internal successors, (8173), 5780 states have internal predecessors, (8173), 0 states have call successors, (0), 0 states have call 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:44,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5781 states to 5781 states and 8173 transitions. [2025-03-03 15:06:44,289 INFO L78 Accepts]: Start accepts. Automaton has 5781 states and 8173 transitions. Word has length 66 [2025-03-03 15:06:44,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:44,289 INFO L471 AbstractCegarLoop]: Abstraction has 5781 states and 8173 transitions. [2025-03-03 15:06:44,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:44,290 INFO L276 IsEmpty]: Start isEmpty. Operand 5781 states and 8173 transitions. [2025-03-03 15:06:44,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:06:44,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:44,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:44,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:06:44,292 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:06:44,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:44,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1280961482, now seen corresponding path program 1 times [2025-03-03 15:06:44,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:44,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044337415] [2025-03-03 15:06:44,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:44,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:44,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:06:44,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:06:44,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:44,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:44,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:44,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:44,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044337415] [2025-03-03 15:06:44,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044337415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:44,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:44,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:06:44,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809334375] [2025-03-03 15:06:44,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:44,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:06:44,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:44,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:06:44,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:06:44,394 INFO L87 Difference]: Start difference. First operand 5781 states and 8173 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:44,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:44,471 INFO L93 Difference]: Finished difference Result 9087 states and 12892 transitions. [2025-03-03 15:06:44,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:06:44,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 15:06:44,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:44,478 INFO L225 Difference]: With dead ends: 9087 [2025-03-03 15:06:44,478 INFO L226 Difference]: Without dead ends: 3803 [2025-03-03 15:06:44,483 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:06:44,484 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 904 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:44,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 772 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:06:44,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3803 states. [2025-03-03 15:06:44,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3803 to 3799. [2025-03-03 15:06:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3799 states, 3798 states have (on average 1.3886255924170616) internal successors, (5274), 3798 states have internal predecessors, (5274), 0 states have call successors, (0), 0 states have call 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:44,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3799 states to 3799 states and 5274 transitions. [2025-03-03 15:06:44,528 INFO L78 Accepts]: Start accepts. Automaton has 3799 states and 5274 transitions. Word has length 67 [2025-03-03 15:06:44,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:44,528 INFO L471 AbstractCegarLoop]: Abstraction has 3799 states and 5274 transitions. [2025-03-03 15:06:44,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:44,528 INFO L276 IsEmpty]: Start isEmpty. Operand 3799 states and 5274 transitions. [2025-03-03 15:06:44,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:06:44,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:44,530 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:06:44,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:06:44,530 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:06:44,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:44,532 INFO L85 PathProgramCache]: Analyzing trace with hash 303604859, now seen corresponding path program 1 times [2025-03-03 15:06:44,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:44,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904850203] [2025-03-03 15:06:44,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:44,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:44,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:06:44,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:06:44,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:44,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:44,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:44,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:44,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904850203] [2025-03-03 15:06:44,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904850203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:44,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:44,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:44,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183192048] [2025-03-03 15:06:44,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:44,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:44,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:44,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:44,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:44,619 INFO L87 Difference]: Start difference. First operand 3799 states and 5274 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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:06:44,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:44,675 INFO L93 Difference]: Finished difference Result 10089 states and 14200 transitions. [2025-03-03 15:06:44,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:44,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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:06:44,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:44,686 INFO L225 Difference]: With dead ends: 10089 [2025-03-03 15:06:44,686 INFO L226 Difference]: Without dead ends: 6787 [2025-03-03 15:06:44,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:44,691 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 253 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:44,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 808 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:44,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6787 states. [2025-03-03 15:06:44,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6787 to 6369. [2025-03-03 15:06:44,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6369 states, 6368 states have (on average 1.391645728643216) internal successors, (8862), 6368 states have internal predecessors, (8862), 0 states have call successors, (0), 0 states have call 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:44,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6369 states to 6369 states and 8862 transitions. [2025-03-03 15:06:44,762 INFO L78 Accepts]: Start accepts. Automaton has 6369 states and 8862 transitions. Word has length 69 [2025-03-03 15:06:44,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:44,762 INFO L471 AbstractCegarLoop]: Abstraction has 6369 states and 8862 transitions. [2025-03-03 15:06:44,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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:06:44,763 INFO L276 IsEmpty]: Start isEmpty. Operand 6369 states and 8862 transitions. [2025-03-03 15:06:44,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:06:44,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:44,764 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:44,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:06:44,764 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:06:44,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:44,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1727396155, now seen corresponding path program 1 times [2025-03-03 15:06:44,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:44,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761777465] [2025-03-03 15:06:44,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:44,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:44,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:06:44,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:06:44,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:44,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:44,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:44,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:44,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761777465] [2025-03-03 15:06:44,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761777465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:44,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:44,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:44,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526416236] [2025-03-03 15:06:44,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:44,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:44,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:44,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:44,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:44,872 INFO L87 Difference]: Start difference. First operand 6369 states and 8862 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:44,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:44,933 INFO L93 Difference]: Finished difference Result 17487 states and 24458 transitions. [2025-03-03 15:06:44,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:44,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-03 15:06:44,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:44,949 INFO L225 Difference]: With dead ends: 17487 [2025-03-03 15:06:44,949 INFO L226 Difference]: Without dead ends: 11599 [2025-03-03 15:06:44,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:44,957 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 288 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:44,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 777 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:44,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11599 states. [2025-03-03 15:06:45,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11599 to 10765. [2025-03-03 15:06:45,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10765 states, 10764 states have (on average 1.3831289483463396) internal successors, (14888), 10764 states have internal predecessors, (14888), 0 states have call successors, (0), 0 states have call 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:45,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10765 states to 10765 states and 14888 transitions. [2025-03-03 15:06:45,070 INFO L78 Accepts]: Start accepts. Automaton has 10765 states and 14888 transitions. Word has length 72 [2025-03-03 15:06:45,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:45,070 INFO L471 AbstractCegarLoop]: Abstraction has 10765 states and 14888 transitions. [2025-03-03 15:06:45,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:45,070 INFO L276 IsEmpty]: Start isEmpty. Operand 10765 states and 14888 transitions. [2025-03-03 15:06:45,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:06:45,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:45,073 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:45,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:06:45,073 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:06:45,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:45,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1474491779, now seen corresponding path program 1 times [2025-03-03 15:06:45,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:45,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131360540] [2025-03-03 15:06:45,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:45,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:45,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:06:45,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:06:45,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:45,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:45,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:45,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:45,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131360540] [2025-03-03 15:06:45,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131360540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:45,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:45,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:06:45,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981712634] [2025-03-03 15:06:45,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:45,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:06:45,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:45,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:06:45,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:06:45,262 INFO L87 Difference]: Start difference. First operand 10765 states and 14888 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:45,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:45,812 INFO L93 Difference]: Finished difference Result 19976 states and 27626 transitions. [2025-03-03 15:06:45,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:06:45,813 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-03 15:06:45,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:45,835 INFO L225 Difference]: With dead ends: 19976 [2025-03-03 15:06:45,835 INFO L226 Difference]: Without dead ends: 15508 [2025-03-03 15:06:45,843 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:06:45,843 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 2556 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2556 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:45,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2556 Valid, 1130 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:06:45,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15508 states. [2025-03-03 15:06:45,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15508 to 10747. [2025-03-03 15:06:45,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10747 states, 10746 states have (on average 1.3835845896147403) internal successors, (14868), 10746 states have internal predecessors, (14868), 0 states have call successors, (0), 0 states have call 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:45,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10747 states to 10747 states and 14868 transitions. [2025-03-03 15:06:45,995 INFO L78 Accepts]: Start accepts. Automaton has 10747 states and 14868 transitions. Word has length 72 [2025-03-03 15:06:45,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:45,995 INFO L471 AbstractCegarLoop]: Abstraction has 10747 states and 14868 transitions. [2025-03-03 15:06:45,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:45,995 INFO L276 IsEmpty]: Start isEmpty. Operand 10747 states and 14868 transitions. [2025-03-03 15:06:45,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:06:45,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:45,996 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:45,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:06:45,997 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:06:45,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:45,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2070876140, now seen corresponding path program 1 times [2025-03-03 15:06:45,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:45,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070054060] [2025-03-03 15:06:45,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:45,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:46,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:06:46,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:06:46,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:46,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:46,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:46,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:46,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070054060] [2025-03-03 15:06:46,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070054060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:46,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:46,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:06:46,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226650903] [2025-03-03 15:06:46,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:46,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:06:46,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:46,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:06:46,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:06:46,174 INFO L87 Difference]: Start difference. First operand 10747 states and 14868 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:46,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:46,241 INFO L93 Difference]: Finished difference Result 11637 states and 16053 transitions. [2025-03-03 15:06:46,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:06:46,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-03 15:06:46,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:46,256 INFO L225 Difference]: With dead ends: 11637 [2025-03-03 15:06:46,256 INFO L226 Difference]: Without dead ends: 11635 [2025-03-03 15:06:46,260 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:06:46,260 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 0 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2352 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:46,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2352 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:46,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11635 states. [2025-03-03 15:06:46,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11635 to 11635. [2025-03-03 15:06:46,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11635 states, 11634 states have (on average 1.3543063434760185) internal successors, (15756), 11634 states have internal predecessors, (15756), 0 states have call successors, (0), 0 states have call 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:46,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11635 states to 11635 states and 15756 transitions. [2025-03-03 15:06:46,410 INFO L78 Accepts]: Start accepts. Automaton has 11635 states and 15756 transitions. Word has length 72 [2025-03-03 15:06:46,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:46,411 INFO L471 AbstractCegarLoop]: Abstraction has 11635 states and 15756 transitions. [2025-03-03 15:06:46,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:46,411 INFO L276 IsEmpty]: Start isEmpty. Operand 11635 states and 15756 transitions. [2025-03-03 15:06:46,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 15:06:46,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:46,412 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:06:46,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:06:46,413 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:06:46,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:46,413 INFO L85 PathProgramCache]: Analyzing trace with hash -38828115, now seen corresponding path program 1 times [2025-03-03 15:06:46,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:46,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937227521] [2025-03-03 15:06:46,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:46,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:46,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 15:06:46,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 15:06:46,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:46,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:46,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:46,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:46,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937227521] [2025-03-03 15:06:46,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937227521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:46,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:46,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:46,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110325441] [2025-03-03 15:06:46,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:46,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:46,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:46,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:46,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:46,464 INFO L87 Difference]: Start difference. First operand 11635 states and 15756 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:06:46,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:46,542 INFO L93 Difference]: Finished difference Result 31536 states and 42727 transitions. [2025-03-03 15:06:46,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:46,542 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:06:46,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:46,570 INFO L225 Difference]: With dead ends: 31536 [2025-03-03 15:06:46,570 INFO L226 Difference]: Without dead ends: 20366 [2025-03-03 15:06:46,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:46,584 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 280 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:46,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 737 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:46,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20366 states. [2025-03-03 15:06:46,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20366 to 20364. [2025-03-03 15:06:46,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20364 states, 20363 states have (on average 1.335215832637627) internal successors, (27189), 20363 states have internal predecessors, (27189), 0 states have call successors, (0), 0 states have call 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:46,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20364 states to 20364 states and 27189 transitions. [2025-03-03 15:06:46,766 INFO L78 Accepts]: Start accepts. Automaton has 20364 states and 27189 transitions. Word has length 73 [2025-03-03 15:06:46,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:46,766 INFO L471 AbstractCegarLoop]: Abstraction has 20364 states and 27189 transitions. [2025-03-03 15:06:46,766 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:06:46,766 INFO L276 IsEmpty]: Start isEmpty. Operand 20364 states and 27189 transitions. [2025-03-03 15:06:46,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:06:46,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:46,768 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:06:46,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:06:46,768 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:06:46,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:46,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1283325509, now seen corresponding path program 1 times [2025-03-03 15:06:46,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:46,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422112947] [2025-03-03 15:06:46,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:46,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:46,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:06:46,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:06:46,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:46,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:46,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:46,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:46,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422112947] [2025-03-03 15:06:46,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422112947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:46,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:46,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:06:46,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757612218] [2025-03-03 15:06:46,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:46,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:06:46,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:46,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:06:46,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:06:46,904 INFO L87 Difference]: Start difference. First operand 20364 states and 27189 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:06:47,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:47,044 INFO L93 Difference]: Finished difference Result 35858 states and 48067 transitions. [2025-03-03 15:06:47,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:06:47,046 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:06:47,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:47,080 INFO L225 Difference]: With dead ends: 35858 [2025-03-03 15:06:47,080 INFO L226 Difference]: Without dead ends: 29328 [2025-03-03 15:06:47,092 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:06:47,095 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 991 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:47,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 1289 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:06:47,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29328 states. [2025-03-03 15:06:47,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29328 to 25546. [2025-03-03 15:06:47,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25546 states, 25545 states have (on average 1.3306322176551184) internal successors, (33991), 25545 states have internal predecessors, (33991), 0 states have call successors, (0), 0 states have call 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:47,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25546 states to 25546 states and 33991 transitions. [2025-03-03 15:06:47,421 INFO L78 Accepts]: Start accepts. Automaton has 25546 states and 33991 transitions. Word has length 77 [2025-03-03 15:06:47,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:47,421 INFO L471 AbstractCegarLoop]: Abstraction has 25546 states and 33991 transitions. [2025-03-03 15:06:47,421 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:06:47,422 INFO L276 IsEmpty]: Start isEmpty. Operand 25546 states and 33991 transitions. [2025-03-03 15:06:47,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 15:06:47,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:47,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:47,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:06:47,423 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:06:47,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:47,424 INFO L85 PathProgramCache]: Analyzing trace with hash -624963934, now seen corresponding path program 1 times [2025-03-03 15:06:47,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:47,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202752768] [2025-03-03 15:06:47,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:47,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:47,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:06:47,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:06:47,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:47,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:47,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:47,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:47,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202752768] [2025-03-03 15:06:47,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202752768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:47,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:47,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:06:47,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348445970] [2025-03-03 15:06:47,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:47,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:06:47,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:47,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:06:47,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:06:47,502 INFO L87 Difference]: Start difference. First operand 25546 states and 33991 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:47,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:47,624 INFO L93 Difference]: Finished difference Result 39398 states and 52559 transitions. [2025-03-03 15:06:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:06:47,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-03 15:06:47,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:47,663 INFO L225 Difference]: With dead ends: 39398 [2025-03-03 15:06:47,663 INFO L226 Difference]: Without dead ends: 32828 [2025-03-03 15:06:47,679 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:06:47,680 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 970 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:47,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 1297 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:47,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32828 states. [2025-03-03 15:06:48,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32828 to 30750. [2025-03-03 15:06:48,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30750 states, 30749 states have (on average 1.32644964063872) internal successors, (40787), 30749 states have internal predecessors, (40787), 0 states have call successors, (0), 0 states have call 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:48,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30750 states to 30750 states and 40787 transitions. [2025-03-03 15:06:48,082 INFO L78 Accepts]: Start accepts. Automaton has 30750 states and 40787 transitions. Word has length 78 [2025-03-03 15:06:48,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:48,083 INFO L471 AbstractCegarLoop]: Abstraction has 30750 states and 40787 transitions. [2025-03-03 15:06:48,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:48,083 INFO L276 IsEmpty]: Start isEmpty. Operand 30750 states and 40787 transitions. [2025-03-03 15:06:48,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 15:06:48,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:48,084 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:48,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:06:48,084 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:06:48,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:48,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1700158054, now seen corresponding path program 1 times [2025-03-03 15:06:48,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:48,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808322789] [2025-03-03 15:06:48,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:48,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:48,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:06:48,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:06:48,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:48,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:48,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:48,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:48,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808322789] [2025-03-03 15:06:48,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808322789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:48,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:48,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:06:48,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991875407] [2025-03-03 15:06:48,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:48,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:06:48,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:48,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:06:48,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:06:48,168 INFO L87 Difference]: Start difference. First operand 30750 states and 40787 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:48,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:48,296 INFO L93 Difference]: Finished difference Result 44538 states and 59371 transitions. [2025-03-03 15:06:48,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:06:48,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-03 15:06:48,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:48,350 INFO L225 Difference]: With dead ends: 44538 [2025-03-03 15:06:48,350 INFO L226 Difference]: Without dead ends: 38008 [2025-03-03 15:06:48,364 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:06:48,364 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 963 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 963 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:48,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [963 Valid, 1290 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:48,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38008 states. [2025-03-03 15:06:48,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38008 to 35930. [2025-03-03 15:06:48,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35930 states, 35929 states have (on average 1.3244732667204766) internal successors, (47587), 35929 states have internal predecessors, (47587), 0 states have call successors, (0), 0 states have call 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:48,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35930 states to 35930 states and 47587 transitions. [2025-03-03 15:06:48,842 INFO L78 Accepts]: Start accepts. Automaton has 35930 states and 47587 transitions. Word has length 78 [2025-03-03 15:06:48,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:48,842 INFO L471 AbstractCegarLoop]: Abstraction has 35930 states and 47587 transitions. [2025-03-03 15:06:48,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:48,842 INFO L276 IsEmpty]: Start isEmpty. Operand 35930 states and 47587 transitions. [2025-03-03 15:06:48,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 15:06:48,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:48,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:48,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:06:48,845 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:06:48,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:48,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1470074072, now seen corresponding path program 1 times [2025-03-03 15:06:48,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:48,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879606272] [2025-03-03 15:06:48,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:48,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:48,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 15:06:48,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 15:06:48,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:48,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:48,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:48,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:48,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879606272] [2025-03-03 15:06:48,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879606272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:48,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:48,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:06:48,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043708939] [2025-03-03 15:06:48,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:48,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:06:48,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:48,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:06:48,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:06:48,956 INFO L87 Difference]: Start difference. First operand 35930 states and 47587 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call 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:49,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:49,103 INFO L93 Difference]: Finished difference Result 49440 states and 65618 transitions. [2025-03-03 15:06:49,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:06:49,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-03 15:06:49,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:49,149 INFO L225 Difference]: With dead ends: 49440 [2025-03-03 15:06:49,149 INFO L226 Difference]: Without dead ends: 37730 [2025-03-03 15:06:49,166 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:06:49,166 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 981 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:49,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 1286 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:49,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37730 states. [2025-03-03 15:06:49,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37730 to 35654. [2025-03-03 15:06:49,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35654 states, 35653 states have (on average 1.3218242504137099) internal successors, (47127), 35653 states have internal predecessors, (47127), 0 states have call successors, (0), 0 states have call 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:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35654 states to 35654 states and 47127 transitions. [2025-03-03 15:06:49,595 INFO L78 Accepts]: Start accepts. Automaton has 35654 states and 47127 transitions. Word has length 85 [2025-03-03 15:06:49,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:49,595 INFO L471 AbstractCegarLoop]: Abstraction has 35654 states and 47127 transitions. [2025-03-03 15:06:49,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call 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:49,596 INFO L276 IsEmpty]: Start isEmpty. Operand 35654 states and 47127 transitions. [2025-03-03 15:06:49,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 15:06:49,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:49,598 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:49,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:06:49,599 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:06:49,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:49,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1190982578, now seen corresponding path program 1 times [2025-03-03 15:06:49,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:49,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587658579] [2025-03-03 15:06:49,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:49,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:49,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 15:06:49,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 15:06:49,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:49,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:49,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:49,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:49,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587658579] [2025-03-03 15:06:49,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587658579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:49,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:49,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:06:49,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390317493] [2025-03-03 15:06:49,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:49,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:06:49,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:49,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:06:49,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:06:49,695 INFO L87 Difference]: Start difference. First operand 35654 states and 47127 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:50,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:50,252 INFO L93 Difference]: Finished difference Result 43557 states and 57528 transitions. [2025-03-03 15:06:50,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:06:50,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-03 15:06:50,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:50,307 INFO L225 Difference]: With dead ends: 43557 [2025-03-03 15:06:50,307 INFO L226 Difference]: Without dead ends: 42983 [2025-03-03 15:06:50,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:06:50,322 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 1957 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1957 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:50,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1957 Valid, 629 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:06:50,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42983 states. [2025-03-03 15:06:50,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42983 to 35652. [2025-03-03 15:06:50,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35652 states, 35651 states have (on average 1.3217862051555356) internal successors, (47123), 35651 states have internal predecessors, (47123), 0 states have call successors, (0), 0 states have call 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:50,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35652 states to 35652 states and 47123 transitions. [2025-03-03 15:06:50,865 INFO L78 Accepts]: Start accepts. Automaton has 35652 states and 47123 transitions. Word has length 86 [2025-03-03 15:06:50,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:50,865 INFO L471 AbstractCegarLoop]: Abstraction has 35652 states and 47123 transitions. [2025-03-03 15:06:50,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:50,865 INFO L276 IsEmpty]: Start isEmpty. Operand 35652 states and 47123 transitions. [2025-03-03 15:06:50,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 15:06:50,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:50,873 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] [2025-03-03 15:06:50,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:06:50,873 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:06:50,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:50,873 INFO L85 PathProgramCache]: Analyzing trace with hash 798598445, now seen corresponding path program 1 times [2025-03-03 15:06:50,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:50,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313456625] [2025-03-03 15:06:50,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:50,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:50,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 15:06:50,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 15:06:50,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:50,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:51,142 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:51,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:51,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313456625] [2025-03-03 15:06:51,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313456625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:51,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:51,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:06:51,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466426150] [2025-03-03 15:06:51,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:51,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:06:51,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:51,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:06:51,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:06:51,144 INFO L87 Difference]: Start difference. First operand 35652 states and 47123 transitions. Second operand has 12 states, 12 states have (on average 7.75) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call 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:51,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:51,995 INFO L93 Difference]: Finished difference Result 79775 states and 104675 transitions. [2025-03-03 15:06:51,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:06:51,995 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.75) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-03-03 15:06:51,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:52,080 INFO L225 Difference]: With dead ends: 79775 [2025-03-03 15:06:52,080 INFO L226 Difference]: Without dead ends: 63645 [2025-03-03 15:06:52,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2025-03-03 15:06:52,109 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 1865 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1865 SdHoareTripleChecker+Valid, 1735 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:52,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1865 Valid, 1735 Invalid, 1503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:06:52,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63645 states. [2025-03-03 15:06:52,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63645 to 54713. [2025-03-03 15:06:52,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54713 states, 54712 states have (on average 1.315470097967539) internal successors, (71972), 54712 states have internal predecessors, (71972), 0 states have call successors, (0), 0 states have call 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:52,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54713 states to 54713 states and 71972 transitions. [2025-03-03 15:06:52,877 INFO L78 Accepts]: Start accepts. Automaton has 54713 states and 71972 transitions. Word has length 93 [2025-03-03 15:06:52,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:52,877 INFO L471 AbstractCegarLoop]: Abstraction has 54713 states and 71972 transitions. [2025-03-03 15:06:52,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.75) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call 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:52,877 INFO L276 IsEmpty]: Start isEmpty. Operand 54713 states and 71972 transitions. [2025-03-03 15:06:52,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 15:06:52,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:52,885 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:52,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:06:52,885 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:06:52,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:52,885 INFO L85 PathProgramCache]: Analyzing trace with hash -2001512438, now seen corresponding path program 1 times [2025-03-03 15:06:52,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:52,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806813773] [2025-03-03 15:06:52,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:52,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:52,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:06:52,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:06:52,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:52,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:53,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:53,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806813773] [2025-03-03 15:06:53,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806813773] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:06:53,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216699362] [2025-03-03 15:06:53,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:53,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:53,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:06:53,160 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:06:53,162 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:06:53,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:06:53,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:06:53,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:53,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:53,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 15:06:53,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:06:53,657 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:53,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:06:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:54,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216699362] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:06:54,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:06:54,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 9] total 16 [2025-03-03 15:06:54,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117931817] [2025-03-03 15:06:54,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:06:54,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 15:06:54,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:54,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 15:06:54,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2025-03-03 15:06:54,176 INFO L87 Difference]: Start difference. First operand 54713 states and 71972 transitions. Second operand has 16 states, 16 states have (on average 15.0625) internal successors, (241), 16 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call 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:56,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:56,281 INFO L93 Difference]: Finished difference Result 444485 states and 587850 transitions. [2025-03-03 15:06:56,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-03 15:06:56,282 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 15.0625) internal successors, (241), 16 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 15:06:56,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:57,351 INFO L225 Difference]: With dead ends: 444485 [2025-03-03 15:06:57,351 INFO L226 Difference]: Without dead ends: 390285 [2025-03-03 15:06:57,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=1484, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 15:06:57,401 INFO L435 NwaCegarLoop]: 792 mSDtfsCounter, 5430 mSDsluCounter, 2372 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5430 SdHoareTripleChecker+Valid, 3164 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:57,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5430 Valid, 3164 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:06:57,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390285 states. [2025-03-03 15:07:01,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390285 to 362507. [2025-03-03 15:07:01,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362507 states, 362506 states have (on average 1.3115755325429097) internal successors, (475454), 362506 states have internal predecessors, (475454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:02,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362507 states to 362507 states and 475454 transitions. [2025-03-03 15:07:02,430 INFO L78 Accepts]: Start accepts. Automaton has 362507 states and 475454 transitions. Word has length 94 [2025-03-03 15:07:02,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:02,430 INFO L471 AbstractCegarLoop]: Abstraction has 362507 states and 475454 transitions. [2025-03-03 15:07:02,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 15.0625) internal successors, (241), 16 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:02,430 INFO L276 IsEmpty]: Start isEmpty. Operand 362507 states and 475454 transitions. [2025-03-03 15:07:02,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:07:02,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:02,442 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:02,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 15:07:02,643 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:07:02,643 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:07:02,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:02,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1151278483, now seen corresponding path program 1 times [2025-03-03 15:07:02,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:02,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736791423] [2025-03-03 15:07:02,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:02,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:02,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:07:02,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:07:02,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:02,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:02,724 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:02,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:02,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736791423] [2025-03-03 15:07:02,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736791423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:02,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:02,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:02,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178878262] [2025-03-03 15:07:02,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:02,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:02,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:02,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:02,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:02,727 INFO L87 Difference]: Start difference. First operand 362507 states and 475454 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:04,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:04,866 INFO L93 Difference]: Finished difference Result 448983 states and 587726 transitions. [2025-03-03 15:07:04,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:04,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-03 15:07:04,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:05,254 INFO L225 Difference]: With dead ends: 448983 [2025-03-03 15:07:05,254 INFO L226 Difference]: Without dead ends: 273573 [2025-03-03 15:07:05,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:05,571 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 178 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:05,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 825 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:05,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273573 states. [2025-03-03 15:07:08,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273573 to 254659. [2025-03-03 15:07:08,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254659 states, 254658 states have (on average 1.2985337197339177) internal successors, (330682), 254658 states have internal predecessors, (330682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:08,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254659 states to 254659 states and 330682 transitions. [2025-03-03 15:07:08,926 INFO L78 Accepts]: Start accepts. Automaton has 254659 states and 330682 transitions. Word has length 97 [2025-03-03 15:07:08,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:08,926 INFO L471 AbstractCegarLoop]: Abstraction has 254659 states and 330682 transitions. [2025-03-03 15:07:08,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:08,927 INFO L276 IsEmpty]: Start isEmpty. Operand 254659 states and 330682 transitions. [2025-03-03 15:07:08,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:07:08,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:08,936 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, 1, 1, 1] [2025-03-03 15:07:08,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 15:07:08,936 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:07:08,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:08,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1102715376, now seen corresponding path program 1 times [2025-03-03 15:07:08,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:08,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537233286] [2025-03-03 15:07:08,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:08,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:08,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:07:08,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:07:08,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:08,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:09,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:09,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537233286] [2025-03-03 15:07:09,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537233286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:09,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:09,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:07:09,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011866061] [2025-03-03 15:07:09,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:09,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:07:09,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:09,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:07:09,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:07:09,042 INFO L87 Difference]: Start difference. First operand 254659 states and 330682 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:10,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:10,916 INFO L93 Difference]: Finished difference Result 506621 states and 657776 transitions. [2025-03-03 15:07:10,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:07:10,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:07:10,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:11,802 INFO L225 Difference]: With dead ends: 506621 [2025-03-03 15:07:11,802 INFO L226 Difference]: Without dead ends: 252475 [2025-03-03 15:07:11,886 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:07:11,886 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 873 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:11,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 673 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:07:12,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252475 states. [2025-03-03 15:07:13,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252475 to 230847. [2025-03-03 15:07:14,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230847 states, 230846 states have (on average 1.2780425045268273) internal successors, (295031), 230846 states have internal predecessors, (295031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:14,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230847 states to 230847 states and 295031 transitions. [2025-03-03 15:07:14,929 INFO L78 Accepts]: Start accepts. Automaton has 230847 states and 295031 transitions. Word has length 98 [2025-03-03 15:07:14,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:14,929 INFO L471 AbstractCegarLoop]: Abstraction has 230847 states and 295031 transitions. [2025-03-03 15:07:14,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:14,929 INFO L276 IsEmpty]: Start isEmpty. Operand 230847 states and 295031 transitions. [2025-03-03 15:07:14,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:07:14,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:14,937 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, 1, 1, 1] [2025-03-03 15:07:14,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 15:07:14,938 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:07:14,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:14,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1309137069, now seen corresponding path program 1 times [2025-03-03 15:07:14,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:14,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736846670] [2025-03-03 15:07:14,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:14,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:14,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:07:14,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:07:14,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:14,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:15,013 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 15:07:15,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:15,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736846670] [2025-03-03 15:07:15,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736846670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:15,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:15,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:15,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695683286] [2025-03-03 15:07:15,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:15,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:15,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:15,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:15,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:15,014 INFO L87 Difference]: Start difference. First operand 230847 states and 295031 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:16,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:16,337 INFO L93 Difference]: Finished difference Result 295544 states and 377029 transitions. [2025-03-03 15:07:16,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:16,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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 98 [2025-03-03 15:07:16,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:16,516 INFO L225 Difference]: With dead ends: 295544 [2025-03-03 15:07:16,516 INFO L226 Difference]: Without dead ends: 153944 [2025-03-03 15:07:16,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:16,546 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 159 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:16,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 800 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:16,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153944 states. [2025-03-03 15:07:17,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153944 to 153396. [2025-03-03 15:07:17,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153396 states, 153395 states have (on average 1.2623357997327163) internal successors, (193636), 153395 states have internal predecessors, (193636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:18,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153396 states to 153396 states and 193636 transitions. [2025-03-03 15:07:18,397 INFO L78 Accepts]: Start accepts. Automaton has 153396 states and 193636 transitions. Word has length 98 [2025-03-03 15:07:18,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:18,397 INFO L471 AbstractCegarLoop]: Abstraction has 153396 states and 193636 transitions. [2025-03-03 15:07:18,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:18,398 INFO L276 IsEmpty]: Start isEmpty. Operand 153396 states and 193636 transitions. [2025-03-03 15:07:18,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:07:18,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:18,402 INFO L218 NwaCegarLoop]: trace histogram [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:07:18,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:07:18,402 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:07:18,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:18,402 INFO L85 PathProgramCache]: Analyzing trace with hash 44902271, now seen corresponding path program 1 times [2025-03-03 15:07:18,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:18,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708492731] [2025-03-03 15:07:18,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:18,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:18,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:07:18,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:07:18,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:18,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:18,462 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:18,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:18,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708492731] [2025-03-03 15:07:18,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708492731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:18,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:18,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:07:18,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833489194] [2025-03-03 15:07:18,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:18,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:07:18,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:18,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:07:18,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:07:18,464 INFO L87 Difference]: Start difference. First operand 153396 states and 193636 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:19,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:19,279 INFO L93 Difference]: Finished difference Result 342761 states and 432109 transitions. [2025-03-03 15:07:19,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:07:19,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:07:19,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:19,507 INFO L225 Difference]: With dead ends: 342761 [2025-03-03 15:07:19,507 INFO L226 Difference]: Without dead ends: 189859 [2025-03-03 15:07:19,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:07:19,607 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 830 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:19,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 772 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:07:19,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189859 states. [2025-03-03 15:07:21,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189859 to 159855. [2025-03-03 15:07:21,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159855 states, 159854 states have (on average 1.2356650443529722) internal successors, (197526), 159854 states have internal predecessors, (197526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:21,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159855 states to 159855 states and 197526 transitions. [2025-03-03 15:07:21,831 INFO L78 Accepts]: Start accepts. Automaton has 159855 states and 197526 transitions. Word has length 98 [2025-03-03 15:07:21,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:21,831 INFO L471 AbstractCegarLoop]: Abstraction has 159855 states and 197526 transitions. [2025-03-03 15:07:21,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:21,831 INFO L276 IsEmpty]: Start isEmpty. Operand 159855 states and 197526 transitions. [2025-03-03 15:07:21,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:07:21,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:21,836 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, 1, 1, 1, 1, 1] [2025-03-03 15:07:21,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 15:07:21,836 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:07:21,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:21,837 INFO L85 PathProgramCache]: Analyzing trace with hash -389878731, now seen corresponding path program 1 times [2025-03-03 15:07:21,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:21,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404991348] [2025-03-03 15:07:21,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:21,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:21,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:07:21,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:07:21,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:21,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:21,882 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 15:07:21,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:21,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404991348] [2025-03-03 15:07:21,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404991348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:21,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:21,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:21,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69910266] [2025-03-03 15:07:21,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:21,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:21,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:21,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:21,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:21,884 INFO L87 Difference]: Start difference. First operand 159855 states and 197526 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:22,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:22,645 INFO L93 Difference]: Finished difference Result 228157 states and 281503 transitions. [2025-03-03 15:07:22,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:22,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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 100 [2025-03-03 15:07:22,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:22,792 INFO L225 Difference]: With dead ends: 228157 [2025-03-03 15:07:22,793 INFO L226 Difference]: Without dead ends: 124326 [2025-03-03 15:07:22,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:22,857 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 160 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 818 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:07:22,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 818 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:22,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124326 states. [2025-03-03 15:07:23,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124326 to 124013. [2025-03-03 15:07:24,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124013 states, 124012 states have (on average 1.2228735928781085) internal successors, (151651), 124012 states have internal predecessors, (151651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:24,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124013 states to 124013 states and 151651 transitions. [2025-03-03 15:07:24,245 INFO L78 Accepts]: Start accepts. Automaton has 124013 states and 151651 transitions. Word has length 100 [2025-03-03 15:07:24,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:24,245 INFO L471 AbstractCegarLoop]: Abstraction has 124013 states and 151651 transitions. [2025-03-03 15:07:24,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:24,245 INFO L276 IsEmpty]: Start isEmpty. Operand 124013 states and 151651 transitions. [2025-03-03 15:07:24,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 15:07:24,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:24,250 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:24,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 15:07:24,250 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:07:24,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:24,250 INFO L85 PathProgramCache]: Analyzing trace with hash -76770485, now seen corresponding path program 1 times [2025-03-03 15:07:24,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:24,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519044845] [2025-03-03 15:07:24,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:24,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:24,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 15:07:24,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 15:07:24,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:24,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:24,312 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:24,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:24,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519044845] [2025-03-03 15:07:24,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519044845] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:07:24,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646271895] [2025-03-03 15:07:24,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:24,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:07:24,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:07:24,315 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:07:24,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process