./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f7a5a1c3d43a07fad050d83cae91745968fcd759f4b97582e892f295162805b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:42:33,162 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:42:33,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:42:33,234 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:42:33,234 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:42:33,267 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:42:33,268 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:42:33,269 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:42:33,269 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:42:33,269 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:42:33,270 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:42:33,270 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:42:33,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:42:33,271 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:42:33,271 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:42:33,271 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:42:33,271 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:42:33,271 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:42:33,271 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:42:33,272 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:42:33,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:42:33,272 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:42:33,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:42:33,272 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:42:33,272 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:42:33,272 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:42:33,272 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:42:33,273 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:42:33,273 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:42:33,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:42:33,273 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:42:33,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:42:33,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:42:33,274 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:42:33,274 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:42:33,274 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:42:33,274 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:42:33,274 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:42:33,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:42:33,274 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:42:33,274 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:42:33,275 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:42:33,275 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:42:33,275 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7f7a5a1c3d43a07fad050d83cae91745968fcd759f4b97582e892f295162805b [2025-02-05 16:42:33,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:42:33,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:42:33,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:42:33,633 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:42:33,633 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:42:33,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-02-05 16:42:35,034 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4cd3c8fa/20e5180ee9884a13a3b78b532f25a9c1/FLAGc9dec2fff [2025-02-05 16:42:35,334 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:42:35,335 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-02-05 16:42:35,349 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4cd3c8fa/20e5180ee9884a13a3b78b532f25a9c1/FLAGc9dec2fff [2025-02-05 16:42:35,374 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4cd3c8fa/20e5180ee9884a13a3b78b532f25a9c1 [2025-02-05 16:42:35,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:42:35,378 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:42:35,379 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:42:35,379 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:42:35,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:42:35,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:42:35" (1/1) ... [2025-02-05 16:42:35,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c6a77e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:42:35, skipping insertion in model container [2025-02-05 16:42:35,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:42:35" (1/1) ... [2025-02-05 16:42:35,418 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:42:35,612 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[5805,5818] [2025-02-05 16:42:35,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:42:35,653 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:42:35,690 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[5805,5818] [2025-02-05 16:42:35,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:42:35,721 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:42:35,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:42:35 WrapperNode [2025-02-05 16:42:35,723 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:42:35,724 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:42:35,724 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:42:35,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:42:35,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:42:35" (1/1) ... [2025-02-05 16:42:35,738 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:42:35" (1/1) ... [2025-02-05 16:42:35,767 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 451 [2025-02-05 16:42:35,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:42:35,768 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:42:35,768 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:42:35,768 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:42:35,775 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:42:35" (1/1) ... [2025-02-05 16:42:35,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:42:35" (1/1) ... [2025-02-05 16:42:35,778 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:42:35" (1/1) ... [2025-02-05 16:42:35,803 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 16:42:35,805 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:42:35" (1/1) ... [2025-02-05 16:42:35,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:42:35" (1/1) ... [2025-02-05 16:42:35,815 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:42:35" (1/1) ... [2025-02-05 16:42:35,821 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:42:35" (1/1) ... [2025-02-05 16:42:35,822 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:42:35" (1/1) ... [2025-02-05 16:42:35,823 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:42:35" (1/1) ... [2025-02-05 16:42:35,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:42:35,831 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:42:35,831 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:42:35,832 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:42:35,833 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:42:35" (1/1) ... [2025-02-05 16:42:35,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:42:35,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:42:35,868 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:42:35,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:42:35,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:42:35,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:42:35,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:42:35,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:42:36,017 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:42:36,019 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:42:36,489 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L490: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:42:36,489 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L201: havoc main_~node2__m2~0#1; [2025-02-05 16:42:36,490 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L540: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:42:36,490 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L400: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-02-05 16:42:36,490 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L286: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:42:36,490 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L246: havoc main_~node5__m5~0#1; [2025-02-05 16:42:36,490 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L445: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:42:36,491 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:42:36,491 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L231: havoc main_~node4__m4~0#1; [2025-02-05 16:42:36,491 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L355: havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-02-05 16:42:36,491 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L216: havoc main_~node3__m3~0#1; [2025-02-05 16:42:36,522 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-02-05 16:42:36,522 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:42:36,536 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:42:36,538 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:42:36,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:42:36 BoogieIcfgContainer [2025-02-05 16:42:36,539 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:42:36,541 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:42:36,541 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:42:36,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:42:36,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:42:35" (1/3) ... [2025-02-05 16:42:36,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e724363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:42:36, skipping insertion in model container [2025-02-05 16:42:36,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:42:35" (2/3) ... [2025-02-05 16:42:36,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e724363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:42:36, skipping insertion in model container [2025-02-05 16:42:36,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:42:36" (3/3) ... [2025-02-05 16:42:36,549 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-02-05 16:42:36,563 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:42:36,565 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 99 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:42:36,622 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:42:36,635 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;@5ed9a607, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:42:36,635 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:42:36,639 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 97 states have (on average 1.7216494845360826) internal successors, (167), 98 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:36,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 16:42:36,651 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:36,652 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:36,653 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:42:36,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:36,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1987767872, now seen corresponding path program 1 times [2025-02-05 16:42:36,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:36,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752476456] [2025-02-05 16:42:36,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:36,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:36,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 16:42:36,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 16:42:36,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:36,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:37,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:37,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:37,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752476456] [2025-02-05 16:42:37,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752476456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:37,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:37,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:42:37,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059801092] [2025-02-05 16:42:37,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:37,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:42:37,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:37,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:42:37,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:37,154 INFO L87 Difference]: Start difference. First operand has 99 states, 97 states have (on average 1.7216494845360826) internal successors, (167), 98 states have internal predecessors, (167), 0 states have call successors, (0), 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 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:37,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:37,217 INFO L93 Difference]: Finished difference Result 221 states and 356 transitions. [2025-02-05 16:42:37,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:42:37,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-02-05 16:42:37,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:37,228 INFO L225 Difference]: With dead ends: 221 [2025-02-05 16:42:37,229 INFO L226 Difference]: Without dead ends: 150 [2025-02-05 16:42:37,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:37,235 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 108 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:37,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 337 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:42:37,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-02-05 16:42:37,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2025-02-05 16:42:37,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.4625850340136055) internal successors, (215), 147 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:37,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 215 transitions. [2025-02-05 16:42:37,282 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 215 transitions. Word has length 60 [2025-02-05 16:42:37,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:37,283 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 215 transitions. [2025-02-05 16:42:37,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:37,283 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 215 transitions. [2025-02-05 16:42:37,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 16:42:37,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:37,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:37,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:42:37,287 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:42:37,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:37,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1868022726, now seen corresponding path program 1 times [2025-02-05 16:42:37,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:37,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146972653] [2025-02-05 16:42:37,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:37,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:37,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 16:42:37,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 16:42:37,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:37,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:37,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:37,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:37,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146972653] [2025-02-05 16:42:37,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146972653] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:37,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:37,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:42:37,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033872374] [2025-02-05 16:42:37,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:37,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:42:37,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:37,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:42:37,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:37,490 INFO L87 Difference]: Start difference. First operand 148 states and 215 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:37,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:37,532 INFO L93 Difference]: Finished difference Result 360 states and 551 transitions. [2025-02-05 16:42:37,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:42:37,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-02-05 16:42:37,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:37,537 INFO L225 Difference]: With dead ends: 360 [2025-02-05 16:42:37,538 INFO L226 Difference]: Without dead ends: 246 [2025-02-05 16:42:37,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:37,540 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 78 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:37,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 287 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:42:37,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-02-05 16:42:37,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2025-02-05 16:42:37,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.5102880658436213) internal successors, (367), 243 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:37,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 367 transitions. [2025-02-05 16:42:37,565 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 367 transitions. Word has length 61 [2025-02-05 16:42:37,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:37,565 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 367 transitions. [2025-02-05 16:42:37,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:37,566 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 367 transitions. [2025-02-05 16:42:37,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 16:42:37,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:37,567 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:37,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:42:37,567 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:42:37,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:37,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1363346003, now seen corresponding path program 1 times [2025-02-05 16:42:37,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:37,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124100206] [2025-02-05 16:42:37,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:37,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:37,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:42:37,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:42:37,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:37,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:37,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:37,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:37,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124100206] [2025-02-05 16:42:37,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124100206] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:37,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:37,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:42:37,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063770871] [2025-02-05 16:42:37,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:37,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:42:37,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:37,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:42:37,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:37,764 INFO L87 Difference]: Start difference. First operand 244 states and 367 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:37,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:37,800 INFO L93 Difference]: Finished difference Result 632 states and 981 transitions. [2025-02-05 16:42:37,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:42:37,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-02-05 16:42:37,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:37,806 INFO L225 Difference]: With dead ends: 632 [2025-02-05 16:42:37,808 INFO L226 Difference]: Without dead ends: 422 [2025-02-05 16:42:37,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:37,812 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 73 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:37,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 283 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:42:37,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-02-05 16:42:37,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 420. [2025-02-05 16:42:37,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.5346062052505967) internal successors, (643), 419 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:37,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 643 transitions. [2025-02-05 16:42:37,830 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 643 transitions. Word has length 62 [2025-02-05 16:42:37,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:37,831 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 643 transitions. [2025-02-05 16:42:37,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:37,831 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 643 transitions. [2025-02-05 16:42:37,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:42:37,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:37,833 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:37,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:42:37,833 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:42:37,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:37,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1863214535, now seen corresponding path program 1 times [2025-02-05 16:42:37,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:37,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074419969] [2025-02-05 16:42:37,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:37,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:37,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:42:37,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:42:37,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:37,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:37,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:37,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:37,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074419969] [2025-02-05 16:42:37,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074419969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:37,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:37,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:42:37,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587400665] [2025-02-05 16:42:37,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:37,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:42:37,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:37,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:42:37,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:37,967 INFO L87 Difference]: Start difference. First operand 420 states and 643 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:37,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:37,997 INFO L93 Difference]: Finished difference Result 1128 states and 1757 transitions. [2025-02-05 16:42:38,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:42:38,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-02-05 16:42:38,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:38,004 INFO L225 Difference]: With dead ends: 1128 [2025-02-05 16:42:38,004 INFO L226 Difference]: Without dead ends: 742 [2025-02-05 16:42:38,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:38,006 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 68 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:38,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 279 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:42:38,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2025-02-05 16:42:38,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 740. [2025-02-05 16:42:38,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 1.5412719891745603) internal successors, (1139), 739 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:38,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1139 transitions. [2025-02-05 16:42:38,036 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1139 transitions. Word has length 63 [2025-02-05 16:42:38,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:38,037 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1139 transitions. [2025-02-05 16:42:38,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:38,038 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1139 transitions. [2025-02-05 16:42:38,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:42:38,041 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:38,041 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:38,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:42:38,041 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:42:38,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:38,042 INFO L85 PathProgramCache]: Analyzing trace with hash -584672614, now seen corresponding path program 1 times [2025-02-05 16:42:38,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:38,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733857954] [2025-02-05 16:42:38,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:38,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:38,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:42:38,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:42:38,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:38,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:38,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:38,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:38,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733857954] [2025-02-05 16:42:38,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733857954] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:38,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:38,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:42:38,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698540422] [2025-02-05 16:42:38,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:38,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:42:38,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:38,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:42:38,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:42:38,294 INFO L87 Difference]: Start difference. First operand 740 states and 1139 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:38,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:38,620 INFO L93 Difference]: Finished difference Result 7800 states and 12189 transitions. [2025-02-05 16:42:38,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 16:42:38,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-02-05 16:42:38,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:38,654 INFO L225 Difference]: With dead ends: 7800 [2025-02-05 16:42:38,655 INFO L226 Difference]: Without dead ends: 7094 [2025-02-05 16:42:38,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:42:38,660 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 986 mSDsluCounter, 2171 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 2299 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:38,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 2299 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:42:38,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7094 states. [2025-02-05 16:42:38,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7094 to 1444. [2025-02-05 16:42:38,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1443 states have (on average 1.5322245322245323) internal successors, (2211), 1443 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:38,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2211 transitions. [2025-02-05 16:42:38,787 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 2211 transitions. Word has length 64 [2025-02-05 16:42:38,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:38,788 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 2211 transitions. [2025-02-05 16:42:38,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:38,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 2211 transitions. [2025-02-05 16:42:38,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:42:38,791 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:38,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:38,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:42:38,791 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:42:38,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:38,792 INFO L85 PathProgramCache]: Analyzing trace with hash 809215235, now seen corresponding path program 1 times [2025-02-05 16:42:38,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:38,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539215] [2025-02-05 16:42:38,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:38,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:38,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:42:38,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:42:38,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:38,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:38,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:38,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:38,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539215] [2025-02-05 16:42:38,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539215] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:38,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:38,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:42:38,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373960640] [2025-02-05 16:42:38,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:38,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:42:38,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:38,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:42:38,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:38,949 INFO L87 Difference]: Start difference. First operand 1444 states and 2211 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:38,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:38,989 INFO L93 Difference]: Finished difference Result 4088 states and 6261 transitions. [2025-02-05 16:42:38,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:42:38,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-05 16:42:38,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:39,000 INFO L225 Difference]: With dead ends: 4088 [2025-02-05 16:42:39,001 INFO L226 Difference]: Without dead ends: 2678 [2025-02-05 16:42:39,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:39,007 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 58 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:39,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 220 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:42:39,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2678 states. [2025-02-05 16:42:39,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2678 to 2644. [2025-02-05 16:42:39,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2643 states have (on average 1.5024593265228907) internal successors, (3971), 2643 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:39,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3971 transitions. [2025-02-05 16:42:39,083 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3971 transitions. Word has length 66 [2025-02-05 16:42:39,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:39,084 INFO L471 AbstractCegarLoop]: Abstraction has 2644 states and 3971 transitions. [2025-02-05 16:42:39,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:39,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3971 transitions. [2025-02-05 16:42:39,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:42:39,087 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:39,087 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:39,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:42:39,088 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:42:39,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:39,088 INFO L85 PathProgramCache]: Analyzing trace with hash 810377084, now seen corresponding path program 1 times [2025-02-05 16:42:39,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:39,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109246707] [2025-02-05 16:42:39,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:39,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:39,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:42:39,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:42:39,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:39,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:39,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:39,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:39,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109246707] [2025-02-05 16:42:39,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109246707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:39,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:39,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:42:39,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049354100] [2025-02-05 16:42:39,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:39,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:42:39,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:39,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:42:39,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:42:39,445 INFO L87 Difference]: Start difference. First operand 2644 states and 3971 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:39,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:39,673 INFO L93 Difference]: Finished difference Result 5256 states and 7909 transitions. [2025-02-05 16:42:39,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:42:39,674 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-05 16:42:39,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:39,684 INFO L225 Difference]: With dead ends: 5256 [2025-02-05 16:42:39,685 INFO L226 Difference]: Without dead ends: 2646 [2025-02-05 16:42:39,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:42:39,690 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 86 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:39,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 601 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:42:39,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2646 states. [2025-02-05 16:42:39,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 2644. [2025-02-05 16:42:39,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2643 states have (on average 1.4903518728717366) internal successors, (3939), 2643 states have internal predecessors, (3939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:39,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3939 transitions. [2025-02-05 16:42:39,768 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3939 transitions. Word has length 66 [2025-02-05 16:42:39,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:39,768 INFO L471 AbstractCegarLoop]: Abstraction has 2644 states and 3939 transitions. [2025-02-05 16:42:39,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:39,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3939 transitions. [2025-02-05 16:42:39,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:42:39,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:39,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:39,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:42:39,769 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:42:39,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:39,770 INFO L85 PathProgramCache]: Analyzing trace with hash -647158865, now seen corresponding path program 1 times [2025-02-05 16:42:39,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:39,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315727386] [2025-02-05 16:42:39,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:39,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:39,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:42:39,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:42:39,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:39,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:40,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:40,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:40,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315727386] [2025-02-05 16:42:40,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315727386] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:40,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:40,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:42:40,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106225706] [2025-02-05 16:42:40,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:40,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:42:40,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:40,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:42:40,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:42:40,094 INFO L87 Difference]: Start difference. First operand 2644 states and 3939 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:40,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:40,130 INFO L93 Difference]: Finished difference Result 2710 states and 4036 transitions. [2025-02-05 16:42:40,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:42:40,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-05 16:42:40,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:40,142 INFO L225 Difference]: With dead ends: 2710 [2025-02-05 16:42:40,143 INFO L226 Difference]: Without dead ends: 2708 [2025-02-05 16:42:40,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:42:40,145 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 505 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-02-05 16:42:40,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 505 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:42:40,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2025-02-05 16:42:40,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2708. [2025-02-05 16:42:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2708 states, 2707 states have (on average 1.4728481714074622) internal successors, (3987), 2707 states have internal predecessors, (3987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:40,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 3987 transitions. [2025-02-05 16:42:40,209 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 3987 transitions. Word has length 67 [2025-02-05 16:42:40,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:40,210 INFO L471 AbstractCegarLoop]: Abstraction has 2708 states and 3987 transitions. [2025-02-05 16:42:40,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:40,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 3987 transitions. [2025-02-05 16:42:40,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:42:40,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:40,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:40,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:42:40,213 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:42:40,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:40,213 INFO L85 PathProgramCache]: Analyzing trace with hash 224761687, now seen corresponding path program 1 times [2025-02-05 16:42:40,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:40,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054031776] [2025-02-05 16:42:40,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:40,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:40,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:42:40,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:42:40,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:40,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:40,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:40,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:40,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054031776] [2025-02-05 16:42:40,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054031776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:40,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:40,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:42:40,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666164604] [2025-02-05 16:42:40,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:40,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:42:40,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:40,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:42:40,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:40,277 INFO L87 Difference]: Start difference. First operand 2708 states and 3987 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:40,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:40,312 INFO L93 Difference]: Finished difference Result 5339 states and 7929 transitions. [2025-02-05 16:42:40,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:42:40,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-05 16:42:40,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:40,346 INFO L225 Difference]: With dead ends: 5339 [2025-02-05 16:42:40,346 INFO L226 Difference]: Without dead ends: 3864 [2025-02-05 16:42:40,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:40,349 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 85 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:40,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 299 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:42:40,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3864 states. [2025-02-05 16:42:40,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3864 to 3862. [2025-02-05 16:42:40,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3862 states, 3861 states have (on average 1.4682724682724684) internal successors, (5669), 3861 states have internal predecessors, (5669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:40,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3862 states to 3862 states and 5669 transitions. [2025-02-05 16:42:40,426 INFO L78 Accepts]: Start accepts. Automaton has 3862 states and 5669 transitions. Word has length 67 [2025-02-05 16:42:40,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:40,427 INFO L471 AbstractCegarLoop]: Abstraction has 3862 states and 5669 transitions. [2025-02-05 16:42:40,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:40,427 INFO L276 IsEmpty]: Start isEmpty. Operand 3862 states and 5669 transitions. [2025-02-05 16:42:40,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:42:40,429 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:40,429 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:40,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:42:40,430 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:42:40,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:40,430 INFO L85 PathProgramCache]: Analyzing trace with hash -821924727, now seen corresponding path program 1 times [2025-02-05 16:42:40,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:40,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533218632] [2025-02-05 16:42:40,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:40,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:40,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:42:40,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:42:40,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:40,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:40,638 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 16:42:40,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:40,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533218632] [2025-02-05 16:42:40,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533218632] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:40,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:40,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:42:40,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001993278] [2025-02-05 16:42:40,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:40,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:42:40,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:40,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:42:40,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:42:40,640 INFO L87 Difference]: Start difference. First operand 3862 states and 5669 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:40,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:40,904 INFO L93 Difference]: Finished difference Result 23714 states and 34859 transitions. [2025-02-05 16:42:40,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:42:40,904 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-02-05 16:42:40,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:40,959 INFO L225 Difference]: With dead ends: 23714 [2025-02-05 16:42:40,960 INFO L226 Difference]: Without dead ends: 19888 [2025-02-05 16:42:40,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:42:40,973 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 766 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:40,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 1092 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:42:40,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19888 states. [2025-02-05 16:42:41,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19888 to 7686. [2025-02-05 16:42:41,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7686 states, 7685 states have (on average 1.464281067013663) internal successors, (11253), 7685 states have internal predecessors, (11253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:41,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7686 states to 7686 states and 11253 transitions. [2025-02-05 16:42:41,266 INFO L78 Accepts]: Start accepts. Automaton has 7686 states and 11253 transitions. Word has length 94 [2025-02-05 16:42:41,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:41,266 INFO L471 AbstractCegarLoop]: Abstraction has 7686 states and 11253 transitions. [2025-02-05 16:42:41,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:41,266 INFO L276 IsEmpty]: Start isEmpty. Operand 7686 states and 11253 transitions. [2025-02-05 16:42:41,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:42:41,270 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:41,270 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:41,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:42:41,271 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:42:41,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:41,271 INFO L85 PathProgramCache]: Analyzing trace with hash 822624297, now seen corresponding path program 1 times [2025-02-05 16:42:41,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:41,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187099478] [2025-02-05 16:42:41,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:41,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:41,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:42:41,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:42:41,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:41,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:41,487 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:42:41,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:41,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187099478] [2025-02-05 16:42:41,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187099478] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:41,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:41,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:42:41,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684976298] [2025-02-05 16:42:41,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:41,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:42:41,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:41,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:42:41,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:42:41,489 INFO L87 Difference]: Start difference. First operand 7686 states and 11253 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:41,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:41,761 INFO L93 Difference]: Finished difference Result 27538 states and 40443 transitions. [2025-02-05 16:42:41,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:42:41,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-02-05 16:42:41,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:41,809 INFO L225 Difference]: With dead ends: 27538 [2025-02-05 16:42:41,809 INFO L226 Difference]: Without dead ends: 23712 [2025-02-05 16:42:41,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:42:41,820 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 803 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:41,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 969 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:42:41,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23712 states. [2025-02-05 16:42:42,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23712 to 13430. [2025-02-05 16:42:42,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13430 states, 13429 states have (on average 1.4587087646138952) internal successors, (19589), 13429 states have internal predecessors, (19589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:42,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13430 states to 13430 states and 19589 transitions. [2025-02-05 16:42:42,154 INFO L78 Accepts]: Start accepts. Automaton has 13430 states and 19589 transitions. Word has length 94 [2025-02-05 16:42:42,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:42,154 INFO L471 AbstractCegarLoop]: Abstraction has 13430 states and 19589 transitions. [2025-02-05 16:42:42,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:42,154 INFO L276 IsEmpty]: Start isEmpty. Operand 13430 states and 19589 transitions. [2025-02-05 16:42:42,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:42:42,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:42,157 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:42,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:42:42,158 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:42:42,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:42,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1320623159, now seen corresponding path program 1 times [2025-02-05 16:42:42,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:42,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663605360] [2025-02-05 16:42:42,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:42,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:42,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:42:42,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:42:42,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:42,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:42,371 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 16:42:42,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:42,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663605360] [2025-02-05 16:42:42,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663605360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:42,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:42,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:42:42,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565562287] [2025-02-05 16:42:42,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:42,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:42:42,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:42,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:42:42,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:42:42,373 INFO L87 Difference]: Start difference. First operand 13430 states and 19589 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:42,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:42,607 INFO L93 Difference]: Finished difference Result 31362 states and 46027 transitions. [2025-02-05 16:42:42,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:42:42,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-02-05 16:42:42,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:42,676 INFO L225 Difference]: With dead ends: 31362 [2025-02-05 16:42:42,676 INFO L226 Difference]: Without dead ends: 27536 [2025-02-05 16:42:42,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:42:42,692 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 859 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:42,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 959 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:42:42,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27536 states. [2025-02-05 16:42:43,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27536 to 17254. [2025-02-05 16:42:43,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17254 states, 17253 states have (on average 1.4590505998956702) internal successors, (25173), 17253 states have internal predecessors, (25173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:43,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17254 states to 17254 states and 25173 transitions. [2025-02-05 16:42:43,121 INFO L78 Accepts]: Start accepts. Automaton has 17254 states and 25173 transitions. Word has length 94 [2025-02-05 16:42:43,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:43,121 INFO L471 AbstractCegarLoop]: Abstraction has 17254 states and 25173 transitions. [2025-02-05 16:42:43,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:43,122 INFO L276 IsEmpty]: Start isEmpty. Operand 17254 states and 25173 transitions. [2025-02-05 16:42:43,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:42:43,126 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:43,126 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:43,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:42:43,126 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:42:43,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:43,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1112778903, now seen corresponding path program 1 times [2025-02-05 16:42:43,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:43,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5043095] [2025-02-05 16:42:43,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:43,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:43,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:42:43,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:42:43,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:43,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:43,361 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 16:42:43,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:43,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5043095] [2025-02-05 16:42:43,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5043095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:43,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:43,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:42:43,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179285449] [2025-02-05 16:42:43,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:43,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:42:43,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:43,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:42:43,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:42:43,363 INFO L87 Difference]: Start difference. First operand 17254 states and 25173 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:43,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:43,572 INFO L93 Difference]: Finished difference Result 35186 states and 51611 transitions. [2025-02-05 16:42:43,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:42:43,572 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-02-05 16:42:43,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:43,644 INFO L225 Difference]: With dead ends: 35186 [2025-02-05 16:42:43,644 INFO L226 Difference]: Without dead ends: 31360 [2025-02-05 16:42:43,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:42:43,662 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 779 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:43,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 1052 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:42:43,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31360 states. [2025-02-05 16:42:43,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31360 to 21078. [2025-02-05 16:42:43,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21078 states, 21077 states have (on average 1.4592683968306686) internal successors, (30757), 21077 states have internal predecessors, (30757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:44,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21078 states to 21078 states and 30757 transitions. [2025-02-05 16:42:44,115 INFO L78 Accepts]: Start accepts. Automaton has 21078 states and 30757 transitions. Word has length 94 [2025-02-05 16:42:44,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:44,115 INFO L471 AbstractCegarLoop]: Abstraction has 21078 states and 30757 transitions. [2025-02-05 16:42:44,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:44,115 INFO L276 IsEmpty]: Start isEmpty. Operand 21078 states and 30757 transitions. [2025-02-05 16:42:44,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:42:44,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:44,119 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:44,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:42:44,120 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:42:44,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:44,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1431352112, now seen corresponding path program 1 times [2025-02-05 16:42:44,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:44,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811084302] [2025-02-05 16:42:44,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:44,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:44,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:42:44,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:42:44,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:44,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:44,295 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:42:44,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:44,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811084302] [2025-02-05 16:42:44,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811084302] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:44,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:44,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:42:44,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292756882] [2025-02-05 16:42:44,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:44,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:42:44,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:44,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:42:44,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:42:44,297 INFO L87 Difference]: Start difference. First operand 21078 states and 30757 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:44,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:44,507 INFO L93 Difference]: Finished difference Result 36610 states and 53739 transitions. [2025-02-05 16:42:44,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:42:44,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-02-05 16:42:44,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:44,582 INFO L225 Difference]: With dead ends: 36610 [2025-02-05 16:42:44,583 INFO L226 Difference]: Without dead ends: 33984 [2025-02-05 16:42:44,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:42:44,599 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 759 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:44,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 1225 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:42:44,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33984 states. [2025-02-05 16:42:44,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33984 to 23702. [2025-02-05 16:42:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23702 states, 23701 states have (on average 1.461077591662799) internal successors, (34629), 23701 states have internal predecessors, (34629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:44,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23702 states to 23702 states and 34629 transitions. [2025-02-05 16:42:44,988 INFO L78 Accepts]: Start accepts. Automaton has 23702 states and 34629 transitions. Word has length 95 [2025-02-05 16:42:44,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:44,989 INFO L471 AbstractCegarLoop]: Abstraction has 23702 states and 34629 transitions. [2025-02-05 16:42:44,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:44,989 INFO L276 IsEmpty]: Start isEmpty. Operand 23702 states and 34629 transitions. [2025-02-05 16:42:44,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:42:44,993 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:44,993 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:44,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:42:44,994 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:42:44,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:44,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1104882405, now seen corresponding path program 1 times [2025-02-05 16:42:44,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:44,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48820578] [2025-02-05 16:42:44,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:44,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:45,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:42:45,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:42:45,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:45,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:45,189 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:45,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:45,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48820578] [2025-02-05 16:42:45,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48820578] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:45,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:45,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:42:45,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475823114] [2025-02-05 16:42:45,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:45,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:42:45,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:45,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:42:45,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:45,191 INFO L87 Difference]: Start difference. First operand 23702 states and 34629 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:45,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:45,302 INFO L93 Difference]: Finished difference Result 40800 states and 59848 transitions. [2025-02-05 16:42:45,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:42:45,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-02-05 16:42:45,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:45,344 INFO L225 Difference]: With dead ends: 40800 [2025-02-05 16:42:45,344 INFO L226 Difference]: Without dead ends: 17134 [2025-02-05 16:42:45,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:45,373 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 62 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:45,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 288 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:42:45,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17134 states. [2025-02-05 16:42:45,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17134 to 17132. [2025-02-05 16:42:45,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17132 states, 17131 states have (on average 1.4619695289241725) internal successors, (25045), 17131 states have internal predecessors, (25045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:45,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17132 states to 17132 states and 25045 transitions. [2025-02-05 16:42:45,627 INFO L78 Accepts]: Start accepts. Automaton has 17132 states and 25045 transitions. Word has length 96 [2025-02-05 16:42:45,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:45,627 INFO L471 AbstractCegarLoop]: Abstraction has 17132 states and 25045 transitions. [2025-02-05 16:42:45,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:45,627 INFO L276 IsEmpty]: Start isEmpty. Operand 17132 states and 25045 transitions. [2025-02-05 16:42:45,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:42:45,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:45,631 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:45,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:42:45,631 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:42:45,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:45,632 INFO L85 PathProgramCache]: Analyzing trace with hash -62448018, now seen corresponding path program 1 times [2025-02-05 16:42:45,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:45,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101284885] [2025-02-05 16:42:45,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:45,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:45,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:42:45,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:42:45,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:45,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:46,339 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:46,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:46,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101284885] [2025-02-05 16:42:46,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101284885] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:42:46,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42969034] [2025-02-05 16:42:46,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:46,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:42:46,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:42:46,343 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:42:46,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:42:46,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:42:46,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:42:46,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:46,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:46,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 16:42:46,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:42:47,395 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:47,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:42:48,294 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:48,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42969034] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:42:48,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:42:48,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 29 [2025-02-05 16:42:48,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794099051] [2025-02-05 16:42:48,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:42:48,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 16:42:48,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:48,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 16:42:48,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2025-02-05 16:42:48,296 INFO L87 Difference]: Start difference. First operand 17132 states and 25045 transitions. Second operand has 30 states, 30 states have (on average 8.6) internal successors, (258), 29 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:55,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:55,012 INFO L93 Difference]: Finished difference Result 191199 states and 276811 transitions. [2025-02-05 16:42:55,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2025-02-05 16:42:55,013 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 8.6) internal successors, (258), 29 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-02-05 16:42:55,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:55,441 INFO L225 Difference]: With dead ends: 191199 [2025-02-05 16:42:55,441 INFO L226 Difference]: Without dead ends: 174111 [2025-02-05 16:42:55,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11171 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=4727, Invalid=25723, Unknown=0, NotChecked=0, Total=30450 [2025-02-05 16:42:55,510 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 6107 mSDsluCounter, 1751 mSDsCounter, 0 mSdLazyCounter, 2540 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6107 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 2613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:55,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6107 Valid, 1882 Invalid, 2613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2540 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 16:42:55,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174111 states. [2025-02-05 16:42:57,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174111 to 98535. [2025-02-05 16:42:57,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98535 states, 98534 states have (on average 1.438234518034384) internal successors, (141715), 98534 states have internal predecessors, (141715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98535 states to 98535 states and 141715 transitions. [2025-02-05 16:42:57,460 INFO L78 Accepts]: Start accepts. Automaton has 98535 states and 141715 transitions. Word has length 96 [2025-02-05 16:42:57,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:57,460 INFO L471 AbstractCegarLoop]: Abstraction has 98535 states and 141715 transitions. [2025-02-05 16:42:57,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.6) internal successors, (258), 29 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand 98535 states and 141715 transitions. [2025-02-05 16:42:57,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:42:57,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:57,469 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:57,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 16:42:57,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 16:42:57,670 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:42:57,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:57,671 INFO L85 PathProgramCache]: Analyzing trace with hash 988921932, now seen corresponding path program 1 times [2025-02-05 16:42:57,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:57,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921379458] [2025-02-05 16:42:57,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:57,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:57,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:42:57,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:42:57,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:57,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:58,241 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:58,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:58,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921379458] [2025-02-05 16:42:58,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921379458] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:42:58,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864527100] [2025-02-05 16:42:58,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:58,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:42:58,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:42:58,244 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:42:58,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:42:58,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:42:58,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:42:58,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:58,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:58,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 16:42:58,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:42:58,829 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:58,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:42:59,423 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:59,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864527100] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:42:59,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:42:59,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 27 [2025-02-05 16:42:59,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695359341] [2025-02-05 16:42:59,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:42:59,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 16:42:59,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:59,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 16:42:59,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2025-02-05 16:42:59,426 INFO L87 Difference]: Start difference. First operand 98535 states and 141715 transitions. Second operand has 28 states, 28 states have (on average 8.678571428571429) internal successors, (243), 27 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:01,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:01,613 INFO L93 Difference]: Finished difference Result 396288 states and 566825 transitions. [2025-02-05 16:43:01,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-05 16:43:01,614 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.678571428571429) internal successors, (243), 27 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-02-05 16:43:01,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:02,031 INFO L225 Difference]: With dead ends: 396288 [2025-02-05 16:43:02,031 INFO L226 Difference]: Without dead ends: 297791 [2025-02-05 16:43:02,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=523, Invalid=1829, Unknown=0, NotChecked=0, Total=2352 [2025-02-05 16:43:02,104 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 1452 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1452 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:02,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1452 Valid, 860 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:43:02,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297791 states. [2025-02-05 16:43:04,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297791 to 231037. [2025-02-05 16:43:04,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231037 states, 231036 states have (on average 1.4270200315102408) internal successors, (329693), 231036 states have internal predecessors, (329693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:05,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231037 states to 231037 states and 329693 transitions. [2025-02-05 16:43:05,588 INFO L78 Accepts]: Start accepts. Automaton has 231037 states and 329693 transitions. Word has length 97 [2025-02-05 16:43:05,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:05,588 INFO L471 AbstractCegarLoop]: Abstraction has 231037 states and 329693 transitions. [2025-02-05 16:43:05,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.678571428571429) internal successors, (243), 27 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:05,589 INFO L276 IsEmpty]: Start isEmpty. Operand 231037 states and 329693 transitions. [2025-02-05 16:43:05,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 16:43:05,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:05,601 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:43:05,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 16:43:05,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 16:43:05,802 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:05,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:05,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1704929777, now seen corresponding path program 1 times [2025-02-05 16:43:05,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:05,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343370155] [2025-02-05 16:43:05,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:05,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:05,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 16:43:05,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 16:43:05,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:05,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:05,852 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 16:43:05,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:05,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343370155] [2025-02-05 16:43:05,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343370155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:05,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:05,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:43:05,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723673707] [2025-02-05 16:43:05,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:05,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:43:05,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:05,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:43:05,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:43:05,854 INFO L87 Difference]: Start difference. First operand 231037 states and 329693 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:07,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:07,866 INFO L93 Difference]: Finished difference Result 429133 states and 613042 transitions. [2025-02-05 16:43:07,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:43:07,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-02-05 16:43:07,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:08,213 INFO L225 Difference]: With dead ends: 429133 [2025-02-05 16:43:08,214 INFO L226 Difference]: Without dead ends: 198244 [2025-02-05 16:43:08,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:43:08,304 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 92 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:08,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 188 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:43:08,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198244 states. [2025-02-05 16:43:10,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198244 to 198244. [2025-02-05 16:43:10,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198244 states, 198243 states have (on average 1.4193893353107045) internal successors, (281384), 198243 states have internal predecessors, (281384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:10,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198244 states to 198244 states and 281384 transitions. [2025-02-05 16:43:10,894 INFO L78 Accepts]: Start accepts. Automaton has 198244 states and 281384 transitions. Word has length 98 [2025-02-05 16:43:10,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:10,894 INFO L471 AbstractCegarLoop]: Abstraction has 198244 states and 281384 transitions. [2025-02-05 16:43:10,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:10,895 INFO L276 IsEmpty]: Start isEmpty. Operand 198244 states and 281384 transitions. [2025-02-05 16:43:10,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 16:43:10,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:10,903 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:43:10,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:43:10,903 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:10,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:10,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1906876594, now seen corresponding path program 1 times [2025-02-05 16:43:10,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:10,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570687460] [2025-02-05 16:43:10,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:10,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:10,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 16:43:10,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 16:43:10,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:10,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:10,992 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 16:43:10,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:10,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570687460] [2025-02-05 16:43:10,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570687460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:10,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:10,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:43:10,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500207192] [2025-02-05 16:43:10,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:10,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:43:10,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:10,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:43:10,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:43:10,995 INFO L87 Difference]: Start difference. First operand 198244 states and 281384 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:12,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:12,898 INFO L93 Difference]: Finished difference Result 367870 states and 522873 transitions. [2025-02-05 16:43:12,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:43:12,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-02-05 16:43:12,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:13,270 INFO L225 Difference]: With dead ends: 367870 [2025-02-05 16:43:13,271 INFO L226 Difference]: Without dead ends: 169726 [2025-02-05 16:43:13,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:43:13,343 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 81 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:13,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 171 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:43:13,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169726 states. [2025-02-05 16:43:15,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169726 to 169726. [2025-02-05 16:43:15,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169726 states, 169725 states have (on average 1.408148475475033) internal successors, (238998), 169725 states have internal predecessors, (238998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:15,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169726 states to 169726 states and 238998 transitions. [2025-02-05 16:43:15,501 INFO L78 Accepts]: Start accepts. Automaton has 169726 states and 238998 transitions. Word has length 98 [2025-02-05 16:43:15,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:15,501 INFO L471 AbstractCegarLoop]: Abstraction has 169726 states and 238998 transitions. [2025-02-05 16:43:15,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:15,502 INFO L276 IsEmpty]: Start isEmpty. Operand 169726 states and 238998 transitions. [2025-02-05 16:43:15,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 16:43:15,507 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:15,508 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:43:15,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:43:15,508 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:15,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:15,508 INFO L85 PathProgramCache]: Analyzing trace with hash -181391906, now seen corresponding path program 1 times [2025-02-05 16:43:15,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:15,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537401422] [2025-02-05 16:43:15,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:15,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:15,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 16:43:15,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 16:43:15,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:15,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:43:15,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:15,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537401422] [2025-02-05 16:43:15,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537401422] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:43:15,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292427724] [2025-02-05 16:43:15,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:15,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:43:15,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:43:15,912 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:43:16,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 16:43:16,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 16:43:16,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 16:43:16,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:16,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:16,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-05 16:43:16,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:43:20,030 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:43:20,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:43:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:43:21,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292427724] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:43:21,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:43:21,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20, 17] total 47 [2025-02-05 16:43:21,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568792314] [2025-02-05 16:43:21,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:43:21,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-02-05 16:43:21,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:21,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-02-05 16:43:21,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1979, Unknown=0, NotChecked=0, Total=2162 [2025-02-05 16:43:21,640 INFO L87 Difference]: Start difference. First operand 169726 states and 238998 transitions. Second operand has 47 states, 47 states have (on average 5.76595744680851) internal successors, (271), 47 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)