./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 16d5feefc85136540ef4669433de80b700c3a57c51c2b65f22ef098d8e79a29f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:33:58,670 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:33:58,732 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:33:58,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:33:58,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:33:58,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:33:58,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:33:58,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:33:58,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:33:58,753 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:33:58,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:33:58,754 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:33:58,754 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:33:58,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:33:58,754 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:33:58,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:33:58,754 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:33:58,754 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:33:58,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:33:58,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:33:58,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:33:58,755 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:33:58,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:33:58,755 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:33:58,755 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:33:58,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:33:58,755 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:33:58,755 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:33:58,755 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:33:58,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:33:58,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:33:58,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:33:58,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:33:58,755 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:33:58,755 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:33:58,756 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:33:58,756 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:33:58,756 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:33:58,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:33:58,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:33:58,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:33:58,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:33:58,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:33:58,756 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-jdk21/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 -> 16d5feefc85136540ef4669433de80b700c3a57c51c2b65f22ef098d8e79a29f [2025-02-05 16:33:58,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:33:58,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:33:58,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:33:58,995 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:33:58,996 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:33:58,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-02-05 16:34:00,205 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4faa300cf/5e0ee08534f946e0ace5e648c1b27cba/FLAGd7a656d15 [2025-02-05 16:34:00,547 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:34:00,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-02-05 16:34:00,560 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4faa300cf/5e0ee08534f946e0ace5e648c1b27cba/FLAGd7a656d15 [2025-02-05 16:34:00,576 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4faa300cf/5e0ee08534f946e0ace5e648c1b27cba [2025-02-05 16:34:00,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:34:00,579 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:34:00,581 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:34:00,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:34:00,592 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:34:00,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:34:00" (1/1) ... [2025-02-05 16:34:00,594 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a8238f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:00, skipping insertion in model container [2025-02-05 16:34:00,594 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:34:00" (1/1) ... [2025-02-05 16:34:00,617 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:34:00,832 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[5377,5390] [2025-02-05 16:34:00,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:34:00,896 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:34:00,935 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[5377,5390] [2025-02-05 16:34:00,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:34:00,961 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:34:00,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:00 WrapperNode [2025-02-05 16:34:00,962 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:34:00,963 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:34:00,963 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:34:00,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:34:00,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:00" (1/1) ... [2025-02-05 16:34:00,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:00" (1/1) ... [2025-02-05 16:34:01,013 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 466 [2025-02-05 16:34:01,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:34:01,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:34:01,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:34:01,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:34:01,023 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:00" (1/1) ... [2025-02-05 16:34:01,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:00" (1/1) ... [2025-02-05 16:34:01,027 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:00" (1/1) ... [2025-02-05 16:34:01,042 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-02-05 16:34:01,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:00" (1/1) ... [2025-02-05 16:34:01,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:00" (1/1) ... [2025-02-05 16:34:01,049 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:00" (1/1) ... [2025-02-05 16:34:01,051 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:00" (1/1) ... [2025-02-05 16:34:01,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:00" (1/1) ... [2025-02-05 16:34:01,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:00" (1/1) ... [2025-02-05 16:34:01,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:34:01,057 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:34:01,057 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:34:01,057 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:34:01,058 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:00" (1/1) ... [2025-02-05 16:34:01,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:34:01,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:34:01,095 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:34:01,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:34:01,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:34:01,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:34:01,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:34:01,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:34:01,228 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:34:01,231 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:34:01,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L349: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-02-05 16:34:01,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L184: havoc main_~node2__m2~0#1; [2025-02-05 16:34:01,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L202: havoc main_~node3__m3~0#1; [2025-02-05 16:34:01,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L220: havoc main_~node4__m4~0#1; [2025-02-05 16:34:01,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L435: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-02-05 16:34:01,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L585: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:34:01,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L321: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-02-05 16:34:01,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L521: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-02-05 16:34:01,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L257: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:34:01,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L407: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:34:01,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L161: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:34:01,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L493: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:34:01,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L613: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-02-05 16:34:01,620 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-02-05 16:34:01,620 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:34:01,630 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:34:01,630 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:34:01,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:34:01 BoogieIcfgContainer [2025-02-05 16:34:01,630 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:34:01,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:34:01,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:34:01,637 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:34:01,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:34:00" (1/3) ... [2025-02-05 16:34:01,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eccbdcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:34:01, skipping insertion in model container [2025-02-05 16:34:01,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:00" (2/3) ... [2025-02-05 16:34:01,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eccbdcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:34:01, skipping insertion in model container [2025-02-05 16:34:01,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:34:01" (3/3) ... [2025-02-05 16:34:01,639 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-02-05 16:34:01,650 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:34:01,651 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 112 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:34:01,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:34:01,712 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;@7496b6aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:34:01,713 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:34:01,717 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 110 states have (on average 1.6818181818181819) internal successors, (185), 111 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:01,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-05 16:34:01,723 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:01,724 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:01,724 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:01,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:01,729 INFO L85 PathProgramCache]: Analyzing trace with hash 959705286, now seen corresponding path program 1 times [2025-02-05 16:34:01,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:01,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827918096] [2025-02-05 16:34:01,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:01,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:01,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-05 16:34:01,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 16:34:01,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:01,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:02,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:02,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:02,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827918096] [2025-02-05 16:34:02,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827918096] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:02,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:02,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:02,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166234410] [2025-02-05 16:34:02,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:02,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:02,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:02,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:02,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:02,131 INFO L87 Difference]: Start difference. First operand has 112 states, 110 states have (on average 1.6818181818181819) internal successors, (185), 111 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:02,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:02,176 INFO L93 Difference]: Finished difference Result 266 states and 425 transitions. [2025-02-05 16:34:02,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:02,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-02-05 16:34:02,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:02,186 INFO L225 Difference]: With dead ends: 266 [2025-02-05 16:34:02,186 INFO L226 Difference]: Without dead ends: 175 [2025-02-05 16:34:02,188 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-02-05 16:34:02,191 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 130 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:02,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 384 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:02,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-02-05 16:34:02,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2025-02-05 16:34:02,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 1.505813953488372) internal successors, (259), 172 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:02,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 259 transitions. [2025-02-05 16:34:02,228 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 259 transitions. Word has length 49 [2025-02-05 16:34:02,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:02,229 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 259 transitions. [2025-02-05 16:34:02,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:02,229 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 259 transitions. [2025-02-05 16:34:02,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 16:34:02,230 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:02,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:02,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:34:02,231 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:02,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:02,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1191825056, now seen corresponding path program 1 times [2025-02-05 16:34:02,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:02,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991180776] [2025-02-05 16:34:02,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:02,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:02,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 16:34:02,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 16:34:02,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:02,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:02,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:02,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:02,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991180776] [2025-02-05 16:34:02,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991180776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:02,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:02,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:02,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931902453] [2025-02-05 16:34:02,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:02,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:02,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:02,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:02,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:02,350 INFO L87 Difference]: Start difference. First operand 173 states and 259 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:02,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:02,400 INFO L93 Difference]: Finished difference Result 433 states and 671 transitions. [2025-02-05 16:34:02,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:02,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-02-05 16:34:02,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:02,403 INFO L225 Difference]: With dead ends: 433 [2025-02-05 16:34:02,403 INFO L226 Difference]: Without dead ends: 287 [2025-02-05 16:34:02,404 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-02-05 16:34:02,404 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 108 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:02,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 329 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:02,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-02-05 16:34:02,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2025-02-05 16:34:02,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 1.5352112676056338) internal successors, (436), 284 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:02,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 436 transitions. [2025-02-05 16:34:02,415 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 436 transitions. Word has length 50 [2025-02-05 16:34:02,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:02,415 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 436 transitions. [2025-02-05 16:34:02,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:02,415 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 436 transitions. [2025-02-05 16:34:02,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-05 16:34:02,416 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:02,416 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-02-05 16:34:02,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:34:02,417 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:02,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:02,417 INFO L85 PathProgramCache]: Analyzing trace with hash -868480800, now seen corresponding path program 1 times [2025-02-05 16:34:02,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:02,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005734870] [2025-02-05 16:34:02,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:02,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:02,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 16:34:02,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 16:34:02,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:02,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:02,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:02,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:02,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005734870] [2025-02-05 16:34:02,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005734870] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:02,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:02,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:02,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351644594] [2025-02-05 16:34:02,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:02,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:02,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:02,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:02,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:02,520 INFO L87 Difference]: Start difference. First operand 285 states and 436 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:02,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:02,550 INFO L93 Difference]: Finished difference Result 737 states and 1150 transitions. [2025-02-05 16:34:02,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:02,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-02-05 16:34:02,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:02,553 INFO L225 Difference]: With dead ends: 737 [2025-02-05 16:34:02,556 INFO L226 Difference]: Without dead ends: 479 [2025-02-05 16:34:02,557 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-02-05 16:34:02,557 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 103 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:02,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 314 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:02,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-02-05 16:34:02,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 477. [2025-02-05 16:34:02,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 1.546218487394958) internal successors, (736), 476 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:02,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 736 transitions. [2025-02-05 16:34:02,610 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 736 transitions. Word has length 51 [2025-02-05 16:34:02,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:02,611 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 736 transitions. [2025-02-05 16:34:02,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:02,612 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 736 transitions. [2025-02-05 16:34:02,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 16:34:02,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:02,613 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-02-05 16:34:02,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:34:02,613 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:02,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:02,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1251582778, now seen corresponding path program 1 times [2025-02-05 16:34:02,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:02,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086134903] [2025-02-05 16:34:02,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:02,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:02,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-05 16:34:02,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 16:34:02,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:02,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:02,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:02,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:02,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086134903] [2025-02-05 16:34:02,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086134903] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:02,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:02,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:02,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317068354] [2025-02-05 16:34:02,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:02,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:34:02,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:02,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:34:02,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:34:02,814 INFO L87 Difference]: Start difference. First operand 477 states and 736 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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-02-05 16:34:02,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:02,926 INFO L93 Difference]: Finished difference Result 2727 states and 4281 transitions. [2025-02-05 16:34:02,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:34:02,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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-02-05 16:34:02,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:02,938 INFO L225 Difference]: With dead ends: 2727 [2025-02-05 16:34:02,939 INFO L226 Difference]: Without dead ends: 2277 [2025-02-05 16:34:02,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:34:02,942 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1024 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:02,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1024 Valid, 1305 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:34:02,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2277 states. [2025-02-05 16:34:02,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2277 to 925. [2025-02-05 16:34:02,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 924 states have (on average 1.5454545454545454) internal successors, (1428), 924 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:02,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1428 transitions. [2025-02-05 16:34:02,997 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1428 transitions. Word has length 52 [2025-02-05 16:34:02,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:02,998 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1428 transitions. [2025-02-05 16:34:02,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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-02-05 16:34:02,998 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1428 transitions. [2025-02-05 16:34:02,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 16:34:02,999 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:03,000 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-02-05 16:34:03,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:34:03,002 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:03,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:03,003 INFO L85 PathProgramCache]: Analyzing trace with hash 145315760, now seen corresponding path program 1 times [2025-02-05 16:34:03,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:03,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656938397] [2025-02-05 16:34:03,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:03,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:03,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 16:34:03,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 16:34:03,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:03,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:03,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:03,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:03,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656938397] [2025-02-05 16:34:03,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656938397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:03,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:03,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:03,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028078800] [2025-02-05 16:34:03,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:03,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:34:03,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:03,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:34:03,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:34:03,253 INFO L87 Difference]: Start difference. First operand 925 states and 1428 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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-02-05 16:34:03,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:03,361 INFO L93 Difference]: Finished difference Result 4029 states and 6232 transitions. [2025-02-05 16:34:03,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:34:03,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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-02-05 16:34:03,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:03,377 INFO L225 Difference]: With dead ends: 4029 [2025-02-05 16:34:03,377 INFO L226 Difference]: Without dead ends: 3131 [2025-02-05 16:34:03,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:34:03,382 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 501 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:03,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 593 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:34:03,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3131 states. [2025-02-05 16:34:03,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3131 to 3125. [2025-02-05 16:34:03,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 3124 states have (on average 1.5403329065300897) internal successors, (4812), 3124 states have internal predecessors, (4812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:03,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4812 transitions. [2025-02-05 16:34:03,494 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4812 transitions. Word has length 53 [2025-02-05 16:34:03,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:03,495 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4812 transitions. [2025-02-05 16:34:03,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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-02-05 16:34:03,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4812 transitions. [2025-02-05 16:34:03,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 16:34:03,499 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:03,499 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-02-05 16:34:03,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:34:03,499 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:03,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:03,500 INFO L85 PathProgramCache]: Analyzing trace with hash 929039828, now seen corresponding path program 1 times [2025-02-05 16:34:03,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:03,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180624246] [2025-02-05 16:34:03,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:03,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:03,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 16:34:03,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 16:34:03,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:03,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:03,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:03,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180624246] [2025-02-05 16:34:03,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180624246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:03,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:03,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:03,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217143612] [2025-02-05 16:34:03,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:03,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:03,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:03,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:03,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:03,588 INFO L87 Difference]: Start difference. First operand 3125 states and 4812 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-02-05 16:34:03,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:03,639 INFO L93 Difference]: Finished difference Result 8249 states and 12654 transitions. [2025-02-05 16:34:03,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:03,639 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-02-05 16:34:03,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:03,652 INFO L225 Difference]: With dead ends: 8249 [2025-02-05 16:34:03,652 INFO L226 Difference]: Without dead ends: 5151 [2025-02-05 16:34:03,657 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-02-05 16:34:03,658 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 115 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:03,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 369 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:03,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5151 states. [2025-02-05 16:34:03,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5151 to 5149. [2025-02-05 16:34:03,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5149 states, 5148 states have (on average 1.5159285159285159) internal successors, (7804), 5148 states have internal predecessors, (7804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:03,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5149 states to 5149 states and 7804 transitions. [2025-02-05 16:34:03,777 INFO L78 Accepts]: Start accepts. Automaton has 5149 states and 7804 transitions. Word has length 54 [2025-02-05 16:34:03,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:03,777 INFO L471 AbstractCegarLoop]: Abstraction has 5149 states and 7804 transitions. [2025-02-05 16:34:03,777 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-02-05 16:34:03,778 INFO L276 IsEmpty]: Start isEmpty. Operand 5149 states and 7804 transitions. [2025-02-05 16:34:03,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 16:34:03,778 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:03,778 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-02-05 16:34:03,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:34:03,779 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:03,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:03,779 INFO L85 PathProgramCache]: Analyzing trace with hash -2081953998, now seen corresponding path program 1 times [2025-02-05 16:34:03,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:03,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169053840] [2025-02-05 16:34:03,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:03,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:03,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 16:34:03,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 16:34:03,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:03,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:04,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:04,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:04,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169053840] [2025-02-05 16:34:04,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169053840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:04,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:04,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:34:04,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488361075] [2025-02-05 16:34:04,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:04,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:34:04,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:04,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:34:04,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:34:04,217 INFO L87 Difference]: Start difference. First operand 5149 states and 7804 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-02-05 16:34:04,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:04,294 INFO L93 Difference]: Finished difference Result 5407 states and 8189 transitions. [2025-02-05 16:34:04,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:34:04,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-02-05 16:34:04,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:04,308 INFO L225 Difference]: With dead ends: 5407 [2025-02-05 16:34:04,308 INFO L226 Difference]: Without dead ends: 5405 [2025-02-05 16:34:04,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:34:04,309 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:04,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 606 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:34:04,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5405 states. [2025-02-05 16:34:04,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5405 to 5405. [2025-02-05 16:34:04,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5405 states, 5404 states have (on average 1.4914877868245744) internal successors, (8060), 5404 states have internal predecessors, (8060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5405 states to 5405 states and 8060 transitions. [2025-02-05 16:34:04,374 INFO L78 Accepts]: Start accepts. Automaton has 5405 states and 8060 transitions. Word has length 55 [2025-02-05 16:34:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:04,374 INFO L471 AbstractCegarLoop]: Abstraction has 5405 states and 8060 transitions. [2025-02-05 16:34:04,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-02-05 16:34:04,374 INFO L276 IsEmpty]: Start isEmpty. Operand 5405 states and 8060 transitions. [2025-02-05 16:34:04,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 16:34:04,375 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:04,375 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-02-05 16:34:04,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:34:04,375 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:04,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:04,376 INFO L85 PathProgramCache]: Analyzing trace with hash -111295944, now seen corresponding path program 1 times [2025-02-05 16:34:04,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:04,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457879787] [2025-02-05 16:34:04,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:04,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:04,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 16:34:04,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 16:34:04,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:04,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:04,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:04,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457879787] [2025-02-05 16:34:04,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457879787] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:04,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:04,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:04,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501098236] [2025-02-05 16:34:04,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:04,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:04,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:04,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:04,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:04,458 INFO L87 Difference]: Start difference. First operand 5405 states and 8060 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:04,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:04,492 INFO L93 Difference]: Finished difference Result 13259 states and 19788 transitions. [2025-02-05 16:34:04,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:04,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-02-05 16:34:04,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:04,515 INFO L225 Difference]: With dead ends: 13259 [2025-02-05 16:34:04,516 INFO L226 Difference]: Without dead ends: 7881 [2025-02-05 16:34:04,526 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-02-05 16:34:04,526 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 92 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:04,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 281 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:04,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7881 states. [2025-02-05 16:34:04,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7881 to 7823. [2025-02-05 16:34:04,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7823 states, 7822 states have (on average 1.4812068524673996) internal successors, (11586), 7822 states have internal predecessors, (11586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:04,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7823 states to 7823 states and 11586 transitions. [2025-02-05 16:34:04,673 INFO L78 Accepts]: Start accepts. Automaton has 7823 states and 11586 transitions. Word has length 56 [2025-02-05 16:34:04,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:04,675 INFO L471 AbstractCegarLoop]: Abstraction has 7823 states and 11586 transitions. [2025-02-05 16:34:04,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:04,676 INFO L276 IsEmpty]: Start isEmpty. Operand 7823 states and 11586 transitions. [2025-02-05 16:34:04,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 16:34:04,683 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:04,683 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:04,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:34:04,683 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:04,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:04,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1759063167, now seen corresponding path program 1 times [2025-02-05 16:34:04,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:04,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252236205] [2025-02-05 16:34:04,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:04,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:04,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 16:34:04,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 16:34:04,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:04,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:05,042 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:05,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:05,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252236205] [2025-02-05 16:34:05,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252236205] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:34:05,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421415702] [2025-02-05 16:34:05,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:05,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:34:05,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:34:05,045 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:34:05,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:34:05,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 16:34:05,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 16:34:05,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:05,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:05,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 16:34:05,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:34:06,027 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:06,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:34:06,551 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:06,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421415702] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:34:06,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:34:06,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 24 [2025-02-05 16:34:06,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191755842] [2025-02-05 16:34:06,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:34:06,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-05 16:34:06,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:06,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-05 16:34:06,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2025-02-05 16:34:06,554 INFO L87 Difference]: Start difference. First operand 7823 states and 11586 transitions. Second operand has 24 states, 24 states have (on average 9.5) internal successors, (228), 24 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:13,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:13,032 INFO L93 Difference]: Finished difference Result 69512 states and 102554 transitions. [2025-02-05 16:34:13,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2025-02-05 16:34:13,033 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.5) internal successors, (228), 24 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-05 16:34:13,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:13,128 INFO L225 Difference]: With dead ends: 69512 [2025-02-05 16:34:13,128 INFO L226 Difference]: Without dead ends: 61718 [2025-02-05 16:34:13,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9284 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3880, Invalid=19376, Unknown=0, NotChecked=0, Total=23256 [2025-02-05 16:34:13,145 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 11999 mSDsluCounter, 2072 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11999 SdHoareTripleChecker+Valid, 2251 SdHoareTripleChecker+Invalid, 2627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:13,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11999 Valid, 2251 Invalid, 2627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 16:34:13,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61718 states. [2025-02-05 16:34:13,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61718 to 55603. [2025-02-05 16:34:13,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55603 states, 55602 states have (on average 1.4573576490054314) internal successors, (81032), 55602 states have internal predecessors, (81032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:13,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55603 states to 55603 states and 81032 transitions. [2025-02-05 16:34:13,997 INFO L78 Accepts]: Start accepts. Automaton has 55603 states and 81032 transitions. Word has length 79 [2025-02-05 16:34:13,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:13,997 INFO L471 AbstractCegarLoop]: Abstraction has 55603 states and 81032 transitions. [2025-02-05 16:34:13,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.5) internal successors, (228), 24 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:13,997 INFO L276 IsEmpty]: Start isEmpty. Operand 55603 states and 81032 transitions. [2025-02-05 16:34:14,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 16:34:14,000 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:14,000 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:14,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 16:34:14,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:34:14,205 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:14,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:14,206 INFO L85 PathProgramCache]: Analyzing trace with hash 2006002718, now seen corresponding path program 1 times [2025-02-05 16:34:14,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:14,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519337691] [2025-02-05 16:34:14,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:14,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:14,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 16:34:14,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 16:34:14,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:14,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:14,477 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:14,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:14,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519337691] [2025-02-05 16:34:14,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519337691] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:14,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:14,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:14,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10459001] [2025-02-05 16:34:14,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:14,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:14,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:14,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:14,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:14,479 INFO L87 Difference]: Start difference. First operand 55603 states and 81032 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:14,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:14,771 INFO L93 Difference]: Finished difference Result 125675 states and 182844 transitions. [2025-02-05 16:34:14,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:14,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-02-05 16:34:14,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:14,899 INFO L225 Difference]: With dead ends: 125675 [2025-02-05 16:34:14,899 INFO L226 Difference]: Without dead ends: 81071 [2025-02-05 16:34:14,937 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-02-05 16:34:14,938 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 88 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:14,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 300 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:14,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81071 states. [2025-02-05 16:34:15,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81071 to 81069. [2025-02-05 16:34:15,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81069 states, 81068 states have (on average 1.441197513198796) internal successors, (116835), 81068 states have internal predecessors, (116835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:16,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81069 states to 81069 states and 116835 transitions. [2025-02-05 16:34:16,699 INFO L78 Accepts]: Start accepts. Automaton has 81069 states and 116835 transitions. Word has length 80 [2025-02-05 16:34:16,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:16,699 INFO L471 AbstractCegarLoop]: Abstraction has 81069 states and 116835 transitions. [2025-02-05 16:34:16,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:16,700 INFO L276 IsEmpty]: Start isEmpty. Operand 81069 states and 116835 transitions. [2025-02-05 16:34:16,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 16:34:16,703 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:16,704 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:16,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:34:16,704 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:16,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:16,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1172086980, now seen corresponding path program 1 times [2025-02-05 16:34:16,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:16,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925808758] [2025-02-05 16:34:16,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:16,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:16,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 16:34:16,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 16:34:16,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:16,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:16,749 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:16,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:16,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925808758] [2025-02-05 16:34:16,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925808758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:16,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:16,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:16,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251484670] [2025-02-05 16:34:16,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:16,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:16,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:16,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:16,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:16,751 INFO L87 Difference]: Start difference. First operand 81069 states and 116835 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:17,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:17,157 INFO L93 Difference]: Finished difference Result 199301 states and 286079 transitions. [2025-02-05 16:34:17,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:17,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-02-05 16:34:17,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:17,327 INFO L225 Difference]: With dead ends: 199301 [2025-02-05 16:34:17,328 INFO L226 Difference]: Without dead ends: 129408 [2025-02-05 16:34:17,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-02-05 16:34:17,512 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 89 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:17,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 319 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:17,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129408 states. [2025-02-05 16:34:19,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129408 to 126042. [2025-02-05 16:34:19,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126042 states, 126041 states have (on average 1.421751652240144) internal successors, (179199), 126041 states have internal predecessors, (179199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:19,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126042 states to 126042 states and 179199 transitions. [2025-02-05 16:34:19,944 INFO L78 Accepts]: Start accepts. Automaton has 126042 states and 179199 transitions. Word has length 80 [2025-02-05 16:34:19,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:19,945 INFO L471 AbstractCegarLoop]: Abstraction has 126042 states and 179199 transitions. [2025-02-05 16:34:19,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:19,945 INFO L276 IsEmpty]: Start isEmpty. Operand 126042 states and 179199 transitions. [2025-02-05 16:34:19,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 16:34:19,952 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:19,952 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:19,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:34:19,953 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:19,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:19,954 INFO L85 PathProgramCache]: Analyzing trace with hash -2108825488, now seen corresponding path program 1 times [2025-02-05 16:34:19,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:19,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266903458] [2025-02-05 16:34:19,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:19,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:19,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 16:34:19,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 16:34:19,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:19,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:20,272 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:20,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:20,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266903458] [2025-02-05 16:34:20,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266903458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:20,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:20,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:20,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733055533] [2025-02-05 16:34:20,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:20,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:20,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:20,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:20,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:20,273 INFO L87 Difference]: Start difference. First operand 126042 states and 179199 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:21,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:21,004 INFO L93 Difference]: Finished difference Result 196737 states and 278702 transitions. [2025-02-05 16:34:21,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:21,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-02-05 16:34:21,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:21,259 INFO L225 Difference]: With dead ends: 196737 [2025-02-05 16:34:21,260 INFO L226 Difference]: Without dead ends: 126519 [2025-02-05 16:34:21,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:21,313 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 93 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:21,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 368 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:21,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126519 states. [2025-02-05 16:34:22,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126519 to 108965. [2025-02-05 16:34:22,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108965 states, 108964 states have (on average 1.4000036709371904) internal successors, (152550), 108964 states have internal predecessors, (152550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:23,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108965 states to 108965 states and 152550 transitions. [2025-02-05 16:34:23,456 INFO L78 Accepts]: Start accepts. Automaton has 108965 states and 152550 transitions. Word has length 80 [2025-02-05 16:34:23,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:23,456 INFO L471 AbstractCegarLoop]: Abstraction has 108965 states and 152550 transitions. [2025-02-05 16:34:23,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:23,457 INFO L276 IsEmpty]: Start isEmpty. Operand 108965 states and 152550 transitions. [2025-02-05 16:34:23,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 16:34:23,463 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:23,464 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:23,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:34:23,465 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:23,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:23,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1506799274, now seen corresponding path program 1 times [2025-02-05 16:34:23,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:23,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997214587] [2025-02-05 16:34:23,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:23,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:23,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 16:34:23,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 16:34:23,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:23,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:23,628 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:34:23,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:23,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997214587] [2025-02-05 16:34:23,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997214587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:23,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:23,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:23,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687423361] [2025-02-05 16:34:23,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:23,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:34:23,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:23,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:34:23,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:34:23,630 INFO L87 Difference]: Start difference. First operand 108965 states and 152550 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:24,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:24,809 INFO L93 Difference]: Finished difference Result 262726 states and 371114 transitions. [2025-02-05 16:34:24,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:34:24,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-02-05 16:34:24,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:25,071 INFO L225 Difference]: With dead ends: 262726 [2025-02-05 16:34:25,078 INFO L226 Difference]: Without dead ends: 221841 [2025-02-05 16:34:25,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:34:25,160 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 733 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:25,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 1037 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:34:25,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221841 states. [2025-02-05 16:34:27,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221841 to 148490. [2025-02-05 16:34:27,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148490 states, 148489 states have (on average 1.395564654620881) internal successors, (207226), 148489 states have internal predecessors, (207226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:28,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148490 states to 148490 states and 207226 transitions. [2025-02-05 16:34:28,144 INFO L78 Accepts]: Start accepts. Automaton has 148490 states and 207226 transitions. Word has length 80 [2025-02-05 16:34:28,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:28,144 INFO L471 AbstractCegarLoop]: Abstraction has 148490 states and 207226 transitions. [2025-02-05 16:34:28,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:28,145 INFO L276 IsEmpty]: Start isEmpty. Operand 148490 states and 207226 transitions. [2025-02-05 16:34:28,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 16:34:28,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:28,150 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:28,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:34:28,151 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:28,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:28,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1147575368, now seen corresponding path program 1 times [2025-02-05 16:34:28,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:28,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503611133] [2025-02-05 16:34:28,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:28,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:28,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 16:34:28,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 16:34:28,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:28,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:28,272 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:34:28,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:28,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503611133] [2025-02-05 16:34:28,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503611133] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:28,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:28,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:28,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3851451] [2025-02-05 16:34:28,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:28,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:34:28,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:28,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:34:28,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:34:28,274 INFO L87 Difference]: Start difference. First operand 148490 states and 207226 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:29,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:29,099 INFO L93 Difference]: Finished difference Result 309981 states and 436850 transitions. [2025-02-05 16:34:29,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:34:29,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-02-05 16:34:29,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:29,987 INFO L225 Difference]: With dead ends: 309981 [2025-02-05 16:34:29,987 INFO L226 Difference]: Without dead ends: 260864 [2025-02-05 16:34:30,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:34:30,059 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 784 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:30,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 1075 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:34:30,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260864 states. [2025-02-05 16:34:32,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260864 to 195935. [2025-02-05 16:34:32,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195935 states, 195934 states have (on average 1.3933365316892423) internal successors, (273002), 195934 states have internal predecessors, (273002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:32,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195935 states to 195935 states and 273002 transitions. [2025-02-05 16:34:32,990 INFO L78 Accepts]: Start accepts. Automaton has 195935 states and 273002 transitions. Word has length 80 [2025-02-05 16:34:32,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:32,991 INFO L471 AbstractCegarLoop]: Abstraction has 195935 states and 273002 transitions. [2025-02-05 16:34:32,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:32,991 INFO L276 IsEmpty]: Start isEmpty. Operand 195935 states and 273002 transitions. [2025-02-05 16:34:32,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 16:34:32,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:32,995 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:32,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:34:32,996 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:32,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:32,996 INFO L85 PathProgramCache]: Analyzing trace with hash 349900802, now seen corresponding path program 1 times [2025-02-05 16:34:32,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:32,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621512640] [2025-02-05 16:34:32,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:32,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:33,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 16:34:33,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 16:34:33,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:33,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:33,142 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:34:33,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:33,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621512640] [2025-02-05 16:34:33,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621512640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:33,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:33,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:33,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464169735] [2025-02-05 16:34:33,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:33,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:34:33,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:33,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:34:33,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:34:33,143 INFO L87 Difference]: Start difference. First operand 195935 states and 273002 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:34,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:34,607 INFO L93 Difference]: Finished difference Result 362373 states and 509614 transitions. [2025-02-05 16:34:34,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:34:34,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-02-05 16:34:34,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:35,168 INFO L225 Difference]: With dead ends: 362373 [2025-02-05 16:34:35,169 INFO L226 Difference]: Without dead ends: 308236 [2025-02-05 16:34:35,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:34:35,253 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 783 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:35,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 974 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:34:35,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308236 states. [2025-02-05 16:34:38,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308236 to 233546. [2025-02-05 16:34:38,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233546 states, 233545 states have (on average 1.3924596972746153) internal successors, (325202), 233545 states have internal predecessors, (325202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233546 states to 233546 states and 325202 transitions. [2025-02-05 16:34:39,423 INFO L78 Accepts]: Start accepts. Automaton has 233546 states and 325202 transitions. Word has length 80 [2025-02-05 16:34:39,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:39,423 INFO L471 AbstractCegarLoop]: Abstraction has 233546 states and 325202 transitions. [2025-02-05 16:34:39,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:39,424 INFO L276 IsEmpty]: Start isEmpty. Operand 233546 states and 325202 transitions. [2025-02-05 16:34:39,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:34:39,428 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:39,428 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:39,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:34:39,429 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:39,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:39,429 INFO L85 PathProgramCache]: Analyzing trace with hash 153542123, now seen corresponding path program 1 times [2025-02-05 16:34:39,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:39,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899218572] [2025-02-05 16:34:39,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:39,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:39,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:34:39,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:34:39,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:39,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:40,060 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 16:34:40,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:40,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899218572] [2025-02-05 16:34:40,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899218572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:40,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:40,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:40,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173293370] [2025-02-05 16:34:40,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:40,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:34:40,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:40,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:34:40,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:34:40,062 INFO L87 Difference]: Start difference. First operand 233546 states and 325202 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:40,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:40,598 INFO L93 Difference]: Finished difference Result 355470 states and 498556 transitions. [2025-02-05 16:34:40,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:34:40,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-02-05 16:34:40,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:41,018 INFO L225 Difference]: With dead ends: 355470 [2025-02-05 16:34:41,019 INFO L226 Difference]: Without dead ends: 331428 [2025-02-05 16:34:41,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:34:41,130 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 809 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:41,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 936 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:41,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331428 states. [2025-02-05 16:34:44,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331428 to 256788. [2025-02-05 16:34:44,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256788 states, 256787 states have (on average 1.3931780035593702) internal successors, (357750), 256787 states have internal predecessors, (357750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:45,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256788 states to 256788 states and 357750 transitions. [2025-02-05 16:34:45,591 INFO L78 Accepts]: Start accepts. Automaton has 256788 states and 357750 transitions. Word has length 81 [2025-02-05 16:34:45,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:45,592 INFO L471 AbstractCegarLoop]: Abstraction has 256788 states and 357750 transitions. [2025-02-05 16:34:45,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:45,592 INFO L276 IsEmpty]: Start isEmpty. Operand 256788 states and 357750 transitions. [2025-02-05 16:34:45,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 16:34:45,597 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:45,597 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:45,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:34:45,598 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:45,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:45,598 INFO L85 PathProgramCache]: Analyzing trace with hash -473504647, now seen corresponding path program 1 times [2025-02-05 16:34:45,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:45,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026815602] [2025-02-05 16:34:45,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:45,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:45,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 16:34:45,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 16:34:45,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:45,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:45,636 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:45,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:45,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026815602] [2025-02-05 16:34:45,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026815602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:45,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:45,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:45,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778701699] [2025-02-05 16:34:45,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:45,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:45,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:45,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:45,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:45,638 INFO L87 Difference]: Start difference. First operand 256788 states and 357750 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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-02-05 16:34:47,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:47,525 INFO L93 Difference]: Finished difference Result 604356 states and 837902 transitions. [2025-02-05 16:34:47,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:47,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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 83 [2025-02-05 16:34:47,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:48,224 INFO L225 Difference]: With dead ends: 604356 [2025-02-05 16:34:48,225 INFO L226 Difference]: Without dead ends: 380378 [2025-02-05 16:34:48,372 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-02-05 16:34:48,373 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 89 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:48,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 366 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:48,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380378 states.