./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7b954f9d8b4ab9030eea8f5c4186ef19ab45ad4620470fe362259155373d879e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:18:39,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:18:39,645 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:18:39,650 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:18:39,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:18:39,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:18:39,668 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:18:39,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:18:39,668 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:18:39,668 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:18:39,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:18:39,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:18:39,669 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:18:39,669 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:18:39,669 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:18:39,669 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:18:39,669 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:18:39,669 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:18:39,669 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:18:39,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:18:39,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:18:39,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:18:39,670 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:18:39,670 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:18:39,670 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:18:39,670 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:18:39,670 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:18:39,670 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:18:39,670 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:18:39,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:18:39,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:18:39,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:18:39,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:18:39,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:18:39,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:18:39,670 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:18:39,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:18:39,671 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:18:39,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:18:39,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:18:39,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:18:39,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:18:39,671 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:18:39,671 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7b954f9d8b4ab9030eea8f5c4186ef19ab45ad4620470fe362259155373d879e [2025-03-08 06:18:39,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:18:39,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:18:39,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:18:39,912 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:18:39,912 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:18:39,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2025-03-08 06:18:41,015 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4deac0109/fc82d6504bd14b828427d2c40f0fccef/FLAG780227849 [2025-03-08 06:18:41,259 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:18:41,260 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2025-03-08 06:18:41,268 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4deac0109/fc82d6504bd14b828427d2c40f0fccef/FLAG780227849 [2025-03-08 06:18:41,584 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4deac0109/fc82d6504bd14b828427d2c40f0fccef [2025-03-08 06:18:41,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:18:41,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:18:41,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:18:41,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:18:41,592 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:18:41,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:18:41" (1/1) ... [2025-03-08 06:18:41,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22d995cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:18:41, skipping insertion in model container [2025-03-08 06:18:41,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:18:41" (1/1) ... [2025-03-08 06:18:41,614 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:18:41,739 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[5339,5352] [2025-03-08 06:18:41,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:18:41,769 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:18:41,789 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[5339,5352] [2025-03-08 06:18:41,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:18:41,816 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:18:41,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:18:41 WrapperNode [2025-03-08 06:18:41,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:18:41,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:18:41,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:18:41,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:18:41,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:18:41" (1/1) ... [2025-03-08 06:18:41,831 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:18:41" (1/1) ... [2025-03-08 06:18:41,853 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 457 [2025-03-08 06:18:41,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:18:41,854 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:18:41,854 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:18:41,854 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:18:41,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:18:41" (1/1) ... [2025-03-08 06:18:41,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:18:41" (1/1) ... [2025-03-08 06:18:41,862 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:18:41" (1/1) ... [2025-03-08 06:18:41,871 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 06:18:41,872 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:18:41" (1/1) ... [2025-03-08 06:18:41,872 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:18:41" (1/1) ... [2025-03-08 06:18:41,878 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:18:41" (1/1) ... [2025-03-08 06:18:41,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:18:41" (1/1) ... [2025-03-08 06:18:41,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:18:41" (1/1) ... [2025-03-08 06:18:41,880 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:18:41" (1/1) ... [2025-03-08 06:18:41,886 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:18:41,887 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:18:41,887 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:18:41,887 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:18:41,891 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:18:41" (1/1) ... [2025-03-08 06:18:41,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:18:41,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:18:41,917 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:18:41,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:18:41,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:18:41,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:18:41,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:18:41,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:18:42,022 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:18:42,024 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:18:42,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L349: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-08 06:18:42,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L407: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-08 06:18:42,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node4__m4~0#1; [2025-03-08 06:18:42,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L435: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-08 06:18:42,385 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L493: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-08 06:18:42,385 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L163: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-08 06:18:42,385 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L321: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-08 06:18:42,385 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L182: havoc main_~node2__m2~0#1; [2025-03-08 06:18:42,385 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L521: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-08 06:18:42,385 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L579: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-08 06:18:42,385 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-08 06:18:42,385 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L200: havoc main_~node3__m3~0#1; [2025-03-08 06:18:42,405 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-03-08 06:18:42,405 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:18:42,413 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:18:42,414 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:18:42,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:18:42 BoogieIcfgContainer [2025-03-08 06:18:42,414 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:18:42,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:18:42,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:18:42,419 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:18:42,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:18:41" (1/3) ... [2025-03-08 06:18:42,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65ec55c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:18:42, skipping insertion in model container [2025-03-08 06:18:42,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:18:41" (2/3) ... [2025-03-08 06:18:42,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65ec55c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:18:42, skipping insertion in model container [2025-03-08 06:18:42,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:18:42" (3/3) ... [2025-03-08 06:18:42,423 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2025-03-08 06:18:42,433 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:18:42,435 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c that has 1 procedures, 105 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 06:18:42,484 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:18:42,494 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;@6d235190, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:18:42,494 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:18:42,498 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 103 states have (on average 1.6990291262135921) internal successors, (175), 104 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:42,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 06:18:42,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:42,502 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] [2025-03-08 06:18:42,503 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:18:42,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:42,506 INFO L85 PathProgramCache]: Analyzing trace with hash -62734157, now seen corresponding path program 1 times [2025-03-08 06:18:42,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:42,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308699545] [2025-03-08 06:18:42,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:42,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:42,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 06:18:42,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 06:18:42,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:42,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:42,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:18:42,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:42,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308699545] [2025-03-08 06:18:42,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308699545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:42,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:42,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:18:42,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816749331] [2025-03-08 06:18:42,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:42,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:18:42,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:42,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:18:42,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:42,827 INFO L87 Difference]: Start difference. First operand has 105 states, 103 states have (on average 1.6990291262135921) internal successors, (175), 104 states have internal predecessors, (175), 0 states have call successors, (0), 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.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:42,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:42,874 INFO L93 Difference]: Finished difference Result 245 states and 395 transitions. [2025-03-08 06:18:42,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:18:42,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-03-08 06:18:42,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:42,883 INFO L225 Difference]: With dead ends: 245 [2025-03-08 06:18:42,883 INFO L226 Difference]: Without dead ends: 161 [2025-03-08 06:18:42,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:42,887 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 121 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 364 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-03-08 06:18:42,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 364 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:42,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-08 06:18:42,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2025-03-08 06:18:42,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.5) internal successors, (237), 158 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:42,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 237 transitions. [2025-03-08 06:18:42,915 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 237 transitions. Word has length 48 [2025-03-08 06:18:42,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:42,915 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 237 transitions. [2025-03-08 06:18:42,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 237 transitions. [2025-03-08 06:18:42,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 06:18:42,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:42,916 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-03-08 06:18:42,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:18:42,916 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:18:42,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:42,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1472290641, now seen corresponding path program 1 times [2025-03-08 06:18:42,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:42,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183300403] [2025-03-08 06:18:42,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:42,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:42,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 06:18:42,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 06:18:42,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:42,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:43,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:18:43,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:43,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183300403] [2025-03-08 06:18:43,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183300403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:43,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:43,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:18:43,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422812152] [2025-03-08 06:18:43,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:43,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:18:43,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:43,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:18:43,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:43,045 INFO L87 Difference]: Start difference. First operand 159 states and 237 transitions. 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-03-08 06:18:43,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:43,072 INFO L93 Difference]: Finished difference Result 391 states and 605 transitions. [2025-03-08 06:18:43,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:18:43,073 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-03-08 06:18:43,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:43,074 INFO L225 Difference]: With dead ends: 391 [2025-03-08 06:18:43,074 INFO L226 Difference]: Without dead ends: 259 [2025-03-08 06:18:43,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:43,075 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 98 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 307 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-03-08 06:18:43,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 307 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:43,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-08 06:18:43,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2025-03-08 06:18:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.53125) internal successors, (392), 256 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:43,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 392 transitions. [2025-03-08 06:18:43,091 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 392 transitions. Word has length 49 [2025-03-08 06:18:43,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:43,091 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 392 transitions. [2025-03-08 06:18:43,091 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-03-08 06:18:43,091 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 392 transitions. [2025-03-08 06:18:43,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 06:18:43,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:43,092 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-03-08 06:18:43,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:18:43,092 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:18:43,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:43,094 INFO L85 PathProgramCache]: Analyzing trace with hash 114727245, now seen corresponding path program 1 times [2025-03-08 06:18:43,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:43,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994779242] [2025-03-08 06:18:43,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:43,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:43,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 06:18:43,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 06:18:43,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:43,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:43,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:18:43,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:43,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994779242] [2025-03-08 06:18:43,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994779242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:43,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:43,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:18:43,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266517842] [2025-03-08 06:18:43,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:43,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:18:43,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:43,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:18:43,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:43,191 INFO L87 Difference]: Start difference. First operand 257 states and 392 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-03-08 06:18:43,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:43,238 INFO L93 Difference]: Finished difference Result 653 states and 1018 transitions. [2025-03-08 06:18:43,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:18:43,239 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-03-08 06:18:43,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:43,241 INFO L225 Difference]: With dead ends: 653 [2025-03-08 06:18:43,241 INFO L226 Difference]: Without dead ends: 423 [2025-03-08 06:18:43,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:43,242 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 93 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 292 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-03-08 06:18:43,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 292 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:43,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-08 06:18:43,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2025-03-08 06:18:43,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.542857142857143) internal successors, (648), 420 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:43,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 648 transitions. [2025-03-08 06:18:43,264 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 648 transitions. Word has length 50 [2025-03-08 06:18:43,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:43,265 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 648 transitions. [2025-03-08 06:18:43,265 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-03-08 06:18:43,265 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 648 transitions. [2025-03-08 06:18:43,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 06:18:43,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:43,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:18:43,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:18:43,266 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:18:43,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:43,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1666261163, now seen corresponding path program 1 times [2025-03-08 06:18:43,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:43,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957352237] [2025-03-08 06:18:43,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:43,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:43,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 06:18:43,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 06:18:43,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:43,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:43,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:18:43,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:43,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957352237] [2025-03-08 06:18:43,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957352237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:43,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:43,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:18:43,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204160642] [2025-03-08 06:18:43,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:43,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:18:43,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:43,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:18:43,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:18:43,431 INFO L87 Difference]: Start difference. First operand 421 states and 648 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:43,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:43,562 INFO L93 Difference]: Finished difference Result 2391 states and 3753 transitions. [2025-03-08 06:18:43,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:18:43,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-08 06:18:43,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:43,572 INFO L225 Difference]: With dead ends: 2391 [2025-03-08 06:18:43,573 INFO L226 Difference]: Without dead ends: 1997 [2025-03-08 06:18:43,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:18:43,577 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 849 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:43,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1270 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:18:43,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2025-03-08 06:18:43,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 813. [2025-03-08 06:18:43,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 812 states have (on average 1.541871921182266) internal successors, (1252), 812 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:43,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1252 transitions. [2025-03-08 06:18:43,622 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1252 transitions. Word has length 51 [2025-03-08 06:18:43,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:43,622 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1252 transitions. [2025-03-08 06:18:43,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1252 transitions. [2025-03-08 06:18:43,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 06:18:43,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:43,624 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:18:43,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:18:43,624 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:18:43,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:43,625 INFO L85 PathProgramCache]: Analyzing trace with hash 115443869, now seen corresponding path program 1 times [2025-03-08 06:18:43,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:43,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285872055] [2025-03-08 06:18:43,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:43,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:43,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 06:18:43,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 06:18:43,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:43,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:43,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:18:43,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:43,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285872055] [2025-03-08 06:18:43,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285872055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:43,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:43,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:18:43,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32378957] [2025-03-08 06:18:43,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:43,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:18:43,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:43,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:18:43,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:18:43,809 INFO L87 Difference]: Start difference. First operand 813 states and 1252 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-03-08 06:18:43,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:43,884 INFO L93 Difference]: Finished difference Result 3549 states and 5480 transitions. [2025-03-08 06:18:43,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:18:43,885 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-03-08 06:18:43,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:43,893 INFO L225 Difference]: With dead ends: 3549 [2025-03-08 06:18:43,893 INFO L226 Difference]: Without dead ends: 2763 [2025-03-08 06:18:43,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:18:43,896 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 492 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:43,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 584 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:18:43,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2025-03-08 06:18:43,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2757. [2025-03-08 06:18:43,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2757 states, 2756 states have (on average 1.537010159651669) internal successors, (4236), 2756 states have internal predecessors, (4236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:43,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2757 states and 4236 transitions. [2025-03-08 06:18:43,952 INFO L78 Accepts]: Start accepts. Automaton has 2757 states and 4236 transitions. Word has length 52 [2025-03-08 06:18:43,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:43,953 INFO L471 AbstractCegarLoop]: Abstraction has 2757 states and 4236 transitions. [2025-03-08 06:18:43,953 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-03-08 06:18:43,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2757 states and 4236 transitions. [2025-03-08 06:18:43,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 06:18:43,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:43,955 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:18:43,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:18:43,955 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:18:43,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:43,955 INFO L85 PathProgramCache]: Analyzing trace with hash -2121890611, now seen corresponding path program 1 times [2025-03-08 06:18:43,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:43,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923667893] [2025-03-08 06:18:43,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:43,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:43,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 06:18:43,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 06:18:43,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:43,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:44,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:18:44,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:44,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923667893] [2025-03-08 06:18:44,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923667893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:44,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:44,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:18:44,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932871805] [2025-03-08 06:18:44,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:44,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:18:44,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:44,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:18:44,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:44,043 INFO L87 Difference]: Start difference. First operand 2757 states and 4236 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:44,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:44,089 INFO L93 Difference]: Finished difference Result 7513 states and 11502 transitions. [2025-03-08 06:18:44,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:18:44,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-08 06:18:44,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:44,104 INFO L225 Difference]: With dead ends: 7513 [2025-03-08 06:18:44,104 INFO L226 Difference]: Without dead ends: 4783 [2025-03-08 06:18:44,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:44,109 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 107 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 355 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-03-08 06:18:44,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 355 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:44,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4783 states. [2025-03-08 06:18:44,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4783 to 4781. [2025-03-08 06:18:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4781 states, 4780 states have (on average 1.512133891213389) internal successors, (7228), 4780 states have internal predecessors, (7228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:44,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4781 states to 4781 states and 7228 transitions. [2025-03-08 06:18:44,205 INFO L78 Accepts]: Start accepts. Automaton has 4781 states and 7228 transitions. Word has length 52 [2025-03-08 06:18:44,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:44,205 INFO L471 AbstractCegarLoop]: Abstraction has 4781 states and 7228 transitions. [2025-03-08 06:18:44,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:44,205 INFO L276 IsEmpty]: Start isEmpty. Operand 4781 states and 7228 transitions. [2025-03-08 06:18:44,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 06:18:44,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:44,206 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:18:44,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:18:44,206 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:18:44,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:44,207 INFO L85 PathProgramCache]: Analyzing trace with hash -724068193, now seen corresponding path program 1 times [2025-03-08 06:18:44,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:44,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202010461] [2025-03-08 06:18:44,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:44,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:44,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 06:18:44,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 06:18:44,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:44,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:44,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:18:44,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:44,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202010461] [2025-03-08 06:18:44,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202010461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:44,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:44,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:18:44,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730284791] [2025-03-08 06:18:44,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:44,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:18:44,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:44,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:18:44,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:18:44,459 INFO L87 Difference]: Start difference. First operand 4781 states and 7228 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:44,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:44,502 INFO L93 Difference]: Finished difference Result 5039 states and 7613 transitions. [2025-03-08 06:18:44,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:18:44,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-08 06:18:44,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:44,518 INFO L225 Difference]: With dead ends: 5039 [2025-03-08 06:18:44,519 INFO L226 Difference]: Without dead ends: 5037 [2025-03-08 06:18:44,522 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-03-08 06:18:44,523 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:44,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 561 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:44,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5037 states. [2025-03-08 06:18:44,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5037 to 5037. [2025-03-08 06:18:44,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5037 states, 5036 states have (on average 1.4861000794281176) internal successors, (7484), 5036 states have internal predecessors, (7484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:44,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5037 states to 5037 states and 7484 transitions. [2025-03-08 06:18:44,635 INFO L78 Accepts]: Start accepts. Automaton has 5037 states and 7484 transitions. Word has length 54 [2025-03-08 06:18:44,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:44,636 INFO L471 AbstractCegarLoop]: Abstraction has 5037 states and 7484 transitions. [2025-03-08 06:18:44,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:44,636 INFO L276 IsEmpty]: Start isEmpty. Operand 5037 states and 7484 transitions. [2025-03-08 06:18:44,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 06:18:44,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:44,637 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:18:44,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:18:44,637 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:18:44,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:44,637 INFO L85 PathProgramCache]: Analyzing trace with hash -966508887, now seen corresponding path program 1 times [2025-03-08 06:18:44,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:44,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355685368] [2025-03-08 06:18:44,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:44,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:44,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 06:18:44,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 06:18:44,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:44,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:44,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:18:44,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:44,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355685368] [2025-03-08 06:18:44,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355685368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:44,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:44,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:18:44,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242955490] [2025-03-08 06:18:44,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:44,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:18:44,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:44,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:18:44,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:44,700 INFO L87 Difference]: Start difference. First operand 5037 states and 7484 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:44,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:44,774 INFO L93 Difference]: Finished difference Result 12171 states and 18084 transitions. [2025-03-08 06:18:44,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:18:44,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-08 06:18:44,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:44,795 INFO L225 Difference]: With dead ends: 12171 [2025-03-08 06:18:44,795 INFO L226 Difference]: Without dead ends: 7161 [2025-03-08 06:18:44,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:44,801 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 83 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:44,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 262 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:44,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7161 states. [2025-03-08 06:18:44,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7161 to 7159. [2025-03-08 06:18:44,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7159 states, 7158 states have (on average 1.4766694607432245) internal successors, (10570), 7158 states have internal predecessors, (10570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:44,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7159 states to 7159 states and 10570 transitions. [2025-03-08 06:18:44,932 INFO L78 Accepts]: Start accepts. Automaton has 7159 states and 10570 transitions. Word has length 55 [2025-03-08 06:18:44,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:44,932 INFO L471 AbstractCegarLoop]: Abstraction has 7159 states and 10570 transitions. [2025-03-08 06:18:44,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:44,933 INFO L276 IsEmpty]: Start isEmpty. Operand 7159 states and 10570 transitions. [2025-03-08 06:18:44,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 06:18:44,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:44,936 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] [2025-03-08 06:18:44,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:18:44,937 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:18:44,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:44,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1599577625, now seen corresponding path program 1 times [2025-03-08 06:18:44,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:44,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121660103] [2025-03-08 06:18:44,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:44,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:44,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 06:18:44,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 06:18:44,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:44,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:45,139 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 06:18:45,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:45,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121660103] [2025-03-08 06:18:45,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121660103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:18:45,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791154664] [2025-03-08 06:18:45,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:45,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:18:45,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:18:45,142 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:18:45,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 06:18:45,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 06:18:45,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 06:18:45,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:45,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:45,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 06:18:45,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:18:45,793 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:18:45,794 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:18:46,366 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:18:46,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791154664] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:18:46,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:18:46,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 7] total 14 [2025-03-08 06:18:46,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22043804] [2025-03-08 06:18:46,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:18:46,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 06:18:46,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:46,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 06:18:46,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:18:46,369 INFO L87 Difference]: Start difference. First operand 7159 states and 10570 transitions. Second operand has 14 states, 14 states have (on average 14.214285714285714) internal successors, (199), 14 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:47,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:47,000 INFO L93 Difference]: Finished difference Result 22190 states and 32670 transitions. [2025-03-08 06:18:47,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:18:47,001 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 14.214285714285714) internal successors, (199), 14 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-08 06:18:47,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:47,029 INFO L225 Difference]: With dead ends: 22190 [2025-03-08 06:18:47,029 INFO L226 Difference]: Without dead ends: 15060 [2025-03-08 06:18:47,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=237, Invalid=519, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:18:47,040 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 2194 mSDsluCounter, 1632 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2194 SdHoareTripleChecker+Valid, 1770 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:47,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2194 Valid, 1770 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:18:47,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15060 states. [2025-03-08 06:18:47,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15060 to 12362. [2025-03-08 06:18:47,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12362 states, 12361 states have (on average 1.463312029771054) internal successors, (18088), 12361 states have internal predecessors, (18088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:47,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12362 states to 12362 states and 18088 transitions. [2025-03-08 06:18:47,245 INFO L78 Accepts]: Start accepts. Automaton has 12362 states and 18088 transitions. Word has length 76 [2025-03-08 06:18:47,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:47,245 INFO L471 AbstractCegarLoop]: Abstraction has 12362 states and 18088 transitions. [2025-03-08 06:18:47,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 14.214285714285714) internal successors, (199), 14 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:47,246 INFO L276 IsEmpty]: Start isEmpty. Operand 12362 states and 18088 transitions. [2025-03-08 06:18:47,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:18:47,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:47,248 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] [2025-03-08 06:18:47,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 06:18:47,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:18:47,449 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:18:47,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:47,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1356918274, now seen corresponding path program 1 times [2025-03-08 06:18:47,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:47,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766523857] [2025-03-08 06:18:47,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:47,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:47,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:18:47,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:18:47,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:47,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:47,498 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:18:47,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:47,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766523857] [2025-03-08 06:18:47,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766523857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:47,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:47,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:18:47,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486257707] [2025-03-08 06:18:47,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:47,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:18:47,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:47,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:18:47,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:47,500 INFO L87 Difference]: Start difference. First operand 12362 states and 18088 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:47,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:47,554 INFO L93 Difference]: Finished difference Result 30928 states and 45233 transitions. [2025-03-08 06:18:47,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:18:47,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-08 06:18:47,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:47,590 INFO L225 Difference]: With dead ends: 30928 [2025-03-08 06:18:47,590 INFO L226 Difference]: Without dead ends: 21204 [2025-03-08 06:18:47,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:47,607 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 80 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 286 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-03-08 06:18:47,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 286 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:47,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21204 states. [2025-03-08 06:18:47,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21204 to 21202. [2025-03-08 06:18:47,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21202 states, 21201 states have (on average 1.4493655959624545) internal successors, (30728), 21201 states have internal predecessors, (30728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21202 states to 21202 states and 30728 transitions. [2025-03-08 06:18:47,917 INFO L78 Accepts]: Start accepts. Automaton has 21202 states and 30728 transitions. Word has length 77 [2025-03-08 06:18:47,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:47,918 INFO L471 AbstractCegarLoop]: Abstraction has 21202 states and 30728 transitions. [2025-03-08 06:18:47,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:47,918 INFO L276 IsEmpty]: Start isEmpty. Operand 21202 states and 30728 transitions. [2025-03-08 06:18:47,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:18:47,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:47,921 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] [2025-03-08 06:18:47,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:18:47,921 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:18:47,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:47,922 INFO L85 PathProgramCache]: Analyzing trace with hash 615711516, now seen corresponding path program 1 times [2025-03-08 06:18:47,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:47,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720264468] [2025-03-08 06:18:47,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:47,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:47,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:18:47,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:18:47,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:47,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:48,043 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:18:48,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:48,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720264468] [2025-03-08 06:18:48,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720264468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:48,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:48,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:18:48,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090074247] [2025-03-08 06:18:48,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:48,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:18:48,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:48,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:18:48,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:48,044 INFO L87 Difference]: Start difference. First operand 21202 states and 30728 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:48,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:48,134 INFO L93 Difference]: Finished difference Result 52678 states and 75994 transitions. [2025-03-08 06:18:48,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:18:48,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-08 06:18:48,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:48,195 INFO L225 Difference]: With dead ends: 52678 [2025-03-08 06:18:48,195 INFO L226 Difference]: Without dead ends: 34273 [2025-03-08 06:18:48,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:48,224 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 80 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 289 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-03-08 06:18:48,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 289 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:48,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34273 states. [2025-03-08 06:18:48,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34273 to 33511. [2025-03-08 06:18:48,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33511 states, 33510 states have (on average 1.4291853178155773) internal successors, (47892), 33510 states have internal predecessors, (47892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33511 states to 33511 states and 47892 transitions. [2025-03-08 06:18:48,893 INFO L78 Accepts]: Start accepts. Automaton has 33511 states and 47892 transitions. Word has length 77 [2025-03-08 06:18:48,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:48,893 INFO L471 AbstractCegarLoop]: Abstraction has 33511 states and 47892 transitions. [2025-03-08 06:18:48,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:48,893 INFO L276 IsEmpty]: Start isEmpty. Operand 33511 states and 47892 transitions. [2025-03-08 06:18:48,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:18:48,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:48,899 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] [2025-03-08 06:18:48,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:18:48,899 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:18:48,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:48,900 INFO L85 PathProgramCache]: Analyzing trace with hash 280999222, now seen corresponding path program 1 times [2025-03-08 06:18:48,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:48,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688115390] [2025-03-08 06:18:48,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:48,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:48,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:18:48,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:18:48,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:48,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:48,970 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:18:48,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:48,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688115390] [2025-03-08 06:18:48,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688115390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:48,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:48,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:18:48,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914578614] [2025-03-08 06:18:48,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:48,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:18:48,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:48,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:18:48,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:48,972 INFO L87 Difference]: Start difference. First operand 33511 states and 47892 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:49,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:49,139 INFO L93 Difference]: Finished difference Result 75589 states and 107266 transitions. [2025-03-08 06:18:49,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:18:49,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-08 06:18:49,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:49,230 INFO L225 Difference]: With dead ends: 75589 [2025-03-08 06:18:49,231 INFO L226 Difference]: Without dead ends: 50318 [2025-03-08 06:18:49,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:49,261 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 81 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 318 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-03-08 06:18:49,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 318 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:49,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50318 states. [2025-03-08 06:18:49,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50318 to 48968. [2025-03-08 06:18:49,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48968 states, 48967 states have (on average 1.4042518430779913) internal successors, (68762), 48967 states have internal predecessors, (68762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:49,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48968 states to 48968 states and 68762 transitions. [2025-03-08 06:18:49,924 INFO L78 Accepts]: Start accepts. Automaton has 48968 states and 68762 transitions. Word has length 77 [2025-03-08 06:18:49,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:49,924 INFO L471 AbstractCegarLoop]: Abstraction has 48968 states and 68762 transitions. [2025-03-08 06:18:49,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:49,924 INFO L276 IsEmpty]: Start isEmpty. Operand 48968 states and 68762 transitions. [2025-03-08 06:18:49,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:18:49,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:49,930 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] [2025-03-08 06:18:49,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:18:49,930 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:18:49,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:49,930 INFO L85 PathProgramCache]: Analyzing trace with hash -321026992, now seen corresponding path program 1 times [2025-03-08 06:18:49,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:49,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876364422] [2025-03-08 06:18:49,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:49,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:49,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:18:49,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:18:49,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:49,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 06:18:50,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:50,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876364422] [2025-03-08 06:18:50,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876364422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:50,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:50,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:18:50,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025026265] [2025-03-08 06:18:50,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:50,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:18:50,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:50,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:18:50,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:18:50,154 INFO L87 Difference]: Start difference. First operand 48968 states and 68762 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:50,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:50,535 INFO L93 Difference]: Finished difference Result 118345 states and 167375 transitions. [2025-03-08 06:18:50,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:18:50,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-08 06:18:50,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:50,765 INFO L225 Difference]: With dead ends: 118345 [2025-03-08 06:18:50,765 INFO L226 Difference]: Without dead ends: 103911 [2025-03-08 06:18:50,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:18:50,787 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 750 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:50,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 843 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:50,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103911 states. [2025-03-08 06:18:51,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103911 to 62998. [2025-03-08 06:18:51,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62998 states, 62997 states have (on average 1.3987650205565345) internal successors, (88118), 62997 states have internal predecessors, (88118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:52,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62998 states to 62998 states and 88118 transitions. [2025-03-08 06:18:52,010 INFO L78 Accepts]: Start accepts. Automaton has 62998 states and 88118 transitions. Word has length 77 [2025-03-08 06:18:52,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:52,011 INFO L471 AbstractCegarLoop]: Abstraction has 62998 states and 88118 transitions. [2025-03-08 06:18:52,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:52,011 INFO L276 IsEmpty]: Start isEmpty. Operand 62998 states and 88118 transitions. [2025-03-08 06:18:52,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:18:52,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:52,017 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] [2025-03-08 06:18:52,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:18:52,018 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:18:52,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:52,018 INFO L85 PathProgramCache]: Analyzing trace with hash -29916102, now seen corresponding path program 1 times [2025-03-08 06:18:52,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:52,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273385923] [2025-03-08 06:18:52,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:52,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:52,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:18:52,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:18:52,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:52,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:52,148 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 06:18:52,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:52,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273385923] [2025-03-08 06:18:52,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273385923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:52,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:52,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:18:52,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528981909] [2025-03-08 06:18:52,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:52,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:18:52,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:52,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:18:52,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:18:52,150 INFO L87 Difference]: Start difference. First operand 62998 states and 88118 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:52,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:52,542 INFO L93 Difference]: Finished difference Result 136585 states and 192847 transitions. [2025-03-08 06:18:52,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:18:52,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-08 06:18:52,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:52,709 INFO L225 Difference]: With dead ends: 136585 [2025-03-08 06:18:52,709 INFO L226 Difference]: Without dead ends: 117719 [2025-03-08 06:18:52,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:18:52,757 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 689 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:52,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 916 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:18:52,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117719 states. [2025-03-08 06:18:54,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117719 to 81495. [2025-03-08 06:18:54,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81495 states, 81494 states have (on average 1.396789947726213) internal successors, (113830), 81494 states have internal predecessors, (113830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:54,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81495 states to 81495 states and 113830 transitions. [2025-03-08 06:18:54,347 INFO L78 Accepts]: Start accepts. Automaton has 81495 states and 113830 transitions. Word has length 77 [2025-03-08 06:18:54,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:54,347 INFO L471 AbstractCegarLoop]: Abstraction has 81495 states and 113830 transitions. [2025-03-08 06:18:54,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:54,347 INFO L276 IsEmpty]: Start isEmpty. Operand 81495 states and 113830 transitions. [2025-03-08 06:18:54,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:18:54,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:54,352 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] [2025-03-08 06:18:54,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:18:54,353 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:18:54,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:54,353 INFO L85 PathProgramCache]: Analyzing trace with hash 957334940, now seen corresponding path program 1 times [2025-03-08 06:18:54,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:54,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725327625] [2025-03-08 06:18:54,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:54,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:54,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:18:54,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:18:54,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:54,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:54,477 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 06:18:54,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:54,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725327625] [2025-03-08 06:18:54,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725327625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:54,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:54,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:18:54,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906193627] [2025-03-08 06:18:54,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:54,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:18:54,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:54,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:18:54,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:18:54,480 INFO L87 Difference]: Start difference. First operand 81495 states and 113830 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:54,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:54,833 INFO L93 Difference]: Finished difference Result 157735 states and 222339 transitions. [2025-03-08 06:18:54,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:18:54,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-08 06:18:54,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:54,990 INFO L225 Difference]: With dead ends: 157735 [2025-03-08 06:18:54,991 INFO L226 Difference]: Without dead ends: 136041 [2025-03-08 06:18:55,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:18:55,044 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 736 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:55,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 962 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:55,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136041 states. [2025-03-08 06:18:56,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136041 to 99410. [2025-03-08 06:18:56,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99410 states, 99409 states have (on average 1.3973181502680845) internal successors, (138906), 99409 states have internal predecessors, (138906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:56,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99410 states to 99410 states and 138906 transitions. [2025-03-08 06:18:56,726 INFO L78 Accepts]: Start accepts. Automaton has 99410 states and 138906 transitions. Word has length 77 [2025-03-08 06:18:56,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:56,727 INFO L471 AbstractCegarLoop]: Abstraction has 99410 states and 138906 transitions. [2025-03-08 06:18:56,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:56,727 INFO L276 IsEmpty]: Start isEmpty. Operand 99410 states and 138906 transitions. [2025-03-08 06:18:56,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 06:18:56,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:56,732 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] [2025-03-08 06:18:56,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:18:56,732 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:18:56,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:56,733 INFO L85 PathProgramCache]: Analyzing trace with hash 131428606, now seen corresponding path program 1 times [2025-03-08 06:18:56,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:56,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337364265] [2025-03-08 06:18:56,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:56,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:56,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:18:56,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:18:56,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:56,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:56,901 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 06:18:56,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:56,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337364265] [2025-03-08 06:18:56,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337364265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:56,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:56,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:18:56,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198134999] [2025-03-08 06:18:56,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:56,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:18:56,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:56,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:18:56,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:18:56,903 INFO L87 Difference]: Start difference. First operand 99410 states and 138906 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-03-08 06:18:57,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:57,569 INFO L93 Difference]: Finished difference Result 180751 states and 254345 transitions. [2025-03-08 06:18:57,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:18:57,569 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 78 [2025-03-08 06:18:57,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:57,834 INFO L225 Difference]: With dead ends: 180751 [2025-03-08 06:18:57,834 INFO L226 Difference]: Without dead ends: 157458 [2025-03-08 06:18:57,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:18:57,884 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 732 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:57,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 871 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:58,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157458 states. [2025-03-08 06:18:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157458 to 114549. [2025-03-08 06:18:59,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114549 states, 114548 states have (on average 1.39783322275378) internal successors, (160119), 114548 states have internal predecessors, (160119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:59,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114549 states to 114549 states and 160119 transitions. [2025-03-08 06:18:59,623 INFO L78 Accepts]: Start accepts. Automaton has 114549 states and 160119 transitions. Word has length 78 [2025-03-08 06:18:59,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:59,623 INFO L471 AbstractCegarLoop]: Abstraction has 114549 states and 160119 transitions. [2025-03-08 06:18:59,623 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-03-08 06:18:59,623 INFO L276 IsEmpty]: Start isEmpty. Operand 114549 states and 160119 transitions. [2025-03-08 06:18:59,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 06:18:59,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:59,629 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-03-08 06:18:59,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:18:59,630 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:18:59,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:59,631 INFO L85 PathProgramCache]: Analyzing trace with hash 525245519, now seen corresponding path program 1 times [2025-03-08 06:18:59,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:59,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955662508] [2025-03-08 06:18:59,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:59,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:59,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 06:18:59,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 06:18:59,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:59,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:59,694 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:18:59,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:59,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955662508] [2025-03-08 06:18:59,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955662508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:59,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:59,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:18:59,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687764158] [2025-03-08 06:18:59,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:59,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:18:59,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:59,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:18:59,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:59,696 INFO L87 Difference]: Start difference. First operand 114549 states and 160119 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-03-08 06:19:00,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:00,327 INFO L93 Difference]: Finished difference Result 203036 states and 282548 transitions. [2025-03-08 06:19:00,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:19:00,328 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-03-08 06:19:00,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:00,498 INFO L225 Difference]: With dead ends: 203036 [2025-03-08 06:19:00,498 INFO L226 Difference]: Without dead ends: 116755 [2025-03-08 06:19:00,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:19:00,547 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 81 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 355 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-03-08 06:19:00,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 355 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:19:00,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116755 states. [2025-03-08 06:19:02,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116755 to 106817. [2025-03-08 06:19:02,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106817 states, 106816 states have (on average 1.3858878819652487) internal successors, (148035), 106816 states have internal predecessors, (148035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:02,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106817 states to 106817 states and 148035 transitions. [2025-03-08 06:19:02,304 INFO L78 Accepts]: Start accepts. Automaton has 106817 states and 148035 transitions. Word has length 80 [2025-03-08 06:19:02,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:02,304 INFO L471 AbstractCegarLoop]: Abstraction has 106817 states and 148035 transitions. [2025-03-08 06:19:02,304 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-03-08 06:19:02,304 INFO L276 IsEmpty]: Start isEmpty. Operand 106817 states and 148035 transitions. [2025-03-08 06:19:02,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 06:19:02,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:02,310 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] [2025-03-08 06:19:02,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:19:02,310 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:02,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:02,311 INFO L85 PathProgramCache]: Analyzing trace with hash 248366673, now seen corresponding path program 1 times [2025-03-08 06:19:02,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:02,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436168611] [2025-03-08 06:19:02,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:02,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:02,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 06:19:02,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 06:19:02,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:02,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:02,538 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:02,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:02,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436168611] [2025-03-08 06:19:02,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436168611] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:19:02,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091279494] [2025-03-08 06:19:02,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:02,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:19:02,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:19:02,541 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:19:02,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 06:19:02,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 06:19:02,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 06:19:02,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:02,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:02,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 06:19:02,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:19:02,819 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:02,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:19:02,909 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:02,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091279494] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:19:02,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:19:02,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-08 06:19:02,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123066893] [2025-03-08 06:19:02,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:19:02,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:19:02,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:02,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:19:02,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:19:02,911 INFO L87 Difference]: Start difference. First operand 106817 states and 148035 transitions. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 10 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:03,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:03,717 INFO L93 Difference]: Finished difference Result 262310 states and 365205 transitions. [2025-03-08 06:19:03,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:19:03,718 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 10 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-08 06:19:03,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:03,945 INFO L225 Difference]: With dead ends: 262310 [2025-03-08 06:19:03,945 INFO L226 Difference]: Without dead ends: 170409 [2025-03-08 06:19:04,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 154 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-08 06:19:04,015 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 864 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:04,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 489 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:19:04,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170409 states. [2025-03-08 06:19:05,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170409 to 121011. [2025-03-08 06:19:05,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121011 states, 121010 states have (on average 1.387149822328733) internal successors, (167859), 121010 states have internal predecessors, (167859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:06,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121011 states to 121011 states and 167859 transitions. [2025-03-08 06:19:06,004 INFO L78 Accepts]: Start accepts. Automaton has 121011 states and 167859 transitions. Word has length 82 [2025-03-08 06:19:06,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:06,004 INFO L471 AbstractCegarLoop]: Abstraction has 121011 states and 167859 transitions. [2025-03-08 06:19:06,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 10 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:06,005 INFO L276 IsEmpty]: Start isEmpty. Operand 121011 states and 167859 transitions. [2025-03-08 06:19:06,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 06:19:06,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:06,011 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] [2025-03-08 06:19:06,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 06:19:06,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 06:19:06,212 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:06,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:06,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1170751313, now seen corresponding path program 1 times [2025-03-08 06:19:06,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:06,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115120571] [2025-03-08 06:19:06,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:06,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:06,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 06:19:06,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 06:19:06,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:06,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:06,356 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:06,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:06,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115120571] [2025-03-08 06:19:06,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115120571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:19:06,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327825917] [2025-03-08 06:19:06,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:06,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:19:06,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:19:06,359 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:19:06,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 06:19:06,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 06:19:06,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 06:19:06,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:06,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:06,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 06:19:06,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:19:06,799 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:06,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:19:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:06,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327825917] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:19:06,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:19:06,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-08 06:19:06,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266854603] [2025-03-08 06:19:06,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:19:06,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:19:06,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:06,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:19:06,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:19:06,936 INFO L87 Difference]: Start difference. First operand 121011 states and 167859 transitions. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 10 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:07,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:07,959 INFO L93 Difference]: Finished difference Result 280814 states and 391472 transitions. [2025-03-08 06:19:07,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:19:07,959 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 10 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-08 06:19:07,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:08,189 INFO L225 Difference]: With dead ends: 280814 [2025-03-08 06:19:08,189 INFO L226 Difference]: Without dead ends: 167017 [2025-03-08 06:19:08,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 154 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-08 06:19:08,278 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 1980 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1980 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:08,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1980 Valid, 411 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:19:08,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167017 states. [2025-03-08 06:19:09,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167017 to 120787. [2025-03-08 06:19:09,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120787 states, 120786 states have (on average 1.3916679085324457) internal successors, (168094), 120786 states have internal predecessors, (168094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:10,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120787 states to 120787 states and 168094 transitions. [2025-03-08 06:19:10,060 INFO L78 Accepts]: Start accepts. Automaton has 120787 states and 168094 transitions. Word has length 82 [2025-03-08 06:19:10,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:10,061 INFO L471 AbstractCegarLoop]: Abstraction has 120787 states and 168094 transitions. [2025-03-08 06:19:10,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 10 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:10,061 INFO L276 IsEmpty]: Start isEmpty. Operand 120787 states and 168094 transitions. [2025-03-08 06:19:10,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 06:19:10,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:10,069 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-03-08 06:19:10,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 06:19:10,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:19:10,269 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:10,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:10,270 INFO L85 PathProgramCache]: Analyzing trace with hash -947171059, now seen corresponding path program 1 times [2025-03-08 06:19:10,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:10,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46153060] [2025-03-08 06:19:10,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:10,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:10,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 06:19:10,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 06:19:10,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:10,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:10,619 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:10,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:10,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46153060] [2025-03-08 06:19:10,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46153060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:19:10,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52053385] [2025-03-08 06:19:10,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:10,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:19:10,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:19:10,621 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:19:10,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 06:19:10,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 06:19:10,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 06:19:10,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:10,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:10,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 06:19:10,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:19:10,948 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:10,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:19:11,054 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:11,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52053385] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:19:11,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:19:11,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-08 06:19:11,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357652548] [2025-03-08 06:19:11,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:19:11,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:19:11,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:11,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:19:11,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:19:11,056 INFO L87 Difference]: Start difference. First operand 120787 states and 168094 transitions. Second operand has 11 states, 11 states have (on average 13.090909090909092) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:11,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:11,921 INFO L93 Difference]: Finished difference Result 253485 states and 353210 transitions. [2025-03-08 06:19:11,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:19:11,922 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.090909090909092) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 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-03-08 06:19:11,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:12,150 INFO L225 Difference]: With dead ends: 253485 [2025-03-08 06:19:12,150 INFO L226 Difference]: Without dead ends: 168874 [2025-03-08 06:19:12,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 156 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-08 06:19:12,221 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 569 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:12,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 434 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:19:12,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168874 states. [2025-03-08 06:19:13,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168874 to 136861. [2025-03-08 06:19:13,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136861 states, 136860 states have (on average 1.3854595937454333) internal successors, (189614), 136860 states have internal predecessors, (189614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:14,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136861 states to 136861 states and 189614 transitions. [2025-03-08 06:19:14,216 INFO L78 Accepts]: Start accepts. Automaton has 136861 states and 189614 transitions. Word has length 83 [2025-03-08 06:19:14,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:14,216 INFO L471 AbstractCegarLoop]: Abstraction has 136861 states and 189614 transitions. [2025-03-08 06:19:14,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.090909090909092) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:14,216 INFO L276 IsEmpty]: Start isEmpty. Operand 136861 states and 189614 transitions. [2025-03-08 06:19:14,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 06:19:14,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:14,223 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-03-08 06:19:14,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 06:19:14,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:19:14,431 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:14,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:14,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1779499687, now seen corresponding path program 1 times [2025-03-08 06:19:14,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:14,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315808672] [2025-03-08 06:19:14,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:14,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:14,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 06:19:14,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 06:19:14,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:14,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:14,508 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:14,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:14,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315808672] [2025-03-08 06:19:14,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315808672] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:19:14,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591527925] [2025-03-08 06:19:14,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:14,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:19:14,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:19:14,511 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:19:14,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 06:19:14,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 06:19:14,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 06:19:14,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:14,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:14,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 06:19:14,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:19:14,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:14,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:19:14,884 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:14,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591527925] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:19:14,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:19:14,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-08 06:19:14,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373165501] [2025-03-08 06:19:14,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:19:14,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:19:14,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:14,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:19:14,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:19:14,887 INFO L87 Difference]: Start difference. First operand 136861 states and 189614 transitions. Second operand has 11 states, 11 states have (on average 12.818181818181818) internal successors, (141), 10 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:15,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:15,930 INFO L93 Difference]: Finished difference Result 289693 states and 400709 transitions. [2025-03-08 06:19:15,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:19:15,930 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.818181818181818) internal successors, (141), 10 states have internal predecessors, (141), 0 states have call successors, (0), 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-03-08 06:19:15,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:16,109 INFO L225 Difference]: With dead ends: 289693 [2025-03-08 06:19:16,109 INFO L226 Difference]: Without dead ends: 158255 [2025-03-08 06:19:16,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 156 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-08 06:19:16,192 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 1036 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:16,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 294 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:19:16,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158255 states. [2025-03-08 06:19:17,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158255 to 138606. [2025-03-08 06:19:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138606 states, 138605 states have (on average 1.3807438404097976) internal successors, (191378), 138605 states have internal predecessors, (191378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:18,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138606 states to 138606 states and 191378 transitions. [2025-03-08 06:19:18,003 INFO L78 Accepts]: Start accepts. Automaton has 138606 states and 191378 transitions. Word has length 83 [2025-03-08 06:19:18,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:18,004 INFO L471 AbstractCegarLoop]: Abstraction has 138606 states and 191378 transitions. [2025-03-08 06:19:18,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.818181818181818) internal successors, (141), 10 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:18,004 INFO L276 IsEmpty]: Start isEmpty. Operand 138606 states and 191378 transitions. [2025-03-08 06:19:18,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 06:19:18,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:18,012 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:19:18,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 06:19:18,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:19:18,213 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:18,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:18,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1632949331, now seen corresponding path program 1 times [2025-03-08 06:19:18,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:18,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986922502] [2025-03-08 06:19:18,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:18,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:18,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 06:19:18,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 06:19:18,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:18,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:18,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:18,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:18,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986922502] [2025-03-08 06:19:18,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986922502] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:19:18,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691167439] [2025-03-08 06:19:18,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:18,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:19:18,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:19:18,711 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:19:18,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 06:19:18,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 06:19:18,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 06:19:18,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:18,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:18,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 06:19:18,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:19:19,102 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:19,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:19:19,691 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:19,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691167439] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:19:19,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:19:19,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-08 06:19:19,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292930719] [2025-03-08 06:19:19,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:19:19,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 06:19:19,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:19,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 06:19:19,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:19:19,693 INFO L87 Difference]: Start difference. First operand 138606 states and 191378 transitions. Second operand has 21 states, 21 states have (on average 9.19047619047619) internal successors, (193), 20 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:21,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:21,724 INFO L93 Difference]: Finished difference Result 597991 states and 821908 transitions. [2025-03-08 06:19:21,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 06:19:21,725 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.19047619047619) internal successors, (193), 20 states have internal predecessors, (193), 0 states have call successors, (0), 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 84 [2025-03-08 06:19:21,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:22,902 INFO L225 Difference]: With dead ends: 597991 [2025-03-08 06:19:22,902 INFO L226 Difference]: Without dead ends: 459684 [2025-03-08 06:19:22,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=382, Invalid=1178, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 06:19:22,991 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1632 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1632 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:22,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1632 Valid, 1080 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:19:23,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459684 states. [2025-03-08 06:19:26,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459684 to 278253. [2025-03-08 06:19:26,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278253 states, 278252 states have (on average 1.371062921380619) internal successors, (381501), 278252 states have internal predecessors, (381501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:27,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278253 states to 278253 states and 381501 transitions. [2025-03-08 06:19:27,336 INFO L78 Accepts]: Start accepts. Automaton has 278253 states and 381501 transitions. Word has length 84 [2025-03-08 06:19:27,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:27,337 INFO L471 AbstractCegarLoop]: Abstraction has 278253 states and 381501 transitions. [2025-03-08 06:19:27,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.19047619047619) internal successors, (193), 20 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:27,337 INFO L276 IsEmpty]: Start isEmpty. Operand 278253 states and 381501 transitions. [2025-03-08 06:19:27,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 06:19:27,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:27,348 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:19:27,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 06:19:27,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:19:27,549 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:27,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:27,549 INFO L85 PathProgramCache]: Analyzing trace with hash 61297675, now seen corresponding path program 1 times [2025-03-08 06:19:27,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:27,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890776767] [2025-03-08 06:19:27,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:27,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:28,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 06:19:28,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 06:19:28,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:28,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:28,372 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:28,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:28,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890776767] [2025-03-08 06:19:28,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890776767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:19:28,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306176113] [2025-03-08 06:19:28,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:28,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:19:28,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:19:28,374 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:19:28,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 06:19:28,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 06:19:28,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 06:19:28,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:28,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:28,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 06:19:28,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:19:29,633 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:29,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:19:30,948 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:30,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306176113] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:19:30,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:19:30,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 17] total 38 [2025-03-08 06:19:30,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842648649] [2025-03-08 06:19:30,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:19:30,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-08 06:19:30,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:30,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-08 06:19:30,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1248, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 06:19:30,950 INFO L87 Difference]: Start difference. First operand 278253 states and 381501 transitions. Second operand has 39 states, 39 states have (on average 5.538461538461538) internal successors, (216), 38 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)