./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.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 c9fed3b6ecd1551705440e8c2971862b3f83812db515b8181a20d7126e9055f8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:16:21,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:16:21,240 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:16:21,246 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:16:21,246 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:16:21,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:16:21,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:16:21,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:16:21,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:16:21,266 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:16:21,266 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:16:21,266 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:16:21,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:16:21,267 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:16:21,267 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:16:21,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:16:21,267 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:16:21,267 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:16:21,267 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:16:21,267 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:16:21,267 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:16:21,267 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:16:21,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:16:21,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:16:21,268 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:16:21,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:16:21,268 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:16:21,268 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:16:21,268 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:16:21,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:16:21,268 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:16:21,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:16:21,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:16:21,268 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:16:21,268 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:16:21,268 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:16:21,268 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:16:21,268 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:16:21,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:16:21,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:16:21,269 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:16:21,269 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:16:21,269 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:16:21,269 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 -> c9fed3b6ecd1551705440e8c2971862b3f83812db515b8181a20d7126e9055f8 [2025-03-08 06:16:21,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:16:21,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:16:21,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:16:21,502 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:16:21,502 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:16:21,504 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-08 06:16:22,614 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53bba59a9/8332e80849734780add7d4211951a43c/FLAG93e5e181c [2025-03-08 06:16:23,063 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:16:23,064 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-08 06:16:23,091 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53bba59a9/8332e80849734780add7d4211951a43c/FLAG93e5e181c [2025-03-08 06:16:23,110 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53bba59a9/8332e80849734780add7d4211951a43c [2025-03-08 06:16:23,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:16:23,113 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:16:23,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:16:23,116 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:16:23,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:16:23,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:16:23" (1/1) ... [2025-03-08 06:16:23,122 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15a92c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:16:23, skipping insertion in model container [2025-03-08 06:16:23,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:16:23" (1/1) ... [2025-03-08 06:16:23,187 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:16:23,410 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[7186,7199] [2025-03-08 06:16:23,426 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[11327,11340] [2025-03-08 06:16:23,469 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[18377,18390] [2025-03-08 06:16:23,502 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[24849,24862] [2025-03-08 06:16:23,571 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[43924,43937] [2025-03-08 06:16:23,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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[71846,71859] [2025-03-08 06:16:23,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:16:23,746 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:16:23,768 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[7186,7199] [2025-03-08 06:16:23,777 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[11327,11340] [2025-03-08 06:16:23,794 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[18377,18390] [2025-03-08 06:16:23,805 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[24849,24862] [2025-03-08 06:16:23,831 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[43924,43937] [2025-03-08 06:16:23,866 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[71846,71859] [2025-03-08 06:16:23,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:16:23,986 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:16:23,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:16:23 WrapperNode [2025-03-08 06:16:23,988 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:16:23,989 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:16:23,989 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:16:23,989 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:16:23,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:16:23" (1/1) ... [2025-03-08 06:16:24,026 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:16:23" (1/1) ... [2025-03-08 06:16:24,110 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 6061 [2025-03-08 06:16:24,111 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:16:24,112 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:16:24,112 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:16:24,112 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:16:24,118 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:16:23" (1/1) ... [2025-03-08 06:16:24,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:16:23" (1/1) ... [2025-03-08 06:16:24,135 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:16:23" (1/1) ... [2025-03-08 06:16:24,177 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 06:16:24,177 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:16:23" (1/1) ... [2025-03-08 06:16:24,177 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:16:23" (1/1) ... [2025-03-08 06:16:24,215 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:16:23" (1/1) ... [2025-03-08 06:16:24,222 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:16:23" (1/1) ... [2025-03-08 06:16:24,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:16:23" (1/1) ... [2025-03-08 06:16:24,243 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:16:23" (1/1) ... [2025-03-08 06:16:24,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:16:24,263 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:16:24,263 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:16:24,263 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:16:24,264 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:16:23" (1/1) ... [2025-03-08 06:16:24,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:16:24,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:16:24,289 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:16:24,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:16:24,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:16:24,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:16:24,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:16:24,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:16:24,485 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:16:24,487 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:16:27,064 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4862: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-08 06:16:27,065 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6053: havoc main_~node1____CPAchecker_TMP_1~8#1; [2025-03-08 06:16:27,065 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3675: havoc main_~node1__m1~22#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_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~24#1; [2025-03-08 06:16:27,065 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4733: havoc main_~check__tmp~32#1; [2025-03-08 06:16:27,065 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L241: havoc main_~node3__m3~0#1; [2025-03-08 06:16:27,065 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9227: havoc main_~node3__m3~39#1;havoc main_~node2____CPAchecker_TMP_1~10#1; [2025-03-08 06:16:27,065 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6849: havoc main_~node1__m1~41#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_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~45#1; [2025-03-08 06:16:27,065 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7644: havoc main_~node1____CPAchecker_TMP_1~12#1; [2025-03-08 06:16:27,065 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9098: havoc main_~node2____CPAchecker_TMP_1~9#1; [2025-03-08 06:16:27,065 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8704: havoc main_~node2____CPAchecker_TMP_1~8#1; [2025-03-08 06:16:27,065 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8837: havoc main_~node1__m1~54#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-08 06:16:27,066 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4611: havoc main_~node1__m1~28#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_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~30#1; [2025-03-08 06:16:27,066 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L251: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-08 06:16:27,066 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9237: havoc main_~node3____CPAchecker_TMP_0~11#1; [2025-03-08 06:16:27,066 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6859: havoc main_~node1____CPAchecker_TMP_0~11#1; [2025-03-08 06:16:27,066 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7784: havoc main_~node1____CPAchecker_TMP_1~13#1; [2025-03-08 06:16:27,066 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6596: havoc main_~node1__m1~39#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_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~43#1; [2025-03-08 06:16:27,066 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5407: havoc main_~node1__m1~32#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_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~35#1; [2025-03-08 06:16:27,066 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3955: havoc main_~node3__m3~15#1;havoc main_~node2__m2~20#1;havoc main_~node1__m1~23#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-08 06:16:27,066 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6466: havoc main_~node3__m3~28#1; [2025-03-08 06:16:27,066 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L389: havoc main_~node1__m1~2#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_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-08 06:16:27,066 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2239: havoc main_~node3__m3~10#1;havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-08 06:16:27,066 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2770: havoc main_~node3__m3~11#1; [2025-03-08 06:16:27,066 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2111: havoc main_~node1____CPAchecker_TMP_1~2#1; [2025-03-08 06:16:27,066 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10040: havoc main_~node2__m2~50#1;havoc main_~node1____CPAchecker_TMP_1~18#1;havoc main_~node1__m1~64#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~49#1;havoc main_~node1__m1~63#1;havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~68#1; [2025-03-08 06:16:27,066 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7398: havoc main_~node1__m1~45#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_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~49#1; [2025-03-08 06:16:27,066 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L924: havoc main_~node3__m3~3#1;havoc main_~node2__m2~3#1;havoc main_~node1__m1~4#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-08 06:16:27,066 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6606: havoc main_~node1____CPAchecker_TMP_0~10#1; [2025-03-08 06:16:27,066 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5417: havoc main_~node1____CPAchecker_TMP_0~8#1; [2025-03-08 06:16:27,067 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8456: havoc main_~node1__m1~51#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~56#1; [2025-03-08 06:16:27,067 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6476: havoc main_~node3____CPAchecker_TMP_0~8#1; [2025-03-08 06:16:27,067 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7534: havoc main_~node2__m2~38#1; [2025-03-08 06:16:27,067 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2249: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-08 06:16:27,067 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8064: havoc main_~node1____CPAchecker_TMP_1~14#1;havoc main_~node1__m1~48#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~41#1;havoc main_~node1__m1~47#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~52#1; [2025-03-08 06:16:27,067 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1326: 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_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-08 06:16:27,067 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2780: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-08 06:16:27,067 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3311: havoc main_~node2__m2~17#1; [2025-03-08 06:16:27,067 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4368: havoc main_~node1____CPAchecker_TMP_0~5#1; [2025-03-08 06:16:27,067 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4897: havoc main_~node1____CPAchecker_TMP_1~5#1; [2025-03-08 06:16:27,067 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7408: havoc main_~node1____CPAchecker_TMP_0~13#1; [2025-03-08 06:16:27,067 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1198: havoc main_~node3__m3~5#1; [2025-03-08 06:16:27,067 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4105: havoc main_~node3__m3~16#1;havoc main_~node2__m2~21#1;havoc main_~node1__m1~24#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~27#1; [2025-03-08 06:16:27,067 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8336: havoc main_~node3__m3~35#1;havoc main_~node2__m2~42#1;havoc main_~node1__m1~50#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~55#1; [2025-03-08 06:16:27,067 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1862: 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_~__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-08 06:16:27,067 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4771: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-03-08 06:16:27,067 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7810: havoc main_~node2__m2~40#1; [2025-03-08 06:16:27,067 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1601: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-08 06:16:27,067 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7151: havoc main_~node1__m1~43#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_~__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-08 06:16:27,067 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5170: havoc main_~node1____CPAchecker_TMP_0~7#1; [2025-03-08 06:16:27,067 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6888: havoc main_~node1____CPAchecker_TMP_1~10#1; [2025-03-08 06:16:27,067 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3321: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-08 06:16:27,067 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7418: havoc main_~node2__m2~37#1; [2025-03-08 06:16:27,068 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1208: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-08 06:16:27,068 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4644: havoc main_~node2__m2~24#1;havoc main_~node1____CPAchecker_TMP_0~6#1; [2025-03-08 06:16:27,068 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5967: havoc main_~node1__m1~35#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_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~39#1; [2025-03-08 06:16:27,068 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3458: 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_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~22#1; [2025-03-08 06:16:27,068 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9272: havoc main_~node1__m1~57#1;havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~62#1; [2025-03-08 06:16:27,068 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7687: havoc main_~node2____CPAchecker_TMP_1~7#1;havoc main_~node2__m2~39#1; [2025-03-08 06:16:27,068 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8216: havoc main_~node1__m1~49#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-08 06:16:27,069 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7820: havoc main_~node2____CPAchecker_TMP_0~6#1; [2025-03-08 06:16:27,069 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9803: havoc main_~node3__m3~42#1; [2025-03-08 06:16:27,069 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7161: havoc main_~node1____CPAchecker_TMP_0~12#1; [2025-03-08 06:16:27,069 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3330: havoc main_~node3__m3~12#1; [2025-03-08 06:16:27,069 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6634: havoc main_~node1____CPAchecker_TMP_1~9#1; [2025-03-08 06:16:27,069 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5446: havoc main_~node1____CPAchecker_TMP_1~7#1; [2025-03-08 06:16:27,069 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10468: havoc main_~node2____CPAchecker_TMP_1~12#1;havoc main_~node2__m2~52#1;havoc main_~node1____CPAchecker_TMP_1~19#1;havoc main_~node1__m1~67#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~51#1;havoc main_~node1__m1~66#1;havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~71#1; [2025-03-08 06:16:27,069 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3733: havoc main_~node1____CPAchecker_TMP_0~4#1; [2025-03-08 06:16:27,069 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7829: havoc main_~node3__m3~33#1; [2025-03-08 06:16:27,069 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8623: havoc main_~node1__m1~53#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~43#1;havoc main_~node1__m1~52#1;havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~57#1; [2025-03-08 06:16:27,069 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9813: havoc main_~node3____CPAchecker_TMP_0~12#1; [2025-03-08 06:16:27,070 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4396: havoc main_~node1____CPAchecker_TMP_1~4#1; [2025-03-08 06:16:27,070 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3340: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-08 06:16:27,070 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6247: havoc main_~node3__m3~26#1;havoc main_~node2__m2~30#1;havoc main_~node1__m1~36#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-08 06:16:27,070 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9023: havoc main_~node2__m2~46#1;havoc main_~node1____CPAchecker_TMP_1~16#1;havoc main_~node1__m1~56#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~45#1;havoc main_~node1__m1~55#1;havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~60#1; [2025-03-08 06:16:27,070 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4799: havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-03-08 06:16:27,070 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7839: havoc main_~node3____CPAchecker_TMP_0~9#1; [2025-03-08 06:16:27,070 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1629: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-03-08 06:16:27,070 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5198: havoc main_~node1____CPAchecker_TMP_1~6#1; [2025-03-08 06:16:27,070 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1102: havoc main_~node3__m3~4#1;havoc main_~node2__m2~4#1;havoc main_~node1__m1~5#1;havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-08 06:16:27,070 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10087: havoc main_~node2____CPAchecker_TMP_0~9#1; [2025-03-08 06:16:27,070 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7581: havoc main_~node2____CPAchecker_TMP_0~5#1; [2025-03-08 06:16:27,070 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L447: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-08 06:16:27,070 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8639: havoc main_~node1____CPAchecker_TMP_1~15#1; [2025-03-08 06:16:27,071 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7189: havoc main_~node1____CPAchecker_TMP_1~11#1; [2025-03-08 06:16:27,071 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6397: havoc main_~node3__m3~27#1;havoc main_~node2__m2~31#1;havoc main_~node1__m1~37#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~42#1; [2025-03-08 06:16:27,071 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5473: havoc main_~node2__m2~27#1; [2025-03-08 06:16:27,071 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6931: havoc main_~node2____CPAchecker_TMP_1~4#1;havoc main_~node2__m2~34#1; [2025-03-08 06:16:27,071 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3761: havoc main_~node1____CPAchecker_TMP_1~3#1; [2025-03-08 06:16:27,071 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4686: havoc main_~node3__m3~20#1; [2025-03-08 06:16:27,071 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2708: havoc main_~node2__m2~12#1;havoc main_~node1__m1~15#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~17#1; [2025-03-08 06:16:27,071 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5483: havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-03-08 06:16:27,071 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7465: havoc main_~node2____CPAchecker_TMP_0~4#1; [2025-03-08 06:16:27,071 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2313: havoc main_~node2__m2~9#1;havoc main_~node1__m1~12#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~14#1; [2025-03-08 06:16:27,071 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L728: 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_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-08 06:16:27,071 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3239: havoc main_~node2__m2~16#1;havoc main_~node1__m1~19#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~21#1; [2025-03-08 06:16:27,071 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5750: 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_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~37#1; [2025-03-08 06:16:27,071 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2447: havoc main_~node2__m2~10#1;havoc main_~node1__m1~13#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~15#1; [2025-03-08 06:16:27,072 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2844: havoc main_~node2__m2~13#1;havoc main_~node1__m1~16#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~18#1; [2025-03-08 06:16:27,072 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2580: havoc main_~node2__m2~11#1;havoc main_~node1__m1~14#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-08 06:16:27,072 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L202: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-08 06:16:27,072 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9848: havoc main_~node1__m1~62#1;havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~67#1; [2025-03-08 06:16:27,072 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2978: havoc main_~node2__m2~14#1;havoc main_~node1__m1~17#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~19#1; [2025-03-08 06:16:27,072 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3111: havoc main_~node2__m2~15#1;havoc main_~node1__m1~18#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-08 06:16:27,072 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5622: havoc main_~node3__m3~23#1;havoc main_~node2____CPAchecker_TMP_1~3#1; [2025-03-08 06:16:27,072 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10115: havoc main_~node2____CPAchecker_TMP_1~11#1; [2025-03-08 06:16:27,072 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4834: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-08 06:16:27,072 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8666: havoc main_~node2__m2~44#1; [2025-03-08 06:16:27,072 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7609: havoc main_~node2____CPAchecker_TMP_1~6#1; [2025-03-08 06:16:27,072 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7874: havoc main_~node1__m1~46#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~51#1; [2025-03-08 06:16:27,072 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L475: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-08 06:16:27,072 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6025: havoc main_~node1____CPAchecker_TMP_0~9#1; [2025-03-08 06:16:27,072 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L212: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-08 06:16:27,072 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9462: havoc main_~node1____CPAchecker_TMP_1~17#1;havoc main_~node1__m1~59#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~47#1;havoc main_~node1__m1~58#1;havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~63#1; [2025-03-08 06:16:27,072 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4310: havoc main_~node1__m1~26#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_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~28#1; [2025-03-08 06:16:27,072 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5632: havoc main_~node3____CPAchecker_TMP_0~7#1; [2025-03-08 06:16:27,072 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4180: havoc main_~node3__m3~17#1; [2025-03-08 06:16:27,072 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9070: havoc main_~node2____CPAchecker_TMP_0~8#1; [2025-03-08 06:16:27,072 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8411: havoc main_~node3__m3~36#1; [2025-03-08 06:16:27,072 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8676: havoc main_~node2____CPAchecker_TMP_0~7#1; [2025-03-08 06:16:27,072 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9734: havoc main_~node3__m3~41#1;havoc main_~node2__m2~48#1;havoc main_~node1__m1~61#1;havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~66#1; [2025-03-08 06:16:27,072 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc main_~node1__m1~8#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_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-08 06:16:27,073 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L222: havoc main_~node2__m2~0#1; [2025-03-08 06:16:27,073 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2073: havoc main_~node1__m1~11#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_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~12#1; [2025-03-08 06:16:27,073 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5112: havoc main_~node1__m1~30#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_~__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-08 06:16:27,073 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10266: havoc main_~node1__m1~65#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-08 06:16:27,073 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5511: havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-03-08 06:16:27,073 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7493: havoc main_~node2____CPAchecker_TMP_1~5#1; [2025-03-08 06:16:27,073 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4190: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-03-08 06:16:27,073 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8421: havoc main_~node3____CPAchecker_TMP_0~10#1; [2025-03-08 06:16:27,073 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L232: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-08 06:16:27,074 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9614: havoc main_~node1__m1~60#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-08 06:16:27,074 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2083: havoc main_~node1____CPAchecker_TMP_0~3#1; [2025-03-08 06:16:27,247 INFO L? ?]: Removed 1041 outVars from TransFormulas that were not future-live. [2025-03-08 06:16:27,247 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:16:27,281 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:16:27,282 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:16:27,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:16:27 BoogieIcfgContainer [2025-03-08 06:16:27,283 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:16:27,285 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:16:27,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:16:27,292 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:16:27,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:16:23" (1/3) ... [2025-03-08 06:16:27,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54865653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:16:27, skipping insertion in model container [2025-03-08 06:16:27,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:16:23" (2/3) ... [2025-03-08 06:16:27,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54865653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:16:27, skipping insertion in model container [2025-03-08 06:16:27,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:16:27" (3/3) ... [2025-03-08 06:16:27,294 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-08 06:16:27,306 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:16:27,309 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c that has 1 procedures, 1254 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-08 06:16:27,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:16:27,398 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;@308d2f02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:16:27,398 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-08 06:16:27,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 1254 states, 1247 states have (on average 1.8043303929430634) internal successors, (2250), 1253 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:27,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 06:16:27,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:27,426 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:27,426 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-08 06:16:27,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:27,434 INFO L85 PathProgramCache]: Analyzing trace with hash 247370793, now seen corresponding path program 1 times [2025-03-08 06:16:27,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:27,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194508100] [2025-03-08 06:16:27,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:27,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:27,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 06:16:27,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 06:16:27,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:27,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:27,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:27,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194508100] [2025-03-08 06:16:27,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194508100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:27,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:27,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:16:27,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061099349] [2025-03-08 06:16:27,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:27,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:16:27,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:27,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:16:27,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:16:27,938 INFO L87 Difference]: Start difference. First operand has 1254 states, 1247 states have (on average 1.8043303929430634) internal successors, (2250), 1253 states have internal predecessors, (2250), 0 states have call successors, (0), 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.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:29,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:29,209 INFO L93 Difference]: Finished difference Result 2475 states and 4331 transitions. [2025-03-08 06:16:29,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:16:29,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-08 06:16:29,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:29,226 INFO L225 Difference]: With dead ends: 2475 [2025-03-08 06:16:29,226 INFO L226 Difference]: Without dead ends: 1558 [2025-03-08 06:16:29,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:16:29,238 INFO L435 NwaCegarLoop]: 1013 mSDtfsCounter, 7059 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7059 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:29,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7059 Valid, 1499 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:16:29,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2025-03-08 06:16:29,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1552. [2025-03-08 06:16:29,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1546 states have (on average 1.3544631306597672) internal successors, (2094), 1551 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:29,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2094 transitions. [2025-03-08 06:16:29,334 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2094 transitions. Word has length 51 [2025-03-08 06:16:29,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:29,334 INFO L471 AbstractCegarLoop]: Abstraction has 1552 states and 2094 transitions. [2025-03-08 06:16:29,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:29,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2094 transitions. [2025-03-08 06:16:29,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 06:16:29,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:29,338 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:29,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:16:29,339 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-08 06:16:29,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:29,339 INFO L85 PathProgramCache]: Analyzing trace with hash -956613290, now seen corresponding path program 1 times [2025-03-08 06:16:29,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:29,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105442184] [2025-03-08 06:16:29,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:29,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:29,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 06:16:29,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 06:16:29,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:29,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:29,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:29,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105442184] [2025-03-08 06:16:29,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105442184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:29,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:29,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:16:29,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568585408] [2025-03-08 06:16:29,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:29,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:16:29,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:29,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:16:29,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:16:29,523 INFO L87 Difference]: Start difference. First operand 1552 states and 2094 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:30,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:30,296 INFO L93 Difference]: Finished difference Result 3079 states and 4232 transitions. [2025-03-08 06:16:30,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:16:30,297 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-08 06:16:30,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:30,304 INFO L225 Difference]: With dead ends: 3079 [2025-03-08 06:16:30,304 INFO L226 Difference]: Without dead ends: 1987 [2025-03-08 06:16:30,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:16:30,306 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 4621 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4621 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:30,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4621 Valid, 902 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:16:30,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2025-03-08 06:16:30,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1977. [2025-03-08 06:16:30,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1977 states, 1971 states have (on average 1.3678335870116691) internal successors, (2696), 1976 states have internal predecessors, (2696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:30,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2696 transitions. [2025-03-08 06:16:30,358 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2696 transitions. Word has length 52 [2025-03-08 06:16:30,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:30,358 INFO L471 AbstractCegarLoop]: Abstraction has 1977 states and 2696 transitions. [2025-03-08 06:16:30,358 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-08 06:16:30,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2696 transitions. [2025-03-08 06:16:30,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 06:16:30,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:30,362 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:30,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:16:30,362 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-08 06:16:30,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:30,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1530715901, now seen corresponding path program 1 times [2025-03-08 06:16:30,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:30,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256686030] [2025-03-08 06:16:30,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:30,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:30,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 06:16:30,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 06:16:30,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:30,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:30,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:30,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:30,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256686030] [2025-03-08 06:16:30,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256686030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:30,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:30,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:16:30,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981497633] [2025-03-08 06:16:30,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:30,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:16:30,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:30,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:16:30,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:16:30,507 INFO L87 Difference]: Start difference. First operand 1977 states and 2696 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:31,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:31,208 INFO L93 Difference]: Finished difference Result 4383 states and 6020 transitions. [2025-03-08 06:16:31,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:16:31,208 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-08 06:16:31,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:31,218 INFO L225 Difference]: With dead ends: 4383 [2025-03-08 06:16:31,218 INFO L226 Difference]: Without dead ends: 3053 [2025-03-08 06:16:31,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:16:31,221 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 4567 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4567 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:31,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4567 Valid, 968 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:16:31,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3053 states. [2025-03-08 06:16:31,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3053 to 3041. [2025-03-08 06:16:31,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3041 states, 3035 states have (on average 1.3759472817133442) internal successors, (4176), 3040 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:31,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3041 states to 3041 states and 4176 transitions. [2025-03-08 06:16:31,284 INFO L78 Accepts]: Start accepts. Automaton has 3041 states and 4176 transitions. Word has length 52 [2025-03-08 06:16:31,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:31,285 INFO L471 AbstractCegarLoop]: Abstraction has 3041 states and 4176 transitions. [2025-03-08 06:16:31,285 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-08 06:16:31,285 INFO L276 IsEmpty]: Start isEmpty. Operand 3041 states and 4176 transitions. [2025-03-08 06:16:31,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 06:16:31,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:31,288 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:31,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:16:31,288 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-08 06:16:31,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:31,289 INFO L85 PathProgramCache]: Analyzing trace with hash 569393369, now seen corresponding path program 1 times [2025-03-08 06:16:31,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:31,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333888806] [2025-03-08 06:16:31,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:31,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:31,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 06:16:31,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 06:16:31,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:31,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:31,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-08 06:16:31,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:31,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333888806] [2025-03-08 06:16:31,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333888806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:31,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:31,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:16:31,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036894011] [2025-03-08 06:16:31,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:31,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:16:31,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:31,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:16:31,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:16:31,651 INFO L87 Difference]: Start difference. First operand 3041 states and 4176 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:32,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:32,806 INFO L93 Difference]: Finished difference Result 4353 states and 6079 transitions. [2025-03-08 06:16:32,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:16:32,806 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-08 06:16:32,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:32,817 INFO L225 Difference]: With dead ends: 4353 [2025-03-08 06:16:32,818 INFO L226 Difference]: Without dead ends: 3682 [2025-03-08 06:16:32,820 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-08 06:16:32,820 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 5165 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 2446 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5165 SdHoareTripleChecker+Valid, 2859 SdHoareTripleChecker+Invalid, 2455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:32,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5165 Valid, 2859 Invalid, 2455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2446 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:16:32,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3682 states. [2025-03-08 06:16:32,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3682 to 3041. [2025-03-08 06:16:32,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3041 states, 3035 states have (on average 1.3756177924217463) internal successors, (4175), 3040 states have internal predecessors, (4175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:32,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3041 states to 3041 states and 4175 transitions. [2025-03-08 06:16:32,925 INFO L78 Accepts]: Start accepts. Automaton has 3041 states and 4175 transitions. Word has length 53 [2025-03-08 06:16:32,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:32,926 INFO L471 AbstractCegarLoop]: Abstraction has 3041 states and 4175 transitions. [2025-03-08 06:16:32,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 3041 states and 4175 transitions. [2025-03-08 06:16:32,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 06:16:32,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:32,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:32,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:16:32,930 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-08 06:16:32,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:32,930 INFO L85 PathProgramCache]: Analyzing trace with hash 734562753, now seen corresponding path program 1 times [2025-03-08 06:16:32,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:32,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507995721] [2025-03-08 06:16:32,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:32,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:32,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 06:16:33,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 06:16:33,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:33,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:33,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:33,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:33,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507995721] [2025-03-08 06:16:33,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507995721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:33,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:33,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:16:33,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760858583] [2025-03-08 06:16:33,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:33,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:16:33,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:33,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:16:33,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:16:33,301 INFO L87 Difference]: Start difference. First operand 3041 states and 4175 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:34,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:34,882 INFO L93 Difference]: Finished difference Result 5150 states and 7205 transitions. [2025-03-08 06:16:34,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:16:34,883 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-08 06:16:34,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:34,895 INFO L225 Difference]: With dead ends: 5150 [2025-03-08 06:16:34,895 INFO L226 Difference]: Without dead ends: 4593 [2025-03-08 06:16:34,896 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-08 06:16:34,897 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 5147 mSDsluCounter, 2904 mSDsCounter, 0 mSdLazyCounter, 3843 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5147 SdHoareTripleChecker+Valid, 3552 SdHoareTripleChecker+Invalid, 3896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 3843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:34,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5147 Valid, 3552 Invalid, 3896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 3843 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 06:16:34,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4593 states. [2025-03-08 06:16:34,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4593 to 3041. [2025-03-08 06:16:34,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3041 states, 3035 states have (on average 1.3752883031301482) internal successors, (4174), 3040 states have internal predecessors, (4174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:34,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3041 states to 3041 states and 4174 transitions. [2025-03-08 06:16:34,958 INFO L78 Accepts]: Start accepts. Automaton has 3041 states and 4174 transitions. Word has length 53 [2025-03-08 06:16:34,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:34,959 INFO L471 AbstractCegarLoop]: Abstraction has 3041 states and 4174 transitions. [2025-03-08 06:16:34,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:34,959 INFO L276 IsEmpty]: Start isEmpty. Operand 3041 states and 4174 transitions. [2025-03-08 06:16:34,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 06:16:34,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:34,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:34,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:16:34,964 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-08 06:16:34,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:34,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2071824519, now seen corresponding path program 1 times [2025-03-08 06:16:34,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:34,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094207523] [2025-03-08 06:16:34,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:34,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:34,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 06:16:35,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 06:16:35,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:35,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:35,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:35,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:35,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094207523] [2025-03-08 06:16:35,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094207523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:35,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:35,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:16:35,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554451046] [2025-03-08 06:16:35,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:35,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:16:35,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:35,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:16:35,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:16:35,196 INFO L87 Difference]: Start difference. First operand 3041 states and 4174 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:36,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:36,256 INFO L93 Difference]: Finished difference Result 3789 states and 5171 transitions. [2025-03-08 06:16:36,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:16:36,257 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-08 06:16:36,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:36,267 INFO L225 Difference]: With dead ends: 3789 [2025-03-08 06:16:36,267 INFO L226 Difference]: Without dead ends: 3784 [2025-03-08 06:16:36,268 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-08 06:16:36,268 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 6182 mSDsluCounter, 2054 mSDsCounter, 0 mSdLazyCounter, 2665 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6182 SdHoareTripleChecker+Valid, 2679 SdHoareTripleChecker+Invalid, 2707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:36,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6182 Valid, 2679 Invalid, 2707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2665 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:16:36,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2025-03-08 06:16:36,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 3041. [2025-03-08 06:16:36,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3041 states, 3035 states have (on average 1.3749588138385502) internal successors, (4173), 3040 states have internal predecessors, (4173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:36,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3041 states to 3041 states and 4173 transitions. [2025-03-08 06:16:36,334 INFO L78 Accepts]: Start accepts. Automaton has 3041 states and 4173 transitions. Word has length 53 [2025-03-08 06:16:36,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:36,334 INFO L471 AbstractCegarLoop]: Abstraction has 3041 states and 4173 transitions. [2025-03-08 06:16:36,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:36,334 INFO L276 IsEmpty]: Start isEmpty. Operand 3041 states and 4173 transitions. [2025-03-08 06:16:36,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 06:16:36,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:36,338 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:36,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:16:36,338 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-08 06:16:36,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:36,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1126934533, now seen corresponding path program 1 times [2025-03-08 06:16:36,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:36,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711116824] [2025-03-08 06:16:36,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:36,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:36,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 06:16:36,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 06:16:36,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:36,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:36,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:36,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:36,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711116824] [2025-03-08 06:16:36,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711116824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:36,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:36,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:16:36,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929777568] [2025-03-08 06:16:36,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:36,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:16:36,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:36,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:16:36,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:36,402 INFO L87 Difference]: Start difference. First operand 3041 states and 4173 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:36,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:36,499 INFO L93 Difference]: Finished difference Result 5690 states and 7956 transitions. [2025-03-08 06:16:36,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:16:36,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-08 06:16:36,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:36,509 INFO L225 Difference]: With dead ends: 5690 [2025-03-08 06:16:36,509 INFO L226 Difference]: Without dead ends: 4053 [2025-03-08 06:16:36,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:36,512 INFO L435 NwaCegarLoop]: 1252 mSDtfsCounter, 659 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 2047 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-08 06:16:36,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 2047 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:16:36,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4053 states. [2025-03-08 06:16:36,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4053 to 4047. [2025-03-08 06:16:36,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4047 states, 4041 states have (on average 1.358574610244989) internal successors, (5490), 4046 states have internal predecessors, (5490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:36,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4047 states to 4047 states and 5490 transitions. [2025-03-08 06:16:36,564 INFO L78 Accepts]: Start accepts. Automaton has 4047 states and 5490 transitions. Word has length 54 [2025-03-08 06:16:36,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:36,565 INFO L471 AbstractCegarLoop]: Abstraction has 4047 states and 5490 transitions. [2025-03-08 06:16:36,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:36,565 INFO L276 IsEmpty]: Start isEmpty. Operand 4047 states and 5490 transitions. [2025-03-08 06:16:36,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 06:16:36,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:36,568 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:36,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:16:36,568 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-08 06:16:36,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:36,569 INFO L85 PathProgramCache]: Analyzing trace with hash -696283544, now seen corresponding path program 1 times [2025-03-08 06:16:36,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:36,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137886099] [2025-03-08 06:16:36,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:36,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:36,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 06:16:36,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 06:16:36,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:36,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:36,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:36,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:36,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137886099] [2025-03-08 06:16:36,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137886099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:36,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:36,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:16:36,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665031937] [2025-03-08 06:16:36,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:36,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:16:36,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:36,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:16:36,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:36,629 INFO L87 Difference]: Start difference. First operand 4047 states and 5490 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:36,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:36,687 INFO L93 Difference]: Finished difference Result 5747 states and 8083 transitions. [2025-03-08 06:16:36,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:16:36,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-08 06:16:36,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:36,707 INFO L225 Difference]: With dead ends: 5747 [2025-03-08 06:16:36,707 INFO L226 Difference]: Without dead ends: 4398 [2025-03-08 06:16:36,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:36,713 INFO L435 NwaCegarLoop]: 1153 mSDtfsCounter, 563 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:36,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1736 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:16:36,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4398 states. [2025-03-08 06:16:36,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4398 to 4396. [2025-03-08 06:16:36,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4396 states, 4390 states have (on average 1.3776765375854214) internal successors, (6048), 4395 states have internal predecessors, (6048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:36,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4396 states to 4396 states and 6048 transitions. [2025-03-08 06:16:36,775 INFO L78 Accepts]: Start accepts. Automaton has 4396 states and 6048 transitions. Word has length 54 [2025-03-08 06:16:36,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:36,776 INFO L471 AbstractCegarLoop]: Abstraction has 4396 states and 6048 transitions. [2025-03-08 06:16:36,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:36,776 INFO L276 IsEmpty]: Start isEmpty. Operand 4396 states and 6048 transitions. [2025-03-08 06:16:36,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 06:16:36,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:36,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:36,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:16:36,780 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-08 06:16:36,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:36,780 INFO L85 PathProgramCache]: Analyzing trace with hash -43028613, now seen corresponding path program 1 times [2025-03-08 06:16:36,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:36,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237225898] [2025-03-08 06:16:36,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:36,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:36,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 06:16:36,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 06:16:36,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:36,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:36,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:36,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:36,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237225898] [2025-03-08 06:16:36,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237225898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:36,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:36,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:16:36,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435766651] [2025-03-08 06:16:36,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:36,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:16:36,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:36,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:16:36,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:36,839 INFO L87 Difference]: Start difference. First operand 4396 states and 6048 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:36,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:36,898 INFO L93 Difference]: Finished difference Result 7317 states and 10502 transitions. [2025-03-08 06:16:36,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:16:36,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-08 06:16:36,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:36,910 INFO L225 Difference]: With dead ends: 7317 [2025-03-08 06:16:36,910 INFO L226 Difference]: Without dead ends: 5345 [2025-03-08 06:16:36,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:36,914 INFO L435 NwaCegarLoop]: 1118 mSDtfsCounter, 560 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1694 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-08 06:16:36,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 1694 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:16:36,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5345 states. [2025-03-08 06:16:36,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5345 to 5343. [2025-03-08 06:16:36,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5343 states, 5337 states have (on average 1.405283867341203) internal successors, (7500), 5342 states have internal predecessors, (7500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:36,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5343 states to 5343 states and 7500 transitions. [2025-03-08 06:16:36,984 INFO L78 Accepts]: Start accepts. Automaton has 5343 states and 7500 transitions. Word has length 54 [2025-03-08 06:16:36,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:36,984 INFO L471 AbstractCegarLoop]: Abstraction has 5343 states and 7500 transitions. [2025-03-08 06:16:36,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:36,987 INFO L276 IsEmpty]: Start isEmpty. Operand 5343 states and 7500 transitions. [2025-03-08 06:16:36,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 06:16:36,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:36,993 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:36,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:16:36,993 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:16:36,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:36,994 INFO L85 PathProgramCache]: Analyzing trace with hash 744258676, now seen corresponding path program 1 times [2025-03-08 06:16:36,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:36,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483267715] [2025-03-08 06:16:36,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:36,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:37,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 06:16:37,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 06:16:37,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:37,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:37,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:37,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:37,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483267715] [2025-03-08 06:16:37,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483267715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:37,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:37,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:16:37,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070185156] [2025-03-08 06:16:37,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:37,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:16:37,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:37,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:16:37,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:37,065 INFO L87 Difference]: Start difference. First operand 5343 states and 7500 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:37,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:37,210 INFO L93 Difference]: Finished difference Result 10270 states and 14610 transitions. [2025-03-08 06:16:37,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:16:37,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-08 06:16:37,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:37,219 INFO L225 Difference]: With dead ends: 10270 [2025-03-08 06:16:37,219 INFO L226 Difference]: Without dead ends: 5434 [2025-03-08 06:16:37,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:37,225 INFO L435 NwaCegarLoop]: 953 mSDtfsCounter, 755 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:37,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 1473 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:16:37,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5434 states. [2025-03-08 06:16:37,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5434 to 4425. [2025-03-08 06:16:37,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4425 states, 4419 states have (on average 1.4159312061552387) internal successors, (6257), 4424 states have internal predecessors, (6257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:37,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4425 states to 4425 states and 6257 transitions. [2025-03-08 06:16:37,280 INFO L78 Accepts]: Start accepts. Automaton has 4425 states and 6257 transitions. Word has length 55 [2025-03-08 06:16:37,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:37,281 INFO L471 AbstractCegarLoop]: Abstraction has 4425 states and 6257 transitions. [2025-03-08 06:16:37,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:37,281 INFO L276 IsEmpty]: Start isEmpty. Operand 4425 states and 6257 transitions. [2025-03-08 06:16:37,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 06:16:37,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:37,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:37,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:16:37,283 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:16:37,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:37,283 INFO L85 PathProgramCache]: Analyzing trace with hash 337706900, now seen corresponding path program 1 times [2025-03-08 06:16:37,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:37,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396092450] [2025-03-08 06:16:37,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:37,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:37,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 06:16:37,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 06:16:37,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:37,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:37,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:37,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:37,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396092450] [2025-03-08 06:16:37,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396092450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:37,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:37,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:16:37,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802770224] [2025-03-08 06:16:37,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:37,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:16:37,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:37,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:16:37,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:37,323 INFO L87 Difference]: Start difference. First operand 4425 states and 6257 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:37,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:37,424 INFO L93 Difference]: Finished difference Result 8419 states and 12144 transitions. [2025-03-08 06:16:37,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:16:37,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-08 06:16:37,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:37,432 INFO L225 Difference]: With dead ends: 8419 [2025-03-08 06:16:37,433 INFO L226 Difference]: Without dead ends: 4753 [2025-03-08 06:16:37,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:37,438 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 745 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:37,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 1101 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:16:37,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4753 states. [2025-03-08 06:16:37,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4753 to 3837. [2025-03-08 06:16:37,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3837 states, 3832 states have (on average 1.427713987473904) internal successors, (5471), 3836 states have internal predecessors, (5471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:37,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 5471 transitions. [2025-03-08 06:16:37,486 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 5471 transitions. Word has length 55 [2025-03-08 06:16:37,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:37,486 INFO L471 AbstractCegarLoop]: Abstraction has 3837 states and 5471 transitions. [2025-03-08 06:16:37,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:37,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 5471 transitions. [2025-03-08 06:16:37,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 06:16:37,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:37,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:37,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:16:37,490 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:16:37,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:37,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1648708167, now seen corresponding path program 1 times [2025-03-08 06:16:37,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:37,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440589259] [2025-03-08 06:16:37,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:37,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:37,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 06:16:37,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 06:16:37,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:37,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:37,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:37,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:37,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440589259] [2025-03-08 06:16:37,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440589259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:37,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:37,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:16:37,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832348665] [2025-03-08 06:16:37,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:37,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:16:37,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:37,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:16:37,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:37,535 INFO L87 Difference]: Start difference. First operand 3837 states and 5471 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:37,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:37,596 INFO L93 Difference]: Finished difference Result 7554 states and 10966 transitions. [2025-03-08 06:16:37,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:16:37,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-08 06:16:37,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:37,603 INFO L225 Difference]: With dead ends: 7554 [2025-03-08 06:16:37,603 INFO L226 Difference]: Without dead ends: 4223 [2025-03-08 06:16:37,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:37,608 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 581 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 823 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-08 06:16:37,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 823 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:16:37,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4223 states. [2025-03-08 06:16:37,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4223 to 3399. [2025-03-08 06:16:37,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3399 states, 3395 states have (on average 1.4435935198821797) internal successors, (4901), 3398 states have internal predecessors, (4901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:37,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3399 states to 3399 states and 4901 transitions. [2025-03-08 06:16:37,651 INFO L78 Accepts]: Start accepts. Automaton has 3399 states and 4901 transitions. Word has length 55 [2025-03-08 06:16:37,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:37,651 INFO L471 AbstractCegarLoop]: Abstraction has 3399 states and 4901 transitions. [2025-03-08 06:16:37,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:37,652 INFO L276 IsEmpty]: Start isEmpty. Operand 3399 states and 4901 transitions. [2025-03-08 06:16:37,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 06:16:37,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:37,653 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:37,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:16:37,653 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-08 06:16:37,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:37,655 INFO L85 PathProgramCache]: Analyzing trace with hash -436326369, now seen corresponding path program 1 times [2025-03-08 06:16:37,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:37,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641342414] [2025-03-08 06:16:37,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:37,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:37,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 06:16:37,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 06:16:37,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:37,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:38,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:38,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:38,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641342414] [2025-03-08 06:16:38,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641342414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:38,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:38,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-08 06:16:38,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417983501] [2025-03-08 06:16:38,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:38,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 06:16:38,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:38,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 06:16:38,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:16:38,410 INFO L87 Difference]: Start difference. First operand 3399 states and 4901 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 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-08 06:16:40,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:40,117 INFO L93 Difference]: Finished difference Result 6500 states and 9412 transitions. [2025-03-08 06:16:40,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 06:16:40,117 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 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-08 06:16:40,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:40,126 INFO L225 Difference]: With dead ends: 6500 [2025-03-08 06:16:40,126 INFO L226 Difference]: Without dead ends: 6496 [2025-03-08 06:16:40,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=1023, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 06:16:40,128 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 3842 mSDsluCounter, 5976 mSDsCounter, 0 mSdLazyCounter, 2702 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3842 SdHoareTripleChecker+Valid, 6528 SdHoareTripleChecker+Invalid, 2720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:40,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3842 Valid, 6528 Invalid, 2720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2702 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:16:40,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6496 states. [2025-03-08 06:16:40,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6496 to 3399. [2025-03-08 06:16:40,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3399 states, 3395 states have (on average 1.443298969072165) internal successors, (4900), 3398 states have internal predecessors, (4900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:40,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3399 states to 3399 states and 4900 transitions. [2025-03-08 06:16:40,171 INFO L78 Accepts]: Start accepts. Automaton has 3399 states and 4900 transitions. Word has length 56 [2025-03-08 06:16:40,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:40,171 INFO L471 AbstractCegarLoop]: Abstraction has 3399 states and 4900 transitions. [2025-03-08 06:16:40,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 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-08 06:16:40,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3399 states and 4900 transitions. [2025-03-08 06:16:40,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 06:16:40,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:40,173 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-08 06:16:40,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:16:40,173 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:16:40,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:40,173 INFO L85 PathProgramCache]: Analyzing trace with hash -2051554250, now seen corresponding path program 1 times [2025-03-08 06:16:40,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:40,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244126990] [2025-03-08 06:16:40,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:40,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:40,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 06:16:40,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 06:16:40,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:40,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:40,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:40,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244126990] [2025-03-08 06:16:40,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244126990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:40,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:40,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-08 06:16:40,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808589022] [2025-03-08 06:16:40,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:40,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 06:16:40,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:40,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 06:16:40,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:16:40,830 INFO L87 Difference]: Start difference. First operand 3399 states and 4900 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 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-08 06:16:42,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:42,503 INFO L93 Difference]: Finished difference Result 4734 states and 6814 transitions. [2025-03-08 06:16:42,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 06:16:42,504 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 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-08 06:16:42,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:42,515 INFO L225 Difference]: With dead ends: 4734 [2025-03-08 06:16:42,515 INFO L226 Difference]: Without dead ends: 4730 [2025-03-08 06:16:42,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 06:16:42,517 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 2645 mSDsluCounter, 6558 mSDsCounter, 0 mSdLazyCounter, 2828 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2645 SdHoareTripleChecker+Valid, 7127 SdHoareTripleChecker+Invalid, 2842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:42,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2645 Valid, 7127 Invalid, 2842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2828 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:16:42,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4730 states. [2025-03-08 06:16:42,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4730 to 3406. [2025-03-08 06:16:42,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3406 states, 3402 states have (on average 1.4429747207524986) internal successors, (4909), 3405 states have internal predecessors, (4909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:42,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3406 states to 3406 states and 4909 transitions. [2025-03-08 06:16:42,553 INFO L78 Accepts]: Start accepts. Automaton has 3406 states and 4909 transitions. Word has length 56 [2025-03-08 06:16:42,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:42,554 INFO L471 AbstractCegarLoop]: Abstraction has 3406 states and 4909 transitions. [2025-03-08 06:16:42,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 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-08 06:16:42,554 INFO L276 IsEmpty]: Start isEmpty. Operand 3406 states and 4909 transitions. [2025-03-08 06:16:42,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 06:16:42,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:42,555 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-08 06:16:42,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:16:42,555 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:16:42,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:42,556 INFO L85 PathProgramCache]: Analyzing trace with hash 527339259, now seen corresponding path program 1 times [2025-03-08 06:16:42,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:42,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784938122] [2025-03-08 06:16:42,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:42,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:42,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 06:16:42,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 06:16:42,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:42,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:42,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:42,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:42,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784938122] [2025-03-08 06:16:42,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784938122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:42,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:42,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:16:42,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693564648] [2025-03-08 06:16:42,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:42,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:16:42,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:42,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:16:42,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:16:42,900 INFO L87 Difference]: Start difference. First operand 3406 states and 4909 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 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-08 06:16:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:43,432 INFO L93 Difference]: Finished difference Result 6894 states and 10021 transitions. [2025-03-08 06:16:43,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:16:43,433 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 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-08 06:16:43,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:43,440 INFO L225 Difference]: With dead ends: 6894 [2025-03-08 06:16:43,440 INFO L226 Difference]: Without dead ends: 6743 [2025-03-08 06:16:43,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:16:43,442 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 3972 mSDsluCounter, 1915 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3972 SdHoareTripleChecker+Valid, 2402 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:43,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3972 Valid, 2402 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:16:43,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6743 states. [2025-03-08 06:16:43,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6743 to 3351. [2025-03-08 06:16:43,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3351 states, 3349 states have (on average 1.445207524634219) internal successors, (4840), 3350 states have internal predecessors, (4840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:43,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3351 states to 3351 states and 4840 transitions. [2025-03-08 06:16:43,507 INFO L78 Accepts]: Start accepts. Automaton has 3351 states and 4840 transitions. Word has length 56 [2025-03-08 06:16:43,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:43,507 INFO L471 AbstractCegarLoop]: Abstraction has 3351 states and 4840 transitions. [2025-03-08 06:16:43,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 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-08 06:16:43,507 INFO L276 IsEmpty]: Start isEmpty. Operand 3351 states and 4840 transitions. [2025-03-08 06:16:43,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 06:16:43,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:43,508 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-08 06:16:43,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:16:43,508 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:16:43,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:43,509 INFO L85 PathProgramCache]: Analyzing trace with hash -434422058, now seen corresponding path program 1 times [2025-03-08 06:16:43,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:43,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260407965] [2025-03-08 06:16:43,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:43,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:43,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 06:16:43,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 06:16:43,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:43,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:44,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:44,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:44,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260407965] [2025-03-08 06:16:44,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260407965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:44,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:44,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 06:16:44,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055680725] [2025-03-08 06:16:44,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:44,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 06:16:44,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:44,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 06:16:44,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:16:44,015 INFO L87 Difference]: Start difference. First operand 3351 states and 4840 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 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-08 06:16:44,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:44,793 INFO L93 Difference]: Finished difference Result 4939 states and 7099 transitions. [2025-03-08 06:16:44,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:16:44,793 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 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-08 06:16:44,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:44,799 INFO L225 Difference]: With dead ends: 4939 [2025-03-08 06:16:44,799 INFO L226 Difference]: Without dead ends: 4791 [2025-03-08 06:16:44,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2025-03-08 06:16:44,800 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 2689 mSDsluCounter, 3031 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2689 SdHoareTripleChecker+Valid, 3557 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:44,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2689 Valid, 3557 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:16:44,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4791 states. [2025-03-08 06:16:44,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4791 to 3299. [2025-03-08 06:16:44,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3299 states, 3298 states have (on average 1.4460278956943602) internal successors, (4769), 3298 states have internal predecessors, (4769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:44,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3299 states to 3299 states and 4769 transitions. [2025-03-08 06:16:44,847 INFO L78 Accepts]: Start accepts. Automaton has 3299 states and 4769 transitions. Word has length 57 [2025-03-08 06:16:44,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:44,847 INFO L471 AbstractCegarLoop]: Abstraction has 3299 states and 4769 transitions. [2025-03-08 06:16:44,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 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-08 06:16:44,847 INFO L276 IsEmpty]: Start isEmpty. Operand 3299 states and 4769 transitions. [2025-03-08 06:16:44,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 06:16:44,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:44,849 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] [2025-03-08 06:16:44,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:16:44,850 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-08 06:16:44,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:44,851 INFO L85 PathProgramCache]: Analyzing trace with hash 812015939, now seen corresponding path program 1 times [2025-03-08 06:16:44,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:44,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192366579] [2025-03-08 06:16:44,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:44,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:44,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 06:16:44,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 06:16:44,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:44,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:44,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:44,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:44,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192366579] [2025-03-08 06:16:44,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192366579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:44,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:44,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:16:44,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116913258] [2025-03-08 06:16:44,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:44,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:16:44,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:44,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:16:44,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:16:44,914 INFO L87 Difference]: Start difference. First operand 3299 states and 4769 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:44,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:44,985 INFO L93 Difference]: Finished difference Result 10256 states and 15162 transitions. [2025-03-08 06:16:44,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:16:44,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-03-08 06:16:44,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:44,993 INFO L225 Difference]: With dead ends: 10256 [2025-03-08 06:16:44,993 INFO L226 Difference]: Without dead ends: 7534 [2025-03-08 06:16:44,996 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-08 06:16:44,997 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 1595 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1595 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:44,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1595 Valid, 984 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:16:45,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7534 states. [2025-03-08 06:16:45,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7534 to 5718. [2025-03-08 06:16:45,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5718 states, 5717 states have (on average 1.4455133811439567) internal successors, (8264), 5717 states have internal predecessors, (8264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:45,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5718 states to 5718 states and 8264 transitions. [2025-03-08 06:16:45,051 INFO L78 Accepts]: Start accepts. Automaton has 5718 states and 8264 transitions. Word has length 63 [2025-03-08 06:16:45,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:45,051 INFO L471 AbstractCegarLoop]: Abstraction has 5718 states and 8264 transitions. [2025-03-08 06:16:45,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:45,051 INFO L276 IsEmpty]: Start isEmpty. Operand 5718 states and 8264 transitions. [2025-03-08 06:16:45,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:16:45,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:45,053 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:45,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:16:45,053 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-08 06:16:45,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:45,053 INFO L85 PathProgramCache]: Analyzing trace with hash -529650830, now seen corresponding path program 1 times [2025-03-08 06:16:45,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:45,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300148555] [2025-03-08 06:16:45,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:45,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:45,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:16:45,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:16:45,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:45,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:45,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:45,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:45,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300148555] [2025-03-08 06:16:45,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300148555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:45,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:45,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:16:45,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512202369] [2025-03-08 06:16:45,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:45,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:16:45,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:45,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:16:45,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:16:45,123 INFO L87 Difference]: Start difference. First operand 5718 states and 8264 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:45,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:45,194 INFO L93 Difference]: Finished difference Result 9724 states and 14141 transitions. [2025-03-08 06:16:45,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:16:45,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-08 06:16:45,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:45,200 INFO L225 Difference]: With dead ends: 9724 [2025-03-08 06:16:45,201 INFO L226 Difference]: Without dead ends: 4562 [2025-03-08 06:16:45,205 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-08 06:16:45,206 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 754 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:45,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 875 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:16:45,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4562 states. [2025-03-08 06:16:45,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4562 to 4558. [2025-03-08 06:16:45,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4558 states, 4557 states have (on average 1.4318630678077682) internal successors, (6525), 4557 states have internal predecessors, (6525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:45,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4558 states to 4558 states and 6525 transitions. [2025-03-08 06:16:45,244 INFO L78 Accepts]: Start accepts. Automaton has 4558 states and 6525 transitions. Word has length 64 [2025-03-08 06:16:45,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:45,245 INFO L471 AbstractCegarLoop]: Abstraction has 4558 states and 6525 transitions. [2025-03-08 06:16:45,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:45,245 INFO L276 IsEmpty]: Start isEmpty. Operand 4558 states and 6525 transitions. [2025-03-08 06:16:45,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:16:45,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:45,247 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-08 06:16:45,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:16:45,247 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-08 06:16:45,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:45,247 INFO L85 PathProgramCache]: Analyzing trace with hash 894073034, now seen corresponding path program 1 times [2025-03-08 06:16:45,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:45,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378981580] [2025-03-08 06:16:45,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:45,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:45,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:16:45,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:16:45,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:45,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:45,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:45,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378981580] [2025-03-08 06:16:45,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378981580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:45,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:45,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:16:45,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633554859] [2025-03-08 06:16:45,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:45,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:16:45,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:45,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:16:45,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:45,315 INFO L87 Difference]: Start difference. First operand 4558 states and 6525 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:45,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:45,368 INFO L93 Difference]: Finished difference Result 12182 states and 17659 transitions. [2025-03-08 06:16:45,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:16:45,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-08 06:16:45,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:45,375 INFO L225 Difference]: With dead ends: 12182 [2025-03-08 06:16:45,376 INFO L226 Difference]: Without dead ends: 8180 [2025-03-08 06:16:45,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:45,380 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 278 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 813 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-08 06:16:45,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 813 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:16:45,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8180 states. [2025-03-08 06:16:45,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8180 to 7666. [2025-03-08 06:16:45,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7666 states, 7665 states have (on average 1.4360078277886497) internal successors, (11007), 7665 states have internal predecessors, (11007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:45,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7666 states to 7666 states and 11007 transitions. [2025-03-08 06:16:45,472 INFO L78 Accepts]: Start accepts. Automaton has 7666 states and 11007 transitions. Word has length 66 [2025-03-08 06:16:45,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:45,472 INFO L471 AbstractCegarLoop]: Abstraction has 7666 states and 11007 transitions. [2025-03-08 06:16:45,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:45,472 INFO L276 IsEmpty]: Start isEmpty. Operand 7666 states and 11007 transitions. [2025-03-08 06:16:45,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 06:16:45,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:45,474 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-08 06:16:45,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:16:45,474 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-08 06:16:45,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:45,475 INFO L85 PathProgramCache]: Analyzing trace with hash 2139934006, now seen corresponding path program 1 times [2025-03-08 06:16:45,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:45,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052250913] [2025-03-08 06:16:45,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:45,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:45,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 06:16:45,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 06:16:45,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:45,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:45,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:45,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:45,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052250913] [2025-03-08 06:16:45,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052250913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:45,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:45,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:16:45,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384050216] [2025-03-08 06:16:45,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:45,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:16:45,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:45,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:16:45,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:45,541 INFO L87 Difference]: Start difference. First operand 7666 states and 11007 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:45,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:45,609 INFO L93 Difference]: Finished difference Result 21126 states and 30489 transitions. [2025-03-08 06:16:45,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:16:45,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-08 06:16:45,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:45,624 INFO L225 Difference]: With dead ends: 21126 [2025-03-08 06:16:45,624 INFO L226 Difference]: Without dead ends: 13994 [2025-03-08 06:16:45,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:45,634 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 298 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:45,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 772 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:16:45,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13994 states. [2025-03-08 06:16:45,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13994 to 12968. [2025-03-08 06:16:45,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12968 states, 12967 states have (on average 1.4299375337394926) internal successors, (18542), 12967 states have internal predecessors, (18542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:45,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12968 states to 12968 states and 18542 transitions. [2025-03-08 06:16:45,762 INFO L78 Accepts]: Start accepts. Automaton has 12968 states and 18542 transitions. Word has length 67 [2025-03-08 06:16:45,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:45,763 INFO L471 AbstractCegarLoop]: Abstraction has 12968 states and 18542 transitions. [2025-03-08 06:16:45,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:45,763 INFO L276 IsEmpty]: Start isEmpty. Operand 12968 states and 18542 transitions. [2025-03-08 06:16:45,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 06:16:45,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:45,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] [2025-03-08 06:16:45,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 06:16:45,766 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-08 06:16:45,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:45,767 INFO L85 PathProgramCache]: Analyzing trace with hash 942935603, now seen corresponding path program 1 times [2025-03-08 06:16:45,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:45,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25869263] [2025-03-08 06:16:45,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:45,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:45,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 06:16:45,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 06:16:45,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:45,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:45,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:45,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:45,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25869263] [2025-03-08 06:16:45,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25869263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:45,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:45,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:16:45,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33739655] [2025-03-08 06:16:45,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:45,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:16:45,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:45,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:16:45,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:16:45,923 INFO L87 Difference]: Start difference. First operand 12968 states and 18542 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:45,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:45,969 INFO L93 Difference]: Finished difference Result 14074 states and 20015 transitions. [2025-03-08 06:16:45,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:16:45,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-08 06:16:45,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:45,985 INFO L225 Difference]: With dead ends: 14074 [2025-03-08 06:16:45,985 INFO L226 Difference]: Without dead ends: 14072 [2025-03-08 06:16:45,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:16:45,991 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 0 mSDsluCounter, 1926 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2410 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:45,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2410 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:16:45,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14072 states. [2025-03-08 06:16:46,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14072 to 14072. [2025-03-08 06:16:46,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14072 states, 14071 states have (on average 1.3962049605571742) internal successors, (19646), 14071 states have internal predecessors, (19646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:46,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14072 states to 14072 states and 19646 transitions. [2025-03-08 06:16:46,153 INFO L78 Accepts]: Start accepts. Automaton has 14072 states and 19646 transitions. Word has length 68 [2025-03-08 06:16:46,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:46,153 INFO L471 AbstractCegarLoop]: Abstraction has 14072 states and 19646 transitions. [2025-03-08 06:16:46,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:46,153 INFO L276 IsEmpty]: Start isEmpty. Operand 14072 states and 19646 transitions. [2025-03-08 06:16:46,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 06:16:46,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:46,155 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-08 06:16:46,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 06:16:46,155 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-08 06:16:46,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:46,157 INFO L85 PathProgramCache]: Analyzing trace with hash -647897854, now seen corresponding path program 1 times [2025-03-08 06:16:46,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:46,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889723401] [2025-03-08 06:16:46,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:46,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:46,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 06:16:46,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 06:16:46,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:46,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:46,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:46,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:46,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889723401] [2025-03-08 06:16:46,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889723401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:46,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:46,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:16:46,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514806035] [2025-03-08 06:16:46,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:46,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:16:46,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:46,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:16:46,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:46,202 INFO L87 Difference]: Start difference. First operand 14072 states and 19646 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-08 06:16:46,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:46,307 INFO L93 Difference]: Finished difference Result 38072 states and 53282 transitions. [2025-03-08 06:16:46,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:16:46,308 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-08 06:16:46,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:46,338 INFO L225 Difference]: With dead ends: 38072 [2025-03-08 06:16:46,339 INFO L226 Difference]: Without dead ends: 24522 [2025-03-08 06:16:46,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:46,356 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 298 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:46,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 700 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:16:46,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24522 states. [2025-03-08 06:16:46,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24522 to 24152. [2025-03-08 06:16:46,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24152 states, 24151 states have (on average 1.3715374104591942) internal successors, (33124), 24151 states have internal predecessors, (33124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24152 states to 24152 states and 33124 transitions. [2025-03-08 06:16:46,700 INFO L78 Accepts]: Start accepts. Automaton has 24152 states and 33124 transitions. Word has length 69 [2025-03-08 06:16:46,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:46,700 INFO L471 AbstractCegarLoop]: Abstraction has 24152 states and 33124 transitions. [2025-03-08 06:16:46,700 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-08 06:16:46,700 INFO L276 IsEmpty]: Start isEmpty. Operand 24152 states and 33124 transitions. [2025-03-08 06:16:46,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 06:16:46,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:46,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:46,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 06:16:46,702 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-08 06:16:46,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:46,703 INFO L85 PathProgramCache]: Analyzing trace with hash 468687705, now seen corresponding path program 1 times [2025-03-08 06:16:46,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:46,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838759133] [2025-03-08 06:16:46,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:46,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:46,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 06:16:46,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 06:16:46,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:46,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:46,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:46,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:46,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838759133] [2025-03-08 06:16:46,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838759133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:46,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:46,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:16:46,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165884043] [2025-03-08 06:16:46,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:46,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:16:46,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:46,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:16:46,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:16:46,799 INFO L87 Difference]: Start difference. First operand 24152 states and 33124 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:46,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:46,963 INFO L93 Difference]: Finished difference Result 41434 states and 56994 transitions. [2025-03-08 06:16:46,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:16:46,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-08 06:16:46,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:47,009 INFO L225 Difference]: With dead ends: 41434 [2025-03-08 06:16:47,009 INFO L226 Difference]: Without dead ends: 34352 [2025-03-08 06:16:47,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:16:47,028 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 1055 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:47,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1055 Valid, 1222 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:16:47,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34352 states. [2025-03-08 06:16:47,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34352 to 29898. [2025-03-08 06:16:47,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29898 states, 29897 states have (on average 1.3667592066093588) internal successors, (40862), 29897 states have internal predecessors, (40862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:47,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29898 states to 29898 states and 40862 transitions. [2025-03-08 06:16:47,379 INFO L78 Accepts]: Start accepts. Automaton has 29898 states and 40862 transitions. Word has length 73 [2025-03-08 06:16:47,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:47,379 INFO L471 AbstractCegarLoop]: Abstraction has 29898 states and 40862 transitions. [2025-03-08 06:16:47,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand 29898 states and 40862 transitions. [2025-03-08 06:16:47,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 06:16:47,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:47,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:47,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 06:16:47,382 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-08 06:16:47,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:47,382 INFO L85 PathProgramCache]: Analyzing trace with hash -110200026, now seen corresponding path program 1 times [2025-03-08 06:16:47,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:47,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643877935] [2025-03-08 06:16:47,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:47,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:47,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 06:16:47,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 06:16:47,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:47,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:47,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:47,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:47,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643877935] [2025-03-08 06:16:47,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643877935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:47,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:47,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:16:47,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574218200] [2025-03-08 06:16:47,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:47,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:16:47,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:47,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:16:47,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:16:47,453 INFO L87 Difference]: Start difference. First operand 29898 states and 40862 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:47,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:47,678 INFO L93 Difference]: Finished difference Result 47122 states and 64610 transitions. [2025-03-08 06:16:47,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:16:47,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-08 06:16:47,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:47,728 INFO L225 Difference]: With dead ends: 47122 [2025-03-08 06:16:47,729 INFO L226 Difference]: Without dead ends: 38416 [2025-03-08 06:16:47,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:16:47,746 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 981 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:47,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 1219 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:16:47,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38416 states. [2025-03-08 06:16:48,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38416 to 36138. [2025-03-08 06:16:48,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36138 states, 36137 states have (on average 1.3618728726789717) internal successors, (49214), 36137 states have internal predecessors, (49214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:48,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36138 states to 36138 states and 49214 transitions. [2025-03-08 06:16:48,130 INFO L78 Accepts]: Start accepts. Automaton has 36138 states and 49214 transitions. Word has length 74 [2025-03-08 06:16:48,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:48,130 INFO L471 AbstractCegarLoop]: Abstraction has 36138 states and 49214 transitions. [2025-03-08 06:16:48,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:48,130 INFO L276 IsEmpty]: Start isEmpty. Operand 36138 states and 49214 transitions. [2025-03-08 06:16:48,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 06:16:48,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:48,132 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:48,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 06:16:48,132 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-08 06:16:48,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:48,133 INFO L85 PathProgramCache]: Analyzing trace with hash -818945244, now seen corresponding path program 1 times [2025-03-08 06:16:48,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:48,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498569739] [2025-03-08 06:16:48,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:48,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:48,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 06:16:48,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 06:16:48,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:48,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:48,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:48,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:48,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498569739] [2025-03-08 06:16:48,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498569739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:48,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:48,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:16:48,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903449640] [2025-03-08 06:16:48,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:48,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:16:48,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:48,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:16:48,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:16:48,204 INFO L87 Difference]: Start difference. First operand 36138 states and 49214 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:48,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:48,431 INFO L93 Difference]: Finished difference Result 51242 states and 70074 transitions. [2025-03-08 06:16:48,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:16:48,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-08 06:16:48,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:48,480 INFO L225 Difference]: With dead ends: 51242 [2025-03-08 06:16:48,481 INFO L226 Difference]: Without dead ends: 44160 [2025-03-08 06:16:48,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:16:48,494 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 968 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 1309 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-08 06:16:48,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 1309 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:16:48,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44160 states. [2025-03-08 06:16:48,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44160 to 41882. [2025-03-08 06:16:48,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41882 states, 41881 states have (on average 1.3598051622454097) internal successors, (56950), 41881 states have internal predecessors, (56950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:48,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41882 states to 41882 states and 56950 transitions. [2025-03-08 06:16:48,928 INFO L78 Accepts]: Start accepts. Automaton has 41882 states and 56950 transitions. Word has length 74 [2025-03-08 06:16:48,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:48,928 INFO L471 AbstractCegarLoop]: Abstraction has 41882 states and 56950 transitions. [2025-03-08 06:16:48,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:48,928 INFO L276 IsEmpty]: Start isEmpty. Operand 41882 states and 56950 transitions. [2025-03-08 06:16:48,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 06:16:48,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:48,932 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] [2025-03-08 06:16:48,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 06:16:48,932 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-08 06:16:48,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:48,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1570297016, now seen corresponding path program 1 times [2025-03-08 06:16:48,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:48,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366417188] [2025-03-08 06:16:48,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:48,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:48,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 06:16:48,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 06:16:48,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:48,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:49,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:49,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:49,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366417188] [2025-03-08 06:16:49,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366417188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:49,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:49,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:16:49,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800490511] [2025-03-08 06:16:49,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:49,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:16:49,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:49,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:16:49,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:16:49,122 INFO L87 Difference]: Start difference. First operand 41882 states and 56950 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:49,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:49,339 INFO L93 Difference]: Finished difference Result 56672 states and 77185 transitions. [2025-03-08 06:16:49,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:16:49,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-08 06:16:49,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:49,391 INFO L225 Difference]: With dead ends: 56672 [2025-03-08 06:16:49,392 INFO L226 Difference]: Without dead ends: 43846 [2025-03-08 06:16:49,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:16:49,411 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 1006 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:49,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 1265 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:16:49,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43846 states. [2025-03-08 06:16:49,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43846 to 41570. [2025-03-08 06:16:49,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41570 states, 41569 states have (on average 1.3575019846520244) internal successors, (56430), 41569 states have internal predecessors, (56430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41570 states to 41570 states and 56430 transitions. [2025-03-08 06:16:49,926 INFO L78 Accepts]: Start accepts. Automaton has 41570 states and 56430 transitions. Word has length 81 [2025-03-08 06:16:49,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:49,927 INFO L471 AbstractCegarLoop]: Abstraction has 41570 states and 56430 transitions. [2025-03-08 06:16:49,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:49,927 INFO L276 IsEmpty]: Start isEmpty. Operand 41570 states and 56430 transitions. [2025-03-08 06:16:49,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 06:16:49,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:49,932 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] [2025-03-08 06:16:49,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 06:16:49,932 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-08 06:16:49,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:49,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1005273969, now seen corresponding path program 1 times [2025-03-08 06:16:49,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:49,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276265995] [2025-03-08 06:16:49,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:49,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:49,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 06:16:49,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 06:16:49,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:49,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:50,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:50,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:50,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276265995] [2025-03-08 06:16:50,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276265995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:50,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:50,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:16:50,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386835154] [2025-03-08 06:16:50,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:50,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:16:50,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:50,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:16:50,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:16:50,051 INFO L87 Difference]: Start difference. First operand 41570 states and 56430 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:50,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:50,713 INFO L93 Difference]: Finished difference Result 50931 states and 69021 transitions. [2025-03-08 06:16:50,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:16:50,714 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-03-08 06:16:50,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:50,778 INFO L225 Difference]: With dead ends: 50931 [2025-03-08 06:16:50,778 INFO L226 Difference]: Without dead ends: 49838 [2025-03-08 06:16:50,795 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-08 06:16:50,796 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 1958 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1958 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:50,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1958 Valid, 613 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:16:50,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49838 states. [2025-03-08 06:16:51,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49838 to 41565. [2025-03-08 06:16:51,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41565 states, 41564 states have (on average 1.3574487537291888) internal successors, (56421), 41564 states have internal predecessors, (56421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:51,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41565 states to 41565 states and 56421 transitions. [2025-03-08 06:16:51,391 INFO L78 Accepts]: Start accepts. Automaton has 41565 states and 56421 transitions. Word has length 82 [2025-03-08 06:16:51,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:51,391 INFO L471 AbstractCegarLoop]: Abstraction has 41565 states and 56421 transitions. [2025-03-08 06:16:51,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:51,392 INFO L276 IsEmpty]: Start isEmpty. Operand 41565 states and 56421 transitions. [2025-03-08 06:16:51,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 06:16:51,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:51,399 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] [2025-03-08 06:16:51,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 06:16:51,399 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-08 06:16:51,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:51,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1128340839, now seen corresponding path program 1 times [2025-03-08 06:16:51,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:51,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337512906] [2025-03-08 06:16:51,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:51,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:51,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 06:16:51,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 06:16:51,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:51,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:51,563 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 06:16:51,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:51,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337512906] [2025-03-08 06:16:51,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337512906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:51,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:51,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:16:51,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796518174] [2025-03-08 06:16:51,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:51,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:16:51,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:51,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:16:51,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:16:51,564 INFO L87 Difference]: Start difference. First operand 41565 states and 56421 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:52,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:52,296 INFO L93 Difference]: Finished difference Result 92098 states and 123780 transitions. [2025-03-08 06:16:52,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:16:52,297 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-08 06:16:52,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:52,357 INFO L225 Difference]: With dead ends: 92098 [2025-03-08 06:16:52,357 INFO L226 Difference]: Without dead ends: 60875 [2025-03-08 06:16:52,390 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-08 06:16:52,390 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 1284 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:52,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1284 Valid, 1231 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:16:52,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60875 states. [2025-03-08 06:16:52,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60875 to 41545. [2025-03-08 06:16:52,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41545 states, 41544 states have (on average 1.3575486231465435) internal successors, (56398), 41544 states have internal predecessors, (56398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:52,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41545 states to 41545 states and 56398 transitions. [2025-03-08 06:16:52,955 INFO L78 Accepts]: Start accepts. Automaton has 41545 states and 56398 transitions. Word has length 88 [2025-03-08 06:16:52,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:52,956 INFO L471 AbstractCegarLoop]: Abstraction has 41545 states and 56398 transitions. [2025-03-08 06:16:52,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:52,956 INFO L276 IsEmpty]: Start isEmpty. Operand 41545 states and 56398 transitions. [2025-03-08 06:16:52,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 06:16:52,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:52,964 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] [2025-03-08 06:16:52,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 06:16:52,964 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-08 06:16:52,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:52,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1167147553, now seen corresponding path program 1 times [2025-03-08 06:16:52,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:52,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529317657] [2025-03-08 06:16:52,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:52,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:52,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 06:16:52,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 06:16:52,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:52,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:53,170 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 06:16:53,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:53,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529317657] [2025-03-08 06:16:53,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529317657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:53,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:53,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:16:53,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249874287] [2025-03-08 06:16:53,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:53,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:16:53,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:53,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:16:53,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:16:53,172 INFO L87 Difference]: Start difference. First operand 41545 states and 56398 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:53,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:53,760 INFO L93 Difference]: Finished difference Result 79249 states and 107425 transitions. [2025-03-08 06:16:53,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:16:53,760 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-08 06:16:53,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:53,830 INFO L225 Difference]: With dead ends: 79249 [2025-03-08 06:16:53,831 INFO L226 Difference]: Without dead ends: 63821 [2025-03-08 06:16:53,856 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-08 06:16:53,857 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 2022 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2022 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:53,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2022 Valid, 1051 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:16:53,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63821 states. [2025-03-08 06:16:54,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63821 to 41533. [2025-03-08 06:16:54,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41533 states, 41532 states have (on average 1.3576278532216122) internal successors, (56385), 41532 states have internal predecessors, (56385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:54,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41533 states to 41533 states and 56385 transitions. [2025-03-08 06:16:54,466 INFO L78 Accepts]: Start accepts. Automaton has 41533 states and 56385 transitions. Word has length 89 [2025-03-08 06:16:54,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:54,466 INFO L471 AbstractCegarLoop]: Abstraction has 41533 states and 56385 transitions. [2025-03-08 06:16:54,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:54,466 INFO L276 IsEmpty]: Start isEmpty. Operand 41533 states and 56385 transitions. [2025-03-08 06:16:54,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 06:16:54,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:54,473 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] [2025-03-08 06:16:54,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 06:16:54,474 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-08 06:16:54,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:54,474 INFO L85 PathProgramCache]: Analyzing trace with hash -371195846, now seen corresponding path program 1 times [2025-03-08 06:16:54,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:54,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411345411] [2025-03-08 06:16:54,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:54,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:54,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 06:16:54,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 06:16:54,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:54,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:54,619 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 06:16:54,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:54,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411345411] [2025-03-08 06:16:54,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411345411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:54,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:54,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:16:54,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718004280] [2025-03-08 06:16:54,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:54,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:16:54,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:54,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:16:54,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:16:54,623 INFO L87 Difference]: Start difference. First operand 41533 states and 56385 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:55,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:55,339 INFO L93 Difference]: Finished difference Result 73697 states and 99586 transitions. [2025-03-08 06:16:55,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:16:55,339 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-08 06:16:55,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:55,399 INFO L225 Difference]: With dead ends: 73697 [2025-03-08 06:16:55,399 INFO L226 Difference]: Without dead ends: 58175 [2025-03-08 06:16:55,423 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-08 06:16:55,424 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 2032 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2032 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:55,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2032 Valid, 1058 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:16:55,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58175 states. [2025-03-08 06:16:55,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58175 to 41517. [2025-03-08 06:16:55,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41517 states, 41516 states have (on average 1.3577175065035167) internal successors, (56367), 41516 states have internal predecessors, (56367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:55,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41517 states to 41517 states and 56367 transitions. [2025-03-08 06:16:55,850 INFO L78 Accepts]: Start accepts. Automaton has 41517 states and 56367 transitions. Word has length 89 [2025-03-08 06:16:55,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:55,850 INFO L471 AbstractCegarLoop]: Abstraction has 41517 states and 56367 transitions. [2025-03-08 06:16:55,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:55,850 INFO L276 IsEmpty]: Start isEmpty. Operand 41517 states and 56367 transitions. [2025-03-08 06:16:55,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 06:16:55,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:55,857 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] [2025-03-08 06:16:55,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 06:16:55,857 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-08 06:16:55,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:55,857 INFO L85 PathProgramCache]: Analyzing trace with hash -899300681, now seen corresponding path program 1 times [2025-03-08 06:16:55,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:55,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826691316] [2025-03-08 06:16:55,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:55,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:55,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 06:16:55,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 06:16:55,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:55,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:56,102 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-08 06:16:56,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:56,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826691316] [2025-03-08 06:16:56,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826691316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:56,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:56,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:16:56,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281309640] [2025-03-08 06:16:56,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:56,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:16:56,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:56,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:16:56,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:16:56,104 INFO L87 Difference]: Start difference. First operand 41517 states and 56367 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:56,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:56,912 INFO L93 Difference]: Finished difference Result 94892 states and 127595 transitions. [2025-03-08 06:16:56,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:16:56,913 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-08 06:16:56,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:56,981 INFO L225 Difference]: With dead ends: 94892 [2025-03-08 06:16:56,981 INFO L226 Difference]: Without dead ends: 63690 [2025-03-08 06:16:57,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:16:57,014 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 2003 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2003 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:57,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2003 Valid, 1604 Invalid, 1613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:16:57,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63690 states. [2025-03-08 06:16:57,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63690 to 41991. [2025-03-08 06:16:57,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41991 states, 41990 states have (on average 1.3564181948082876) internal successors, (56956), 41990 states have internal predecessors, (56956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:57,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41991 states to 41991 states and 56956 transitions. [2025-03-08 06:16:57,613 INFO L78 Accepts]: Start accepts. Automaton has 41991 states and 56956 transitions. Word has length 89 [2025-03-08 06:16:57,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:57,613 INFO L471 AbstractCegarLoop]: Abstraction has 41991 states and 56956 transitions. [2025-03-08 06:16:57,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:57,614 INFO L276 IsEmpty]: Start isEmpty. Operand 41991 states and 56956 transitions. [2025-03-08 06:16:57,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 06:16:57,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:57,623 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] [2025-03-08 06:16:57,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 06:16:57,623 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-08 06:16:57,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:57,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1817460906, now seen corresponding path program 1 times [2025-03-08 06:16:57,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:57,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171196385] [2025-03-08 06:16:57,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:57,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:57,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 06:16:57,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 06:16:57,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:57,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:57,897 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-08 06:16:57,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:57,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171196385] [2025-03-08 06:16:57,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171196385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:57,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:57,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:16:57,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278833260] [2025-03-08 06:16:57,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:57,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:16:57,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:57,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:16:57,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:16:57,901 INFO L87 Difference]: Start difference. First operand 41991 states and 56956 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:58,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:58,757 INFO L93 Difference]: Finished difference Result 90526 states and 121630 transitions. [2025-03-08 06:16:58,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 06:16:58,758 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-08 06:16:58,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:58,843 INFO L225 Difference]: With dead ends: 90526 [2025-03-08 06:16:58,843 INFO L226 Difference]: Without dead ends: 75100 [2025-03-08 06:16:58,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2025-03-08 06:16:58,878 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 2135 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 1536 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2135 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:58,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2135 Valid, 1653 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1536 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:16:58,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75100 states. [2025-03-08 06:16:59,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75100 to 66440. [2025-03-08 06:16:59,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66440 states, 66439 states have (on average 1.3493129035656768) internal successors, (89647), 66439 states have internal predecessors, (89647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:59,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66440 states to 66440 states and 89647 transitions. [2025-03-08 06:16:59,760 INFO L78 Accepts]: Start accepts. Automaton has 66440 states and 89647 transitions. Word has length 90 [2025-03-08 06:16:59,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:59,760 INFO L471 AbstractCegarLoop]: Abstraction has 66440 states and 89647 transitions. [2025-03-08 06:16:59,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:59,760 INFO L276 IsEmpty]: Start isEmpty. Operand 66440 states and 89647 transitions. [2025-03-08 06:16:59,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 06:16:59,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:59,769 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] [2025-03-08 06:16:59,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 06:16:59,769 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-08 06:16:59,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:59,770 INFO L85 PathProgramCache]: Analyzing trace with hash 600797400, now seen corresponding path program 1 times [2025-03-08 06:16:59,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:59,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75422891] [2025-03-08 06:16:59,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:59,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:59,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 06:16:59,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 06:16:59,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:59,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:59,963 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:59,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:59,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75422891] [2025-03-08 06:16:59,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75422891] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:16:59,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246384566] [2025-03-08 06:16:59,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:59,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:16:59,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:16:59,966 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:16:59,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 06:17:00,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 06:17:00,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 06:17:00,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:00,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:00,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 06:17:00,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:17:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:01,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:17:01,855 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:01,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246384566] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:17:01,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:17:01,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 28 [2025-03-08 06:17:01,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203906130] [2025-03-08 06:17:01,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:17:01,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 06:17:01,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:01,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 06:17:01,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2025-03-08 06:17:01,858 INFO L87 Difference]: Start difference. First operand 66440 states and 89647 transitions. Second operand has 29 states, 29 states have (on average 8.0) internal successors, (232), 28 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:12,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:12,135 INFO L93 Difference]: Finished difference Result 450969 states and 598893 transitions. [2025-03-08 06:17:12,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2025-03-08 06:17:12,135 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 8.0) internal successors, (232), 28 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-08 06:17:12,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:12,765 INFO L225 Difference]: With dead ends: 450969 [2025-03-08 06:17:12,766 INFO L226 Difference]: Without dead ends: 435463 [2025-03-08 06:17:12,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13229 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5976, Invalid=30696, Unknown=0, NotChecked=0, Total=36672 [2025-03-08 06:17:12,914 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 5719 mSDsluCounter, 6884 mSDsCounter, 0 mSdLazyCounter, 8268 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5719 SdHoareTripleChecker+Valid, 7411 SdHoareTripleChecker+Invalid, 8425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 8268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:17:12,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5719 Valid, 7411 Invalid, 8425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 8268 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-08 06:17:13,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435463 states. [2025-03-08 06:17:16,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435463 to 67018. [2025-03-08 06:17:16,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67018 states, 67017 states have (on average 1.349209901965173) internal successors, (90420), 67017 states have internal predecessors, (90420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:16,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67018 states to 67018 states and 90420 transitions. [2025-03-08 06:17:16,472 INFO L78 Accepts]: Start accepts. Automaton has 67018 states and 90420 transitions. Word has length 90 [2025-03-08 06:17:16,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:17:16,473 INFO L471 AbstractCegarLoop]: Abstraction has 67018 states and 90420 transitions. [2025-03-08 06:17:16,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.0) internal successors, (232), 28 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:16,473 INFO L276 IsEmpty]: Start isEmpty. Operand 67018 states and 90420 transitions. [2025-03-08 06:17:16,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 06:17:16,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:16,482 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] [2025-03-08 06:17:16,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 06:17:16,682 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,SelfDestructingSolverStorable32 [2025-03-08 06:17:16,682 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-08 06:17:16,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:16,683 INFO L85 PathProgramCache]: Analyzing trace with hash 329218307, now seen corresponding path program 1 times [2025-03-08 06:17:16,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:16,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28709483] [2025-03-08 06:17:16,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:16,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:16,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 06:17:16,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 06:17:16,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:16,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:16,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:16,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:16,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28709483] [2025-03-08 06:17:16,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28709483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:17:16,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925930384] [2025-03-08 06:17:16,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:16,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:17:16,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:17:16,776 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:17:16,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 06:17:17,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 06:17:17,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 06:17:17,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:17,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:17,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 06:17:17,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:17:18,081 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 06:17:18,081 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:17:18,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925930384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:17:18,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:17:18,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2025-03-08 06:17:18,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859929444] [2025-03-08 06:17:18,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:17:18,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:17:18,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:18,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:17:18,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-08 06:17:18,082 INFO L87 Difference]: Start difference. First operand 67018 states and 90420 transitions. Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 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-08 06:17:19,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:19,436 INFO L93 Difference]: Finished difference Result 237255 states and 318849 transitions. [2025-03-08 06:17:19,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 06:17:19,436 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 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 90 [2025-03-08 06:17:19,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:19,674 INFO L225 Difference]: With dead ends: 237255 [2025-03-08 06:17:19,675 INFO L226 Difference]: Without dead ends: 188730 [2025-03-08 06:17:19,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2025-03-08 06:17:19,756 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 2844 mSDsluCounter, 3985 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2844 SdHoareTripleChecker+Valid, 4592 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:17:19,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2844 Valid, 4592 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:17:19,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188730 states. [2025-03-08 06:17:21,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188730 to 76613. [2025-03-08 06:17:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76613 states, 76612 states have (on average 1.348183052263353) internal successors, (103287), 76612 states have internal predecessors, (103287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:21,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76613 states to 76613 states and 103287 transitions. [2025-03-08 06:17:21,241 INFO L78 Accepts]: Start accepts. Automaton has 76613 states and 103287 transitions. Word has length 90 [2025-03-08 06:17:21,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:17:21,242 INFO L471 AbstractCegarLoop]: Abstraction has 76613 states and 103287 transitions. [2025-03-08 06:17:21,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 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-08 06:17:21,242 INFO L276 IsEmpty]: Start isEmpty. Operand 76613 states and 103287 transitions. [2025-03-08 06:17:21,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 06:17:21,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:21,251 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] [2025-03-08 06:17:21,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 06:17:21,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-08 06:17:21,452 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:17:21,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:21,452 INFO L85 PathProgramCache]: Analyzing trace with hash 231462898, now seen corresponding path program 1 times [2025-03-08 06:17:21,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:21,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075553573] [2025-03-08 06:17:21,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:21,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:21,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 06:17:21,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 06:17:21,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:21,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:21,857 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-08 06:17:21,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:21,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075553573] [2025-03-08 06:17:21,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075553573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:17:21,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:17:21,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:17:21,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621398531] [2025-03-08 06:17:21,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:17:21,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:17:21,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:21,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:17:21,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:17:21,859 INFO L87 Difference]: Start difference. First operand 76613 states and 103287 transitions. Second operand has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:23,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:23,422 INFO L93 Difference]: Finished difference Result 194402 states and 260009 transitions. [2025-03-08 06:17:23,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-08 06:17:23,422 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-03-08 06:17:23,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:23,633 INFO L225 Difference]: With dead ends: 194402 [2025-03-08 06:17:23,633 INFO L226 Difference]: Without dead ends: 160578 [2025-03-08 06:17:23,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=933, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 06:17:23,699 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 1740 mSDsluCounter, 1960 mSDsCounter, 0 mSdLazyCounter, 2233 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1740 SdHoareTripleChecker+Valid, 2236 SdHoareTripleChecker+Invalid, 2264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:17:23,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1740 Valid, 2236 Invalid, 2264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2233 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:17:23,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160578 states. [2025-03-08 06:17:25,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160578 to 83397. [2025-03-08 06:17:25,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83397 states, 83396 states have (on average 1.3479063744064463) internal successors, (112410), 83396 states have internal predecessors, (112410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:25,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83397 states to 83397 states and 112410 transitions. [2025-03-08 06:17:25,204 INFO L78 Accepts]: Start accepts. Automaton has 83397 states and 112410 transitions. Word has length 91 [2025-03-08 06:17:25,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:17:25,204 INFO L471 AbstractCegarLoop]: Abstraction has 83397 states and 112410 transitions. [2025-03-08 06:17:25,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:25,204 INFO L276 IsEmpty]: Start isEmpty. Operand 83397 states and 112410 transitions. [2025-03-08 06:17:25,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 06:17:25,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:25,213 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] [2025-03-08 06:17:25,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 06:17:25,213 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:17:25,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:25,213 INFO L85 PathProgramCache]: Analyzing trace with hash -199454873, now seen corresponding path program 1 times [2025-03-08 06:17:25,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:25,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693487005] [2025-03-08 06:17:25,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:25,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:25,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 06:17:25,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 06:17:25,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:25,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:25,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:25,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693487005] [2025-03-08 06:17:25,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693487005] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:17:25,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876137307] [2025-03-08 06:17:25,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:25,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:17:25,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:17:25,297 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:17:25,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 06:17:25,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 06:17:25,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 06:17:25,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:25,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:25,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 06:17:25,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:17:25,880 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 06:17:25,881 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:17:25,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876137307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:17:25,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:17:25,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [5] total 17 [2025-03-08 06:17:25,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45096363] [2025-03-08 06:17:25,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:17:25,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 06:17:25,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:25,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 06:17:25,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-08 06:17:25,884 INFO L87 Difference]: Start difference. First operand 83397 states and 112410 transitions. Second operand has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 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-08 06:17:26,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:26,824 INFO L93 Difference]: Finished difference Result 168908 states and 227052 transitions. [2025-03-08 06:17:26,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 06:17:26,824 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 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 91 [2025-03-08 06:17:26,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:26,974 INFO L225 Difference]: With dead ends: 168908 [2025-03-08 06:17:26,975 INFO L226 Difference]: Without dead ends: 135076 [2025-03-08 06:17:27,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2025-03-08 06:17:27,032 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 3491 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3491 SdHoareTripleChecker+Valid, 2253 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:17:27,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3491 Valid, 2253 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:17:27,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135076 states. [2025-03-08 06:17:28,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135076 to 83383. [2025-03-08 06:17:28,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83383 states, 83382 states have (on average 1.3467534959583602) internal successors, (112295), 83382 states have internal predecessors, (112295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:28,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83383 states to 83383 states and 112295 transitions. [2025-03-08 06:17:28,324 INFO L78 Accepts]: Start accepts. Automaton has 83383 states and 112295 transitions. Word has length 91 [2025-03-08 06:17:28,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:17:28,325 INFO L471 AbstractCegarLoop]: Abstraction has 83383 states and 112295 transitions. [2025-03-08 06:17:28,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 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-08 06:17:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand 83383 states and 112295 transitions. [2025-03-08 06:17:28,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 06:17:28,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:28,338 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] [2025-03-08 06:17:28,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 06:17:28,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:17:28,540 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:17:28,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:28,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1156293075, now seen corresponding path program 1 times [2025-03-08 06:17:28,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:28,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697976473] [2025-03-08 06:17:28,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:28,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:28,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 06:17:28,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 06:17:28,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:28,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:28,665 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:28,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:28,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697976473] [2025-03-08 06:17:28,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697976473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:17:28,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063045966] [2025-03-08 06:17:28,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:28,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:17:28,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:17:28,667 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:17:28,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 06:17:28,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 06:17:28,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 06:17:28,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:28,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:28,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 06:17:28,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:17:29,110 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:29,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:17:29,332 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:29,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063045966] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:17:29,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:17:29,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 7] total 13 [2025-03-08 06:17:29,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128475526] [2025-03-08 06:17:29,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:17:29,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:17:29,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:29,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:17:29,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:17:29,334 INFO L87 Difference]: Start difference. First operand 83383 states and 112295 transitions. Second operand has 13 states, 13 states have (on average 16.384615384615383) internal successors, (213), 13 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:31,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:31,676 INFO L93 Difference]: Finished difference Result 609445 states and 822061 transitions. [2025-03-08 06:17:31,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 06:17:31,677 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 16.384615384615383) internal successors, (213), 13 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-03-08 06:17:31,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:32,507 INFO L225 Difference]: With dead ends: 609445 [2025-03-08 06:17:32,508 INFO L226 Difference]: Without dead ends: 527713 [2025-03-08 06:17:32,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=289, Invalid=901, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 06:17:32,726 INFO L435 NwaCegarLoop]: 993 mSDtfsCounter, 3020 mSDsluCounter, 5472 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3020 SdHoareTripleChecker+Valid, 6465 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:17:32,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3020 Valid, 6465 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:17:33,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527713 states.